CodeForces760B

B. Frodo and pillows

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

n hobbits are planning to spend the night at Frodo's house. Frodo has n beds standing in a row and m pillows (n ≤ m). Each hobbit needs a bed and at least one pillow to sleep, however, everyone wants as many pillows as possible. Of course, it's not always possible to share pillows equally, but any hobbit gets hurt if he has at least two pillows less than some of his neighbors have.

Frodo will sleep on the k-th bed in the row. What is the maximum number of pillows he can have so that every hobbit has at least one pillow, every pillow is given to some hobbit and no one is hurt?

Input

The only line contain three integers n, m and k (1 ≤ n ≤ m ≤ 109, 1 ≤ k ≤ n) — the number of hobbits, the number of pillows and the number of Frodo's bed.

Output

Print single integer — the maximum number of pillows Frodo can have so that no one is hurt.

Examples

input

4 6 2

output

2

input

3 10 3

output

4

input

3 6 1

output

3

Note

In the first example Frodo can have at most two pillows. In this case, he can give two pillows to the hobbit on the first bed, and one pillow to each of the hobbits on the third and the fourth beds.

In the second example Frodo can take at most four pillows, giving three pillows to each of the others.

In the third example Frodo can take three pillows, giving two pillows to the hobbit in the middle and one pillow to the hobbit on the third bed.

 以k位置为中心，枕头数量向两侧递减。二分搜索答案。

//2017.01.31
#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int main()
{
    int n, m, k;
    while(cin>>n>>m>>k)
    {
        m -= n;
        long long lp = k-1, rp = n-k;
        long long l = 0, r = m, mid, ans;
        while(l<=r)
        {
            mid = (l+r)>>1;
            long long tmp = mid;
            if(mid>=lp)tmp += (mid*2-lp-1)*lp/2;
            else tmp += (mid-1)*mid/2;
            if(tmp > m){r = mid-1;continue;}
            if(mid>=rp)tmp += (mid*2-rp-1)*rp/2;
            else tmp += (mid-1)*mid/2;
            if(tmp < m){
                ans = mid+1;
                l = mid+1;
            }
            else if(tmp > m)r = mid-1;
            else{
                ans = mid+1;
                break;
            }
        }
        cout<<ans<<endl;
    }

    return 0;
}