n,m,k=map(int,input().split())
m-=n
d=0
k-=1
ans=1
while m>1 and d!=max(k,n-k-1):
ans+=1
m-=1
l=min(d,k)
r=min(d,n-k-1)
d+=1
m-=l
m-=r
ans+=m//n
print(ans)
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define pb push_back
#define FOR(n) for (int i = 0; i < n; i++)
#define FORj(n) for (int j = 0; j < n; j++)
void solve() {
int n, m, k;cin >> n >> m >> k;
int l = k, r = k;
int ans = 1;
m -= n;
while (m >= (r - l + 1)) {
ans++;
m -= (r - l + 1);
r = min(r + 1, n);
l = max(l - 1, 1 );
if (l == 1 && r == n) break;
}
ans += (m / n);
cout << ans;
}
int main () {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
//cin >> T;
while (T--) solve();
return 0;
}
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |