#include <bits/stdc++.h>
using namespace std;
long long npr(long long n, long long r) {
  long long res = 1;
  for (long long i = n; i > n - r; i--) res *= i;
  return res;
}
long long ncr(long long n, long long r) {
  if (r > n) return 0;
  if (r * 2 > n) r = n - r;
  if (r == 0) return 1;
  long long res = n;
  for (long long i = 2; i <= r; i++) {
    res *= (n - i + 1);
    res /= i;
  }
  return res;
}
bool notprime(int n) {
  if (n == 1) return 0;
  for (int i = 2; i <= sqrt(n); i += 2) {
    if (i % 2 == 0) i++;
    if (n % i == 0) return 1;
  }
  return 0;
}
string to_str(long long n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
long long to_int(string str) {
  long long val;
  stringstream stream;
  stream << str;
  stream >> val;
  return val;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long n1, long long n2) {
  long long m;
  m = n1 * n2 / gcd(n1, n2);
  return m;
}
string binary(long long n) {
  string result;
  do result.push_back('0' + (n & 1));
  while (n >>= 1);
  reverse(result.begin(), result.end());
  return result;
}
long long fast_power(long long x, long long y) {
  if (y == 0) return 1;
  long long temp = fast_power(x, y / 2);
  temp = (temp * temp);
  if (y % 2 != 0) temp = temp * x;
  return temp;
}
long long n, x, y, z, c, c1, c2, c3, c4, k, k1, k2, t, arr;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  map<long long, int> m;
  for (long long i = 1; i <= k; i++) {
    if (m[n % i] == 1) return cout << "No", 0;
    m[n % i] = 1;
  }
  cout << "Yes";
  return 0;
}
