#include <iostream>
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
bool 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 true;
}
return false;
}
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;
if(check(n,m,k,mid)==true){
ans=mid;
low=mid+1;
}
else{
high=mid-1;
}
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp0eXBlZGVmIGxvbmcgbG9uZyBpbnQgbGw7CgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmJvb2wgY2hlY2sobGwgbiAsIGxsIG0gLCBsbCBrICwgbGwgbWlkKXsKdmVjdG9yPGxsPiBhcnIobisxLDEpOwp2ZWN0b3I8bGw+IGFycjEobisxLDEpOwoKYXJyW2tdPW1pZDsKYXJyMVtrXT1taWQ7CmxsIGk9aysxOwpsbCBzdW09MDsKCndoaWxlKGk8PW4pewoJYXJyW2ldPWFycltpLTFdKzE7CgoJYXJyMVtpXT1tYXgoMUxMLGFycjFbaS0xXS0xKTsKCglpKys7Cn0KaT1rLTE7Cgp3aGlsZShpPj0xKXsKCWFycltpXT1hcnJbaSsxXSsxOwoKCWFycjFbaV09bWF4KDFMTCxhcnIxW2krMV0tMSk7CgoKCWktLTsKCQp9CmxsIGxvdyA9IDA7CmxsIGhpZ2ggPSAwOwoKZm9yKGxsIGk9MTtpPD1uO2krKyl7ICAKCQoJbG93ID0gbG93ICsgYXJyMVtpXTsKCWhpZ2ggPSBoaWdoICsgYXJyW2ldOwoJCn0KCmlmKG0+PWxvdyAmJiBtPD1oaWdoKXsKCXJldHVybiB0cnVlOwp9CnJldHVybiBmYWxzZTsKCgoKfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglsbCBuLG0sazsKCWNpbj4+bj4+bT4+azsKCWxsIGxvdz0xOwoJbGwgaGlnaD1tOwoJbGwgYW5zID0gMTsKCQoJd2hpbGUobG93PD1oaWdoKXsKCQlsbCBtaWQgPSAobG93K2hpZ2gpLzI7CgkJCgkJaWYoY2hlY2sobixtLGssbWlkKT09dHJ1ZSl7CgkJCWFucz1taWQ7CgkJCWxvdz1taWQrMTsKCQl9CgkJZWxzZXsKCQkJaGlnaD1taWQtMTsKCQl9Cgl9CgkKCWNvdXQ8PGFuczw8ZW5kbDsKCQoJcmV0dXJuIDA7Cn0=