#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int N; int X;
	while (~scanf("%d%d", &N, &X)) {
		++X;
		vector<int> divs;
		for (int d = 1; d * d <= X; ++d) if (X % d == 0) {
			divs.push_back(d);
			if(d * d != X)
				divs.push_back(X / d);
		}
		sort(divs.begin(), divs.end());
		auto getID = [&](int x) {
			return (int)(lower_bound(divs.begin(), divs.end(), x) - divs.begin());
		};
		int D = (int)divs.size();
		vector<vector<pair<int,int>>> edges(D);
		rep(prod, D) {
			reu(k, 1, D) {
				if ((ll)divs[prod] * divs[k] > X) break;
				if (X % (divs[prod] * divs[k]) != 0) continue;
				edges[prod].emplace_back(k, getID(divs[prod] * divs[k]));
			}
		}
		vector<vector<int>> dp, ndp(D, vector<int>(D));
		ndp[0][1] = 1;
		rep(i, N) {
			dp.swap(ndp);
			ndp.assign(D, vector<int>(D, 0));
			rep(prod, D) rep(last, D) {
				int x = dp[prod][last];
				if (x == 0) continue;
				for(auto &&e : edges[prod]) if(last <= e.first)
					ndp[e.second][e.first] += x;
			}
		}
		int ans = accumulate(ndp[D - 1].begin(), ndp[D - 1].end(), 0);
		printf("%d\n", ans);
	}
	return 0;
}