#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++) using namespace std; typedef long long int ll; typedef vector VI; typedef vector VL; typedef pair PI; const ll mod = 1e9 + 7; const int F = 1500; const int N = 31; map memo[F][N]; ll solve(const VL &fact, int k, int rem, ll x) { if (x == 1) { return rem <= 0 ? 1 : 0; } if (k >= fact.size()) { return 0; } if (rem <= 0) { return 0; } ll f = fact[k]; if (rem == 1) { return x >= f ? 1 : 0; } if (memo[k][rem].count(x) == 0) { memo[k][rem][x] = 0; } else { return memo[k][rem][x]; } ll &ret = memo[k][rem][x]; if (x % f == 0) { ret += solve(fact, k, rem - 1, x / f); } ret += solve(fact, k + 1, rem, x); return ret; } int main(void){ int n; ll x; cin >> n >> x; x += 1; if (n >= 30) { cout << 0 << endl; return 0; } VL fact; for (int i = 1; i * i <= x; ++i) { if (x % i == 0) { if (i > 1) { fact.push_back(i); } if (x != i * i) { fact.push_back(x / i); } } } sort(fact.begin(), fact.end()); cout << solve(fact, 0, n, x) << endl; }