CodeForce 597ADivisibility

Description

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 ≤ 10¹⁸; - 10¹⁸ ≤ a ≤ b ≤ 10¹⁸).

Output

Print the required number.

Sample Input

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

#include
int main()
{
long long k,a,b;
while(~scanf("%lld%lld%lld",&k,&a,&b))
{
if(a>0)
printf("%lld\n",b/k-(a-1)/k);
else if(b<0)
{
a=-a;
b=-b;
printf("%lld\n",a/k-(b-1)/k);
}
else
printf("%lld\n",b/k+(-a)/k+1);
}
return 0;
 }