#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, z;
    cin >> n >> z;
    vector<int> pown(z, 1);
    for(int i = 1; i <= z; ++i){
        for(int j = 0; j < n; ++j)  pown[i - 1] *= i;
    }
    for(int i = 0; i < z; ++i){
        int j = prev(upper_bound(begin(pown), end(pown), pown[z - 1] - pown[i])) - begin(pown);
        if(pown[i] + pown[j] == pown[z - 1]){
            cout << "Yes\n";
            return 0;
        }
    }
    cout << "No\n";

    return 0;
}