A - Divisibility

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

Output

Print the required number.

Example

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

题意：a到b中能够整除k 的个数

      

分情况讨论：

 

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