#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
//約数の個数
vector<int> DivisorCount(long long n) {
	vector<int> x;
	for (long long i = 2; i*i <= n; i++) {
		int c = 0;
		while (n%i == 0) { // 素数で割り切れなくなるまで割っていく
			c++;//割った個数を配列に足す
			n /= i;
		}
		if (0 != c) x.push_back(c);
		if (1 == n) break;
	}
	if (1 != n) x.push_back(1);
	return x;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	long long m; cin >> m;
	auto v = DivisorCount(m);
	map<int, mint>mp;
	mint ans = 1;
	rep(i, v.size()) {
		if (mp.count(v[i])) {
			ans *= mp[v[i]];
			continue;
		}
		vector<vector<mint>> dp(n + 1, vector<mint>(v[i] + 2));
		dp[0][0] = 1;
		rep(j, n) {
			rep(k, v[i] + 1) {
				dp[j + 1][0] += dp[j][k];
				dp[j + 1][v[i] - k + 1] -= dp[j][k];
			}
			rep(k, v[i] + 1)dp[j + 1][k + 1] += dp[j + 1][k];
		}
		mint sub = 0;
		rep(j, v[i] + 1)sub += dp[n][j];
		ans *= sub;
		mp[v[i]] = sub;
	}
	cout << ans.val() << endl;
	return 0;
}