Divisibility

Find 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 ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).

Output

Print the required number.

Examples

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

inputFormat

Input

The only line contains three space-separated integers k, a and b (1 ≤ k ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).

outputFormat

Output

Print the required number.

Examples

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

样例

2 -4 4

5

</p>