#include <bits/stdc++.h>
using namespace std;
inline long long fexp(long long b, long long e) {
  long long x = 1;
  for (; e; e >>= 1, b = (b * b) % (1000000007))
    if (e & 1) x = (x * b) % (1000000007);
  return x;
}
long long n, k, ok, i, j, x;
set<long long> S;
signed main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  ok = 1;
  for (x = 1; x <= k && ok; x++) {
    S.clear();
    for (i = 1; i <= x; i++) {
      if (S.count(n % i))
        ok = 0;
      else
        S.insert(n % i);
    }
  }
  cout << (ok ? "Yes" : "No") << endl;
  return 0;
  return 0;
}
