#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

ll modpow(ll a, ll n, ll m) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % m;
        a = a * a % m;
        n >>= 1;
    }
    return res;
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N, M;
    cin >> N >> M;
    
    vector<bool> find(N);
    rep(i, 0, N) find[modpow(i+1, M, N)] = true;
    
    rep(i, 0, N) if (!find[i]) {
        cout << "No\n";
        return 0;
    }
    cout << "Yes\n";
}