跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2656. Primes on Interval

  • ID: 2662
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 二分
  • 数论
  • 双指针
  • 算法思想
  • 数学
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2317 题。保留原作者与原赛事署名。