#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define _overload3(_1,_2,_3,name,...) name #define _rep(i,n) repi(i,0,n) #define repi(i,a,b) for(ll i=ll(a);i=0;--i) #define all(x) (x).begin(),(x).end() #define PRINT(V) cout << V << "\n" #define SORT(V) sort((V).begin(),(V).end()) #define RSORT(V) sort((V).rbegin(), (V).rend()) using namespace std; using ll = long long; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b void cins(itr first,itr last){ for (auto i = first;i != last;i++){ cin >> (*i); } } template void array_output(itr start,itr goal){ string ans = "",k = " "; for (auto i = start;i != goal;i++) ans += to_string(*i)+k; if (!ans.empty()) ans.pop_back(); PRINT(ans); } ll gcd(ll a, ll b) { return a ? gcd(b%a,a) : b; } const int INF = 1e9; const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll EPS = 1e-10; int sgn(const double a){ return (a < -EPS ? -1 : (a > EPS ? +1 : 0)); } typedef pair P; typedef tuple tri; typedef pair point; typedef complex Point; const ll MAX = 201; constexpr ll nx[4] = {-1,0,1,0}; constexpr ll ny[4] = {0,1,0,-1}; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll n,z; cin >> n >> z; if (n >= 3){ PRINT("No"); } else if (n == 2){ rep(x,1,z+1){ rep(y,1,z+1){ if (x*x+y*y == z*z){ PRINT("Yes"); return 0; } } } PRINT("No"); } else{ if (z == 1) PRINT("No"); else PRINT("Yes"); } }