#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int inf = INT_MAX;
const int lim = 1e7 + 5;
long long power(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= mod) ret %= mod;
    if (a >= mod) a %= mod;
    b >>= 1;
  }
  return ret;
}
long long inv(long long x) { return power(x, mod - 2); }
bool vis[lim];
int main() {
  long long n, k;
  cin >> n >> k;
  for (int i = 1; i < k + 1; i++) {
    if (vis[n % i]) {
      cout << "No\n";
      return 0;
    }
    vis[n % i] = true;
  }
  cout << "Yes\n";
}
