#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  int flg = 1;
  set<long long> st;
  for (long long i = 1; i <= k; i++) {
    long long rem = n % i;
    if (st.find(rem) != st.end()) {
      flg = 0;
      break;
    }
    st.insert(rem);
  }
  if (flg)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
