#include <bits/stdc++.h>
using namespace std;
int main() {
  set<long long> s;
  long long n, k;
  cin >> n >> k;
  for (int i = 1; i <= k; i++) {
    if (s.find(n % i) != s.end()) break;
    s.insert(n % i);
  }
  if (s.size() == k)
    cout << "YES";
  else
    cout << "NO";
}
