import std.stdio, std.algorithm, std.array, std.conv, std.typecons, std.range;

void main() {
	auto tmp = readln.split.to!(ulong[]);
	auto N = tmp[0], M = tmp[1];
	
	bool[ulong] Aset;
	foreach (i; 1 .. N+1) {
		auto m = pow_mod(i, M, N);
		if (m in Aset) { writeln("No"); return; }
		Aset[m] = true;
	}
	writeln("Yes");
}

// (i ^^ p) % n for i > 0
ulong pow_mod(ulong i, ulong p, ulong n) {
	ulong result = 1;
	foreach (_; 0 .. p) {
		result = (result * i) % n;
	}
	return result;
}