Imp is watching a documentary about cave painting.

<image>

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 <image>, 1 ≤ i ≤ k, are distinct, i. e. there is no such pair (i, j) that: 

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

Input

The only line contains two integers n, k (1 ≤ n, k ≤ 1018).

Output

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

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

Examples

Input

4 4


Output

No


Input

5 3


Output

Yes

Note

In the first sample remainders modulo 1 and 4 coincide.
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long double eps = 1e-12;
long long int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
long long int n, res = 0, k = 0, h, ans = 0, m;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int x, long long int y) {
  return (x * y) / gcd(x, y);
}
long long int pot(long long int a, long long int b) {
  long long int r = 1;
  while (b) {
    if (b % 2) r = (r * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return r % mod;
}
void pr(long long int a[], long long int n) {
  for (long long int i = 1; i <= n; i++) cout << a[i] << " ";
  cout << '\n';
}
void read(long long int a[], long long int n) {
  for (long long int i = 1; i <= n; i++) cin >> a[i];
}
void yes() { cout << "Yes\n"; }
void no() { cout << "No\n"; }
vector<long long int> v[200015], vnode[200015];
void add_edge(long long int x, long long int y) {
  v[x].push_back(y);
  v[y].push_back(x);
}
string s2, ch = "", s, s1 = "", t;
vector<pair<string, long long int> > vs;
vector<pair<pair<long long int, long long int>, long long int> > vvv, vvv2;
vector<pair<long long int, long long int> > vv[200015], vv2;
long long int a[200015];
map<long long int, long long int> mp;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long int i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, mm, idx = 0,
                ok = 0, l = 0, r, negatif = 0, positif = 0;
  set<pair<long long int, long long int> >::iterator itw, ith;
  set<long long int>::iterator it;
  multiset<long long int> mst, mst2;
  cin >> n >> k;
  if (n == 1 && k == 1 || (n == 1 && k == 2)) return yes(), 0;
  if (n <= k) return no(), 0;
  if (k == 1) return yes(), 0;
  if (n % 2 == 0) return no(), 0;
  for (i = 1; i <= min(k, 100000000 * 1LL); i++) {
    long long int md = n % i;
    if (mp[md]) return no(), 0;
    mp[md] = 1;
  }
  yes(), 0;
  return 0;
}
