#include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;

template<typename T>
inline bool chmax(T& a, const T& b) {
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

/**
 * @brief 多次元 vector の作成
 * @author えびちゃん
 */
namespace detail {
    template<typename T, int N>
    auto make_vec(vector<int>& sizes, T const& x) {
        if constexpr (N == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[N-1];
            sizes.pop_back();
            return vector(size, make_vec<T, N-1>(sizes, x));
        }
    }
}
template<typename T, int N>
auto make_vec(int const(&sizes)[N], T const& x = T()) {
    vector<int> s(N);
    for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];
    return detail::make_vec<T, N>(s, x);
}

__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int main() {
    int n, z;
    cin >> n >> z;

    auto mypow = [](int x, int y) {
        ll res = 1;
        ll mul = x;
        while (y > 0) {
            if (y & 1) res *= mul;
            mul *= mul;
            y >>= 1;
        }
        return res;
    };

    int right = mypow(z, n);
    vector<bool> check(right);

    for (int i = 1; i < z; ++i) {
        check[mypow(i, n)] = true;
    }

    for (int i = 1; i < z; ++i) {
        if (check[right - mypow(i, n)]) {
            cout << "Yes\n";
            return 0;
        }
    }
    cout << "No\n";
}