#ifndef HIDDEN_IN_VS // 折りたたみ用

// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS

// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;

// 型名の短縮
using ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）
using pii = pair<int, int>;	using pll = pair<ll, ll>;	using pil = pair<int, ll>;	using pli = pair<ll, int>;
using vi = vector<int>;		using vvi = vector<vi>;		using vvvi = vector<vvi>;	using vvvvi = vector<vvvi>;
using vl = vector<ll>;		using vvl = vector<vl>;		using vvvl = vector<vvl>;	using vvvvl = vector<vvvl>;
using vb = vector<bool>;	using vvb = vector<vb>;		using vvvb = vector<vvb>;
using vc = vector<char>;	using vvc = vector<vc>;		using vvvc = vector<vvc>;
using vd = vector<double>;	using vvd = vector<vd>;		using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;

// 定数の定義
const double PI = acos(-1);
int DX[4] = {1, 0, -1, 0}; // 4 近傍（下，右，上，左）
int DY[4] = {0, 1, 0, -1};
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;

// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;

// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定

// 汎用関数の定義
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }

#endif // 折りたたみ用


#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;

#ifdef _MSC_VER
#include "localACL.hpp"
#endif

//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);

namespace atcoder {
	inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
	inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif


#ifdef _MSC_VER // 手元環境（Visual Studio）
#include "local.hpp"
#else // 提出用（gcc）
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#endif


//【置換 → 巡回置換の積】O(n)
/*
* [0..n) の置換 i → p[i] を巡回置換の積に分解し，巡回置換表記のリストを返す．
*/
vvi cycle_decomposition(const vi& p) {
	// verify : https://atcoder.jp/contests/abc175/tasks/abc175_d

	int n = sz(p);

	vvi cycles;
	vb seen(n);

	rep(i, n) {
		// 抽出済のサイクルに含まれるなら次へ
		if (seen[i]) continue;

		// 新しいサイクルを発見
		cycles.push_back(vi());

		// サイクルを順に格納していく．
		int s = i;
		do {
			cycles.rbegin()->push_back(s);
			seen[s] = true;
			s = p[s];
		} while (s != i);
	}

	return cycles;
}


void zikken() {
	int n = 3 * 3 * 4 * 4 * 6 * 6;

	vi p(n); vi eq(n);

	rep(i3, 3) rep(j3, 3) {
		int ni3 = i3, nj3 = j3 + 1;
		if (nj3 == 3) {
			nj3 = 0;
			ni3 = (ni3 + 1) % 3;
		}

		rep(i4, 4) rep(j4, 4) {
			int ni4 = i4, nj4 = j4 + 1;
			if (nj4 == 4) {
				nj4 = 0;
				ni4 = (ni4 + 1) % 4;
			}
			
			rep(i6, 6) rep(j6, 6) {
				int ni6 = i6, nj6 = j6 + 1;
				if (nj6 == 6) {
					nj6 = 0;
					ni6 = (ni6 + 1) % 6;
				}

				int s = ((((i3 * 3 + j3) * 4 + i4) * 4 + j4) * 6 + i6) * 6 + j6;
				int t = ((((ni3 * 3 + nj3) * 4 + ni4) * 4 + nj4) * 6 + ni6) * 6 + nj6;

				eq[s] = (i3 == i4 && i4 == i6 && j3 == j4 && j4 == j6);
				p[s] = t;
			}
		}
	}
	dump(accumulate(all(eq), 0));
//	dump(p);

	auto cs = cycle_decomposition(p);
//	dumpel(cs);

	repe(c, cs) {
		int sum = 0;
		repe(i, c) {
			sum += eq[i];
			cout << eq[i] << " ";
		}
		cout << " : " << sum << endl;
	}

	exit(0);
}
// 9 → 3+3+3+0+...+0


//【桁の数の取得（桁数固定）】O(log n)
/*
* n を len 桁で b 進表記したときの桁の数字を上位桁から順に並べたリストを返す．
*
* 制約：|b| ≧ 2
*/
vi integer_digits(ll n, int len, ll b = 10) {
	// verify : https://yukicoder.me/problems/no/327

	assert(abs(b) >= 2);

	// mod |b| を取れば最下位桁から順に決定していく．
	vi ds(len);
	rep(i, len) {
		int d = (int)smod(n, abs(b));
		ds[len - 1 - i] = d;
		n = (n - d) / b;
	}

	return ds;
}


//【桁の数からの復元】O(n)
/*
* b 進表記で上位桁から順に ds[0..n) が並んだ数の値を返す．
*/
ll from_digits(const vi& ds, ll b = 10) {
	// verify : https://atcoder.jp/contests/abc105/tasks/abc105_c

	int n = sz(ds);

	ll res = 0, powb = 1;
	repir(i, n - 1, 0) {
		res += ds[i] * powb;
		powb *= b;
	}

	return res;
}


void TLE() {
	int N; ll m;
	cin >> N >> m;

	int n3 = powi(3, N), n2 = powi(2, N);
	ll n4 = powi(4, N), n6 = powi(6, N), n12 = powi(12, N);

	unordered_map<ll, vl> ts;

	rep(i3, n3) {
		auto ds = integer_digits(i3, N, 3);

		ll i4 = from_digits(ds, 4);

		vl rem{ i3, i4 };
		vl mod{ n3, n4 };
		auto [t, lcm] = crt(rem, mod);

		ll i6 = from_digits(ds, 6);

		ll h = smod<ll>(i6 - i3, n3) * n2 + smod<ll>(i6 - i4, n2);

		ts[h].push_back(t);
	}

	int res = 0;
	for (auto& [h, t] : ts) {
		int L = sz(t);

		sort(all(t));
		t.push_back(t.front() + n12);

		rep(i, L) if (t[i + 1] - t[i] > m) res++;
	}

	cout << res << endl;
}


void umekomi() {
	cout << "vector<vector<pli>> a={" << endl;
	repi(N, 1, 15) {
		dump(N);
		int n3 = powi(3, N), n2 = powi(2, N);
		ll n4 = powi(4, N), n6 = powi(6, N), n12 = powi(12, N);

		unordered_map<ll, vl> ts;

		rep(i3, n3) {
			auto ds = integer_digits(i3, N, 3);

			ll i4 = from_digits(ds, 4);

			vl rem{ i3, i4 };
			vl mod{ n3, n4 };
			auto [t, lcm] = crt(rem, mod);

			ll i6 = from_digits(ds, 6);

			ll h = smod<ll>(i6 - i3, n3) * n2 + smod<ll>(i6 - i4, n2);

			ts[h].push_back(t);
		}

		unordered_map<ll, int> cnt;

		for (auto& [h, t] : ts) {
			int L = sz(t);

			sort(all(t));
			t.push_back(t.front() + n12);

			rep(i, L) cnt[t[i + 1] - t[i]]++;
		}

		cout << "{";
		for (auto it = cnt.begin(); it != cnt.end(); it++) {
			cout << "{" << it->first << "," << it->second << "}";
			if (next(it) != cnt.end()) cout << ",";
		}
		cout << "}";

		if (N < 15) cout << "," << endl;
		else cout << endl;
	}
	cout << "};" << endl;

	exit(0);
}


vector<vector<pli>> a = {
{{1,2},{10,1}},
{{1,6},{142,3}},
{{1438,3},{1,18},{1726,3},{286,3}},
{{5470,6},{1,54},{15262,6},{20734,15}},
{{1,162},{248830,15},{26206,6},{15262,18},{192094,6},{41470,15},{233566,6},{207358,15}},
{{1,486},{2985982,111},{2721886,6},{705022,54},{264094,18},{2280958,42},{2016862,12}},
{{1,1458},{20637790,18},{9222046,18},{35831806,207},{5971966,243},{26609758,18},{29859838,207},{3250078,18}},
{{80885662,108},{1,4374},{429981694,1899},{247572574,18},{182409118,18},{194353054,18},{235628638,18},{349096030,108}},
{{1,13122},{859963390,2187},{4299816958,2187},{5159780350,2187}},
{{1,39366},{61917364222,10935},{16339304446,4374},{45578059774,4374}},
{{1,118098},{619173642238,19683},{123834728446,19683},{743008370686,19683}},
{{1,354294},{8916100448254,98415},{6810910064638,39366},{2105190383614,39366}},
{{1,1062882},{17832200896510,177147},{89161004482558,177147},{106993205379070,177147}},
{{1,3188646},{1283918464548862,1594323}},
{{1,9565938},{2567836929097726,1594323},{12839184645488638,1594323},{15407021574586366,1594323}}
};


int main() {
//	input_from_file("input.txt");
//	output_to_file("output.txt");

//	zikken();
//	umekomi();

	int N; ll m;
	cin >> N >> m;

	int res = 0;
	for (auto& [dif, cnt] : a[N - 1]) {
		if (dif > m) res += cnt;
	}

	cout << res << endl;
}