#include <bits/stdc++.h>

using namespace std;

void fast_io() {
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
}

long long pow_mod(long long base, int exp, long long mod) {
	long long res = 1;
	while (exp > 0) {
		if (exp % 2 == 1) {
			res = (res * base) % mod;
		}
		base = (base * base) % mod;
		exp /= 2;
	}
	return res;
}

int main() {
	fast_io();
	int n, m;
	cin >> n >> m;
	vector<long long> a;
	for (int i = 1; i <= n; i++) {
		a.push_back(pow_mod(i, m, n));
	}
	sort(a.begin(), a.end());
	a.erase(unique(a.begin(), a.end()), a.end());
	cout << (a.size() == n ? "Yes" : "No") << endl;
}