#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, m;
  cin >> n >> m;
  set<long long int> s;
  for (int i = 1; i <= m; i++) {
    if (s.find(n % i) != s.end()) {
      cout << "no";
      return 0;
    }
    s.insert(n % i);
  }
  cout << "yes" << endl;
  return 0;
}
