// 嘘解法05
#include <iostream>
#include <vector>

using namespace std;
typedef unsigned long long ull;

int main() {
  ull N, M;
  cin >> N >> M;

  vector<bool> is_appeared(N);

  for(ull i=0; i<N; i++){
    ull next = 1;
    for(ull j=0; j<M; j++){
      next *= i;
    }
    next %= N;
    if(is_appeared[next]){
      cout << "No" << endl;
      return 0;
    }
    else {
      is_appeared[next] = true;
    }
  }

  cout << "Yes" << endl;
  return 0;
}