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

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep1(i,n) for(int i=n;i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(v) v.begin(),v.end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair



vector<bool> isprime(100000, true);
vi primes;
vector<pii> p;
vi yaku;
vl num(50);
vii G;
vl fact(100010), rfact(100010);


void prime(vector<bool> &isprime) {
	ll i, j;
	isprime[0] = isprime[1] = false;
	for (i = 2; i < isprime.size(); i++) {
		if (isprime[i]) {
			primes.push_back(i);
			for (j = 2; i*j < isprime.size(); j++) {
				isprime[i*j] = false;
				int temp = i * j;
			}
		}
	}
}

void dfs(int i, int now) {
	if (i == p.size()) {
		yaku.push_back(now);
		return;
	}
	dfs(i + 1, now);
	rep(j, p[i].second) {
		now *= p[i].first;
		dfs(i + 1, now);
	}
}

ll mod_pow(ll x, ll p, ll M = MOD) {
	ll a = 1;
	while (p) {
		if (p % 2)
			a = a * x%M;
		x = x * x%M;
		p /= 2;
	}
	return a;
}

ll mod_inverse(ll a, ll M = MOD) {
	return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
	fact[0] = fact[1] = rfact[0] = rfact[1] = 1;
	for (ll i = 2; i <= n; i++) {
		fact[i] = i * fact[i - 1] % M;
		rfact[i] = mod_inverse(fact[i], M);
	}
}

//http://drken1215.hatenablog.com/entry/2018/06/08/210000
//nが大きくfactが計算できないときのほかの計算方法について書いてある
ll nCr(ll n, ll r, ll M = MOD) {
	ll ret = fact[n];
	ret = (ret*rfact[r]) % M;
	ret = (ret*rfact[n - r]) % M;
	return ret;
}


int main() {
	ll n, m;
	cin >> n >> m;
	set_fact(n + 5);
	prime(isprime);
	ll m2 = m;
	rep(i, primes.size()) {
		int pr = primes[i];
		if (m2 % pr == 0) {
			p.push_back(pii(pr, 0));
		}
		while (m2 % pr == 0) {
			p[p.size() - 1].second++;
			m2 /= pr;
		}
	}
	//DEBUG_VEC(p);
	if (m2 > 1) {
		p.push_back(pii(m2, 1));
	}
	dfs(0, 1);
	sort(all(yaku));
	G.resize(yaku.size());
	rep(i, yaku.size()) {
		rep(j, yaku.size()) {
			if (yaku[j] % yaku[i] == 0 && yaku[i] != yaku[j]) {
				G[i].push_back(j);
			}
		}
	}
	vll dp(50, vl(yaku.size()));
	dp[0][0] = 1;
	rep(i, 49) {
		rep(j, yaku.size()) {
			rep(k, G[j].size()) {
				int to = G[j][k];
				dp[i + 1][to] = (dp[i + 1][to] + dp[i][j]) % MOD;
			}
		}
	}
	ll ans = 0;
	rep(i, 50) {
		if (i > n) {
			break;
		}
		ll temp = dp[i].back();
		//DEBUG(temp);
		temp = temp * nCr(n, i) % MOD;
		ans += temp;
		ans %= MOD;
	}
	cout << ans << endl;
}


Measured memory_bytes: 2688