#include <bits/stdc++.h>
using namespace std;
set<long long> mod;
int main() {
  long long n, k;
  scanf("%I64d%I64d", &n, &k);
  bool result = true;
  for (long long i = 1LL; i <= k; i++) {
    long long x = n % i;
    if (mod.find(x) != mod.end()) {
      result = false;
      break;
    }
    mod.insert(x);
  }
  printf("%s\n", result ? "Yes" : "No");
  return 0;
}
