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

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

void solve() {
	int n, m;
	cin >> n >> m;
	if (m == 1 || n <= 2) {
		cout << "Yes\n";
		return;
	}
	for (int d = 2; d * d <= n; d++) {
		int ct = 0;
		while (n % d == 0) {
			ct++;
			n /= d;
		}
		if (ct > 1) {
			cout << "No\n";
			return;
		}
	}
	if (m & 1) cout << "Yes\n";
	else cout << "No\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}