#include <iostream>
#include<bits/stdc++.h>
typedef long long int ll;


using namespace std;

ll check(ll n , ll m , ll k , ll mid){
vector<ll> arr(n+1,1);
vector<ll> arr1(n+1,1);

arr[k]=mid;
arr1[k]=mid;
ll i=k+1;
ll sum=0;

while(i<=n){
	arr[i]=arr[i-1]+1;

	arr1[i]=max(1LL,arr1[i-1]-1);

	i++;
}
i=k-1;

while(i>=1){
	arr[i]=arr[i+1]+1;

	arr1[i]=max(1LL,arr1[i+1]-1);


	i--;
	
}
ll low = 0;
ll high = 0;

for(ll i=1;i<=n;i++){  
	
	low = low + arr1[i];
	high = high + arr[i];
	
}

if(m>=low && m<=high){
	return 1;
}

if(m>high){
	return 2;
}

if(m<low){
	return 3;
}
return 0;





}

int main() {
	// your code goes here
	ll n,m,k;
	cin>>n>>m>>k;
	ll low=1;
	ll high=m;
	ll ans = 1;
	
	while(low<=high){
		ll mid = (low+high)/2;
		ll a = check(n,m,k,mid);
		if(a==1){
			ans=mid;
			low=mid+1;
		}
		else{
		if(a==2){
			low=mid+1;
		}
	    else{
	    	high=mid-1;
	    }
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}
