#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(i, v) for(auto i =  v.begin(); i !=  v.end(); ++i)
#define RFOR(i, v) for(auto i = v.rbegin(); i != v.rend(); ++i)

template<typename T> bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template<typename T> ostream & operator<<(ostream & os, const vector<T> & v) {
	os << "[";
	FOR(it, v) {
		if(it != v.begin()) { os << ", "; }
		os << *it;
	}
	os << "]";
	return os;
}
template<typename F, typename S> ostream & operator<<(ostream & os, const pair<F, S> & p) {
	os << "<" << p.FI << ", " << p.SE << ">";
	return os;
}

// ---- ----

int n, x;
vector<pair<int, int>> pe;
int pn, et;

vector<pair<LL, int>> ivs;
map<LL, int> vi;
pair<bool, int> memo[30][1400][1400];
int ans;

void search(int i, int total, int pre) {
	if(memo[i][total][pre].FI) { ans += memo[i][total][pre].SE; return; }
	LL ans_n = ans;
	
	if(i == n) {
		if(ivs[total].FI == x) { ans++; }
		return;
	}
	
	incID(j, pre, ivs.size()) {
		LL m = ivs[total].FI * ivs[j].FI;
		if(ivs[total].SE + ivs[j].SE + (n - i - 1) <= et && x % m == 0) {
			search(i + 1,  vi[m], j);
		}
	}
	
	memo[i][total][pre].FI = true;
	memo[i][total][pre].SE = ans - ans_n;
}

int main() {
	cin >> n >> x;
	x++;
	
	if(n >= 30) { cout << 0 << endl; return 0; }
	
	int xx = x;
	for(int i = 2; i * i <= xx; i++) {
		if(xx % i == 0) {
			int j = 0;
			while(xx % i == 0) {
				xx /= i;
				j++;
			}
			pe.EB(i, j);
		}
	}
	if(xx != 1) { pe.EB(xx, 1); }
	pn = pe.size();
	inc(i, pn) { et += pe[i].SE; }
	
	// cout << pe << endl;
	
	
	if(et == 1) { cout << 0 << endl; return 0; }
	
	vector<int> d;
	inc(i, pn) { d.PB(0); }
	LL v = 1, s = 0;
	int c = 0;
	while(true) {
		// cout << d << endl;
		ivs.EB(v, s);
		
		c = 0;
		while(c < pn && d[c] == pe[c].SE) { inc(i, pe[c].SE) { v /= pe[c].FI; } s -= pe[c].SE; d[c++] = 0; }
		if(c == pn) { break; }
		v *= pe[c].FI;
		s++;
		d[c]++;
	}
	
	sort(ALL(ivs));
	inc(i, ivs.size()) {
		vi[ ivs[i].FI ] = i;
	}
	
	// cout << ivs << endl;
	
	search(0, 0, 1);
	
	cout << ans << endl;
	
	return 0;
}