Far Manager Gym - 100694B（思维）

Pavel loves Far Manager very much. By default, Far shows files in a certain number of columns each of which holds p files. Besides, there is also a «zero file» — the link to the parent directory, after which the files in the current directory are shown.

Pavel is viewing a directory with n files numbered from 1 to n. He needs to select the file x. To do that, he has to place the cursor onto this file. He can press any of the four arrow keys: up / down arrows move the cursor by 1 file, and left / right arrows move it by p files (or place the cursor onto the «zero file» or the last file if less than p files remains in the cursor's movement direction).

Your task is to help Pavel to determine the minimum number of key presses to select the file x. At the beginning the cursor points to the link to the parent directory.

Input

The only line contains 3 integers p, n and x (1 ≤ p ≤ 10⁹, 1 ≤ n ≤ 10⁹, 1 ≤ x ≤ n) — the maximum number of files in a column, the total number of files in the directory viewed by Pavel and the file he wants to select.

Output

Write one integer — the minimum number of key presses Pavel needs to select the file x.

Examples

Input

5 8 3

Output

3

Input

6 20 14

Output

4

Input

8 33 33

Output

5

#include <stdio.h>
#include <string.h>

long long min(long long x, long long y)
{
    if(x<y) return x;
    else return y;
}

int main()
{
    long long p, n, x, ree, shang, yu, re;
    scanf("%lld %lld %lld", &p, &n, &x);

    shang = x / p;
    yu = x % p;
    re = shang + yu;

    shang++;
    yu = min(n-x, shang*p-x);
    ree = shang + yu;
    if(ree<re) re = ree;



    x = n - x;

    shang = x / p;
    yu = x % p;
    ree = yu + shang + n/p;
    if(n%p>0) ree++;
    if(ree < re) re = ree;

    shang++;
    yu = min(n-x, shang*p-x);
    ree = yu + shang + n/p;
    if(n%p>0) ree++;
    if(ree < re) re = ree;


    printf("%lld\n", re);
    return 0;
}