#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
    ll N, M;cin>>N>>M;
    vector<ll> A(N);
    unordered_set<ll> o;
    rep(i, N){

        ll newi = i+1;
        ll val = 1 % N;
        rep(a, M){
            val = (val * newi) % N;
        }

        A[i] = val;
        if(o.count(A[i])){
            cout <<"No"<<endl;
            return 0 ;
        }
        o.insert(A[i]);
        
    }

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