#include <bits/stdc++.h>
using namespace std;
vector<int> primes;
void sieve() {
  bool isComposite[1000000] = {false};
  for (int i = 2; i * i <= 1000000; i++) {
    if (isComposite[i] == false)
      for (int j = 2; j * i <= 1000000; j++) isComposite[i * j] = true;
  }
  for (int i = 2; i <= 1000000; i++)
    if (isComposite[i] == false) primes.push_back(i);
}
long long LCM(int n) {
  long long lcm = 1;
  for (int i = 0; i < primes.size() && primes[i] <= n; i++) {
    int pp = primes[i];
    while (pp * primes[i] <= n) pp = pp * primes[i];
    if (lcm > (1e18 + 1) / pp) return -1;
    lcm *= pp;
  }
  return lcm;
}
int main() {
  sieve();
  long long n, k;
  cin >> n >> k;
  if (k < 43 && (n + 1) % LCM(k) == 0)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
