#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7, INF = 1e8, mx = 2e5 + 5, mn = 100;
int testCase = 1, cas = 0;
int main() {
  ios_base ::sync_with_stdio(0), cin.tie(0);
  long long n, k;
  while (cin >> n >> k) {
    int ok = 1;
    if (n == 1) {
      if (k > 2) ok = 0;
    } else if (k >= n)
      ok = 0;
    else {
      if (n % 2 == 0 && k > 1)
        ok = 0;
      else if (n % 2 == 1 && k > 2) {
        map<long long, int> F;
        for (long long i = 1; ok && i <= k; i++) {
          long long x = (n % i);
          if (F[x]) ok = 0;
          F[x]++;
        }
      }
    }
    cout << (ok ? "YES" : "NO") << endl;
  }
  return 0;
}
