水题

Imp is watching a documentary about cave painting.

Some numbers, carved in chaotic order, immediately attracted his attention. Imp rapidly proposed a guess that they are the remainders of division of a number n by all integers i from 1 to k. Unfortunately, there are too many integers to analyze for Imp.

Imp wants you to check whether all these remainders are distinct. Formally, he wants to check, if all , 1 ≤ i ≤ k, are distinct, i. e. there is no such pair (i, j) that:

• 1 ≤ i < j ≤ k,
• , where  is the remainder of division x by y.

Input

The only line contains two integers n, k (1 ≤ n, k ≤ 10¹⁸).

Output

Print "Yes", if all the remainders are distinct, and "No" otherwise.

You can print each letter in arbitrary case (lower or upper).

Example

Input

4 4

Output

No

Input

5 3

Output

Yes

Note

In the first sample remainders modulo 1 and 4 coincide.

题意：输入n，k，求所有1<=i<j<=k,是否满足n%i！=n%j，若满足 输出Yes，否则 输出No，也就是n%（1~k）所有的数取余，余数是不是都不一样；

题解：此题比较巧，只需要判断 n%i == i-1 即可。

#include<stdio.h>
int main()
{
    long long a,b,i;
    scanf("%lld %lld",&a,&b);
      for (i=1;i<=b;i++)
      {
          if(a%i!=i-1)
          {
              printf("No\n");
              break;
          }
      }
      if(i==b+1)
        printf("Yes\n");
    return 0;
}