#include <bits/stdc++.h>
using namespace std;
#include<atcoder/math>
using namespace atcoder;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
constexpr ll MAX = 2000000000000000000;
constexpr ld PI = 3.14159265358979;
constexpr ll MOD = 0;//2024948111;
ld dotorad(ld K){ return PI * K / 180.0; }
ld radtodo(ld K){ return K * 180.0 / PI; }
mt19937 mt;
void randinit(){ srand((unsigned)time(NULL));mt = mt19937(rand()); }
int main(){
    ll N,M;
    cin >> N >> M;
    vector<ll> pow3(30,1),pow4(30,1),pow6(30,1);
    for(ll i = 1;i < 30;i++){
        pow3[i] = pow3[i - 1] * 3;
        pow4[i] = pow4[i - 1] * 4;
        pow6[i] = pow6[i - 1] * 6;
    }
    ll l = lcm(lcm(pow3[N],pow4[N]),pow6[N]);

    vector<ll> s,t;
    for(ll bb = 0;bb < pow3[N];bb++){
        ll c = bb;
        ll p3 = 0,p4 = 0,p6 = 0;
        for(ll i = 0;i < N;i++){
            ll x = c % 3;
            c /= 3;
            p3 += x * pow3[i];
            p4 += x * pow4[i];
            p6 += x * pow6[i];
        }
        pair<ll,ll> P = crt({p3,p4,p6},{pow3[N],pow4[N],pow6[N]});
        if(P.second != l) continue;
        //assert(p3 == b);
        //cerr << p3 << " " << p4 << " " << p6 << endl;
        //cerr << P.first << " " << P.second << endl;
        s.emplace_back(P.first);
        s.emplace_back(P.first + l);
        s.emplace_back(P.first + l + l);
        ll x = P.first - M;
        x %= l;
        if(x < 0) x += l;
        t.emplace_back(x);
    }
    sort(s.begin(),s.end());
    
    ll ans = 0;
    for(ll i = 0;i < (ll)t.size();i++){
        ll x = t[i];
        if(M > l) continue;
        auto it = lower_bound(s.begin(),s.end(),x);
        if(*it == x + M) ans++;
    }
    cout << ans << endl;
}