#include <cstdio>

int main() {
  long long s, p;
  scanf("%lld%lld", &s, &p);
  for (long long i = 1; i * i <= p; ++i)
    if (p % i == 0) {
      if (i + p / i == s) return puts("Yes"), 0;
    }
  puts("No");
  return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
//---------------------------------//

int main() {
	ll S, P;
	cin >> S >> P;
	puts([&] {
		for (ll i = 1; i * i <= P; ++i) {
			ll n = i, m = S - i;
			if (n > 0 && m > 0 && n * m == P) return true;
		}
		return false;
	}() ? "Yes": "No");
	return 0;
}