#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

int main() {
    cin>>N>>K;
    bool yes = false;
    if(N == 1){
        yes = K >= 2;
    }else if(N == 2){
        ll temp(1);
        rep(i,N) temp *= K;
        rep(i, 1000){
            rep(j, 1000){
                if(temp == (ll)i * i + j * j) yes = true;
            }
        }
    }else{
        yes = false;
    }
    cout<<(yes ? "Yes" : "No")<<endl;
}