#include using namespace std; #include using namespace atcoder; using mint = atcoder::modint998244353; #define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++) #define ll long long #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define siz(x) (int)(x).size() template bool chmin(T& a, T b) { if (a > b) {a = b; return true;} return false; } template bool chmax(T& a, T b) { if (a < b) {a = b; return true;} return false; } const int inf = 1e9; const ll INF = 4e18; template using pq = priority_queue, less>; template using spq = priority_queue, greater>; vector di = {0, 0, 1, -1}; vector dj = {1, -1, 0, 0}; struct IoSetup { IoSetup() { #ifdef LOCAL freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } iosetup; struct Edge { int to; ll cost; }; void solve() { int N, M; cin >> N >> M; vector A(N); rep(i, 0, N) { A[i] = pow_mod(i+1, M, N); } vector seen(N, false); rep(i, 0, N) { if (seen[A[i]]) { cout << "No" << endl; return; } seen[A[i]] = true; } cout << "Yes" << endl; } int main() { int T = 1; // cin >> T; while(T--) { solve(); } }