eolymp
bolt
Try our new interface for solving problems
Problems

Primes at the interval

Primes at the interval

Two positive integers $b$ and $c$ are given. Find the maximum positive integer $a$ such that the number of prime numbers on the interval $[a; b]$ inclusively equals to $c$. \InputFile Two positive integers $b$ and $c\:(b, c \le 10^6)$. \OutputFile Print the maximum value of $a$. It is known that it usually exists. \includegraphics{https://static.eolymp.com/content/hs/hstq89oo6t28p0bgu11rtvrtm0.gif}
Time limit 1 second
Memory limit 128 MiB
Input example #1
10 3
Output example #1
3
Author Michael Medvediev