#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<LL> d;

int main() {
	cin >> n >> x;
	
	if(n >= 18) { cout << 0 << endl; return 0; }
	
	/*
	x++;
	for(int i = 2; i * i <= x; i++) {
		if(x % i == 0) {
			int j = 0;
			while(x % i == 0) {
				x /= i;
				j++;
			}
			f.EB(i, j);
		}
	}
	if(x != 1) { f.EB(x, 1); }
	*/
	
	x++;
	for(LL i = 2; i < x; i++) {
		if(x % i == 0) { d.PB(i); }
	}
	
	//cout << d << endl;
	if(d.size() == 0) { cout << 0 << endl; return 0; }
	
	LL c[18], v = 1, ans = 0;
	c[0] = d.size() - 1;
	#define F(i) for(c[i] = 0; c[i] <= c[i - 1]; c[i]++) { if(v * d[ c[i] ] > x) { break; } v *= d[ c[i] ]; if(i == n) { if(v == x) { ans++; } } else {
	#define G(i) } v /= d[ c[i] ]; }
	
	F( 1)
	F( 2)
	F( 3)
	F( 4)
	F( 5)
	F( 6)
	F( 7)
	F( 8)
	F( 9)
	F(10)
	F(11)
	F(12)
	F(13)
	F(14)
	F(15)
	F(16)
	F(17)
	F(18)
		
	G(18)
	G(17)
	G(16)
	G(15)
	G(14)
	G(13)
	G(12)
	G(11)
	G(10)
	G( 9)
	G( 8)
	G( 7)
	G( 6)
	G( 5)
	G( 4)
	G( 3)
	G( 2)
	G( 1)
	
	cout << ans << endl;
	
	return 0;
}