K. K-Primes
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Given $$$l$$$ and $$$k$$$, Cuber QQ wants you to answer if there are more than $$$k$$$ primes (i.e., at least $$$k+1$$$ primes) in $$$[l,l+2k)$$$.

Input

One line with two space-separated integers $$$l,k\;(1\le l,k\le 10^8)$$$.

Output

One line with "Yes" or "No".

Examples
Input
3 3
Output
No
Input
2 1
Output
Yes