cf273C. Primes on Interval【二分】

C. Primes on Interval

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You've decided to carry out a survey in the theory of prime numbers. Let us remind you that a prime number is a positive integer that has exactly two distinct positive integer divisors.

Consider positive integers a, a + 1, ..., b (a ≤ b). You want to find the minimum integer l (1 ≤ l ≤ b - a + 1) such that for any integer x(a ≤ x ≤ b - l + 1) among l integers x, x + 1, ..., x + l - 1 there are at least k prime numbers.

Find and print the required minimum l. If no value l meets the described limitations, print -1.

Input

A single line contains three space-separated integers a, b, k (1 ≤ a, b, k ≤ 106; a ≤ b).

Output

In a single line print a single integer — the required minimum l. If there's no solution, print -1.

Examples

input

2 4 2

output

3

input

6 13 1

output

4

input

1 4 3

output

-1

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=110;
int sum[5000010];
bool vis[5000010];
void init(){
	for(int i=2;i*i<5000010;++i){
		if(vis[i])continue;
		for(int j=i*i;j<5000010;j+=i){
			vis[j]=true;
		}
	}
	for(int i=2;i<5000010;++i){
		if(!vis[i])sum[i]=sum[i-1]+1;
		else sum[i]=sum[i-1];
	}
}
bool judge(int mid,int a,int b,int k){
	for(int i=a;i<=b-mid+1;++i){
		if(sum[i+mid-1]-sum[i-1]<k)return false;
	}
	return true;
}
int main()
{
	init();
	int n,i,j,k,a,b,c;
	scanf("%d%d%d",&a,&b,&k);
	bool sign=false;
	int l=1,r=b-a+1;
	int ans=-1;
	while(l<=r){
		int mid=(l+r)>>1;
		if(judge(mid,a,b,k)){
			ans=mid;
			r=mid-1;
		}
		else {
			l=mid+1;
		}
	}
	printf("%d\n",ans);
	return 0;
}