Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Divisibility

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFind the number of *k*-divisible numbers on the segment [*a*, *b*]. In other words you need to find the number of such integer values *x* that *a* ≤ *x* ≤ *b* and *x* is divisible by *k*.

Input

The only line contains three space-separated integers *k*, *a* and *b* (1 ≤ *k* ≤ 10^{18}; - 10^{18} ≤ *a* ≤ *b* ≤ 10^{18}).

Output

Print the required number.

Examples

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/23/2019 14:55:36 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|