#include <bits/stdc++.h>

using namespace std;

long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
   int a[n];
   int arr[k];
   int y=0;
   int m=0;
   int count=0;
   for(int i=1;i<=n;i++)
   {
     a[m++] = i;
   }
  a[0] = 1 ;a[m-1] = x;
    for(int i=1;i<=k;i++)
    {
      arr[y++] = i;
    }
  a[0] = x;
  a[y-1] = 1;
  for(int i=0;i<y;i++)
  {
    if(arr[i]!=arr[i+1])
      count++;
  }
  return count;
}

int main() {
    int n;
    int k;
    int x;
    cin >> n >> k >> x;
    long answer = countArray(n, k, x);
    cout << answer << endl;
    return 0;
}