#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll mod = 998244353;
int n;

ll extgcd(ll a, ll b) {
  ll x0 = 1, x1 = 0, y0 = 0, y1 = 1;
  while (b != 0) {
    ll q = a / b;
    ll r = a % b;
    ll x2 = x0 - q * x1;
    ll y2 = y0 - q * y1;
    a = b;
    b = r;
    x0 = x1;
    x1 = x2;
    y0 = y1;
    y1 = y2;
  }
  return x0;
}

ll crt(ll r1, ll m1, ll r2, ll m2) {
  ll dpq1 = extgcd(m1, m2);
  ll m = m1 * m2;
  ll temp = (r2 - r1) * dpq1 % m2;
  return ((r1 + m1 * temp) % m + m) % m;
}


ll conv(ll v, int c) {
  ll r = 0;
  ll pc = 1;
  for (int i = 0; i < n; i++) {
    r += v % 3 * pc;
    pc *= c;
    v /= 3;
  }
  return r;
}

ll pw(ll a, ll b) {
  ll x = 1;
  while (b > 0) {
    if ((b & 1) == 1) {
      x = x * a;
    }
    a = a * a;
    b >>= 1;
  }
  return x;
}

int main() {
  cin.tie(0)->sync_with_stdio(false);
  cin >> n;
  ll m;
  cin >> m;
  const ll p3 = pw(3, n);
  const ll p4 = pw(4, n);
  const ll p6 = pw(6, n);
  const ll p12 = pw(12, n);
  unordered_map<ll, vector<ll>> mp;
  for (ll v3 = 0; v3 < p3; v3++) {
    ll v4 = conv(v3, 4);
    ll v6 = conv(v3, 6);
    ll v12 = crt(v3, p3, v4, p4);
    ll diff = (v12 + p6 - v6) % p6;
    mp[diff].push_back(v12);
  }
  ll ans = 0;
  for (auto &[k, vv]: mp) {
    ll last = vv[vv.size() - 1] - p12;
    for (ll v : vv) {
      if (v - m > last) {
        ans++;
      }
      last = v;
    }
  }
  cout << ans << endl;
}