#pragma region satashun // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") #include using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair; template using V = vector; template using VV = V>; template V make_vec(size_t a) { return V(a); } template auto make_vec(size_t a, Ts... ts) { return V(ts...))>(a, make_vec(ts...)); } template void fill_vec(T& v, const V& val) { v = val; } template void fill_vec(vector& vec, const V& val) { for (auto& v : vec) fill_vec(v, val); } #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template void chmin(T& t, const U& u) { if (t > u) t = u; } template void chmax(T& t, const U& u) { if (t < u) t = u; } template int arglb(const V& v, const T& x) { return distance(v.begin(), lower_bound(ALL(v), x)); } template int argub(const V& v, const T& x) { return distance(v.begin(), upper_bound(ALL(v), x)); } template void mkuni(vector& v) { sort(ALL(v)); v.erase(unique(ALL(v)), end(v)); } template vector sort_by(const vector& v, bool increasing = true) { vector res(v.size()); iota(res.begin(), res.end(), 0); if (increasing) { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] < v[j]; }); } else { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] > v[j]; }); } return res; } // prototype template ostream& operator<<(ostream& os, const pair& p); template ostream& operator<<(ostream& os, const vector& v); template istream& operator>>(istream& is, vector& v); template ostream& operator<<(ostream& os, const array& arr); template ostream& operator<<(ostream& os, const set& ST); template ostream& operator<<(ostream& os, const multiset& ST); template ostream& operator<<(ostream& os, const map& MP); ostream& operator<<(ostream& o, __int128_t x); // io functions template istream& operator>>(istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator<<(ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template istream& operator>>(istream& is, vector& v) { for (auto& x : v) { is >> x; } return is; } template ostream& operator<<(ostream& os, const vector& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } template ostream& operator<<(ostream& os, const array& arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template ostream& operator<<(ostream& os, const set& ST) { os << "{"; for (auto it = ST.begin(); it != ST.end(); ++it) { if (it != ST.begin()) os << ","; os << *it; } os << "}"; return os; } template ostream& operator<<(ostream& os, const multiset& ST) { os << "{"; for (auto it = ST.begin(); it != ST.end(); ++it) { if (it != ST.begin()) os << ","; os << *it; } os << "}"; return os; } template ostream& operator<<(ostream& os, const map& MP) { for (auto it = MP.begin(); it != MP.end(); ++it) { os << "(" << it->first << ": " << it->second << ")"; } return os; } string to_string(__int128_t x) { if (x == 0) return "0"; string result; if (x < 0) { result += "-"; x *= -1; } string t; while (x) { t.push_back('0' + x % 10); x /= 10; } reverse(t.begin(), t.end()); return result + t; } ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); } #ifdef LOCAL void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template V& operator+=(V& vec, const T& v) { for (auto& x : vec) x += v; return vec; } template V& operator-=(V& vec, const T& v) { for (auto& x : vec) x -= v; return vec; } // suc : 1 = newline, 2 = space template void print(T x, int suc = 1) { cout << x; if (suc == 1) cout << "\n"; else if (suc == 2) cout << " "; } template void print(const vector& v, int suc = 1) { for (int i = 0; i < v.size(); ++i) print(v[i], i == int(v.size()) - 1 ? suc : 2); } template void show(T x) { print(x, 1); } template void show(Head H, Tail... T) { print(H, 2); show(T...); } int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(int t) { return __builtin_popcount(t); } int popcount(ll t) { return __builtin_popcountll(t); } int bit_parity(int t) { return __builtin_parity(t); } int bit_parity(ll t) { return __builtin_parityll(t); } struct prepare_io { prepare_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } prep_io; #pragma endregion satashun // O(sqrt(x)) V enum_div(ll x) { V vec; for (ll i = 1; i * i <= x; ++i) { if (x % i == 0) { vec.pb(i); if (x != i * i) { vec.pb(x / i); } } } sort(ALL(vec)); return vec; } void slv() { // input int N, X; cin >> N >> X; // solve X++; auto vec = enum_div(X); int sz = SZ(vec); debug(X, vec); auto dp = make_vec(N + 1, sz + 1); dp[0][sz - 1] = 1; for (ll x : vec) { if (x == 1) continue; per(i, N) { rep(j, sz) { if (dp[i][j] == 0) continue; int c = 0; auto v = vec[j]; while (v % x == 0) { v /= x; c++; if (i + c > N) break; dp[i + c][arglb(vec, v)] += dp[i][j]; } } } } show(dp[N][0]); } int main() { int cases = 1; // cin >> cases; rep(i, cases) slv(); return 0; }