CodeForces 597A-Divisibility【数学】

A. Divisibility

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define LL __int64
using namespace std;
int main()
{
	LL k,x,y;
	scanf("%I64d%I64d%I64d",&k,&x,&y);
	if(x>0)
	{
		if(x%k==0)
		{
			LL ans=y/k-x/k+1;
			printf("%I64d\n",ans);
		}
		else
		{
			LL ans=y/k-x/k;
			printf("%I64d\n",ans);
		}
	}
	else if(x==0)
	{
		if(y!=0)
		{
			LL ans=y/k-x/k+1;
			printf("%I64d\n",ans);
		}
		else
		{
			printf("1\n");
		}
	}
	else
	{
		if(y<0)
		{
			if((y*-1)%k==0)
			{
				LL ans=(x*-1)/k-(y*-1)/k+1;
				printf("%I64d\n",ans);
			}
			else
			{
				LL ans=(x*-1)/k-(y*-1)/k;
				printf("%I64d\n",ans);
			}
		}
		if(y==0)
		{
				LL ans=(x*-1)/k-(y*-1)/k+1;
				printf("%I64d\n",ans);
		}
		if(y>0)
		{
				LL ans=(x*-1)/k+y/k+1;
				printf("%I64d\n",ans);
		}
	}
	return 0;
}