#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;



signed main(){
	int N, Z;
	cin >> N >> Z;
	int t = 1;
	REP(i, N) t *= Z;
	vector<int>cnt(1000100, 1);
	REP(i, cnt.size()) {
		REP(j, N) {
			if(cnt[i] > t) break;
			cnt[i] *= i;
		}
	}
	map<int, int>mp;
	FOR(i, 1, cnt.size()) {
		if(cnt[i] > t) continue;
		mp[cnt[i]] = i;
	}
	int flg = 0;
	REP(i, t) {
		int x = i;
		int y = t - i;
		if(mp.count(x) && mp.count(y)) {
			flg = 1;
		}
	}
	if(flg) out("Yes");
	else out("No");
}