#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; }	o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}";	return o; }
template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; }
template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) is >> v[i]; return is; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false



vector<vector<ll>> part;
vector<ll> modfac;

// 拡張ユークリッド互除法 (入力 : 整数 a, n, 出力 : GCD(a, n) と xa + yb = GCD(a, n) を満たす整数 x, y)
void ExEuclid(ll a, ll b, ll& gcd, ll& x, ll& y) {

	ll r1, r2, r3, x1, x2, x3, y1, y2, y3, q;

	r1 = a; x1 = 1; y1 = 0;
	r2 = b; x2 = 0; y2 = 1;

	while (r2 != 0) {

		r3 = r1 % r2;
		q = r1 / r2;

		x3 = x1 - q * x2;
		y3 = y1 - q * y2;

		r1 = r2; r2 = r3;
		x1 = x2; x2 = x3;
		y1 = y2; y2 = y3;

	}

	gcd = r1; x = x1; y = y1;
	if (gcd < 0) { gcd *= -1; x *= -1; y *= -1; };
}

// a と m は互いに素が前提
ll invmod(ll a, ll m) {
	ll gcd, x, q;
	ExEuclid(a, -m, gcd, x, q);
	if (gcd != 1) return -1;
	if (x < 0)
		x += m;

	return x;
}

// FactorInteger(48) = {{2, 4}, {3, 1}};
map<ll, ll> FactorInteger(ll n) {
	map<ll, ll> mp;
	ll i;
	for (i = 2; i*i <= n; i++) {
		while (n % i == 0) {
			mp[i]++;
			n /= i;
		}
	}
	if (n > 1) mp[n]++;
	return mp;
}

void part_int_sub(ll n, ll k, vector<ll> a) {
	if (n == 0)
		part.push_back(a);
	else if (n == 1) {
		a.push_back(1);
		part.push_back(a);
	}
	else if (k == 1) {
		for (int i = 0; i < n; i++)
			a.push_back(1);
		part.push_back(a);
	}
	else {
		if (n >= k) {
			a.push_back(k);
			part_int_sub(n - k, k, a);
			a.pop_back();
		}
		part_int_sub(n, k - 1, a);
	}
}

ll solve(ll N, ll M) {
	const ll MOD = 1000000007;

	modfac.resize(100010);
	modfac[0] = 1;
	for (ll i = 1; i < 100010; i++)
		modfac[i] = modfac[i - 1] * i % MOD;

	ll base = modfac[N];

	ll ans = 1;

	auto fac = FactorInteger(M);
	for (auto e : fac) {
		ll x = 0;

		part.clear();

		ll p = e.second;
		
		part_int_sub(p, p, vector<ll>());

		for (ll i = 0; i < part.size(); i++) {
			if (part[i].size() > N)
				continue;
			ll y = base;
			map<ll, ll> ps;
			for (ll j = 0; j < part[i].size(); j++)
				ps[part[i][j]]++;
			ll rem = N;
			for (auto ee : ps) {
				ll pp = ee.second;
				y = y * invmod(modfac[pp], MOD) % MOD;
				rem -= pp;
			}
			y = y * invmod(modfac[rem], MOD) % MOD;
			x = (x + y) % MOD;
		}
		ans = ans * x % MOD;
	}
	
	return ans;
}

struct SXor128 {
	unsigned x, y, z, w;
	SXor128() { x = 123456789; y = 362436069; z = 521288629; w = 88675123; }
	SXor128(int _w) { x = 123456789; y = 362436069; z = 521288629; w = _w; }
	void setSeed() { x = 123456789; y = 362436069; z = 521288629; w = 88675123; }
	void setSeed(int _w) { x = 123456789; y = 362436069; z = 521288629; w = _w; }
	unsigned nextUInt() {
		unsigned t = (x ^ (x << 11));
		x = y; y = z; z = w;
		return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
	}
	unsigned nextUInt(unsigned mod) {
		unsigned t = (x ^ (x << 11));
		x = y; y = z; z = w;
		w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
		return w % mod;
	}
	unsigned nextUInt(unsigned l, unsigned r) {
		unsigned t = (x ^ (x << 11));
		x = y; y = z; z = w;
		w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
		return w % (r - l + 1) + l;
	}
	double nextDouble() {
		return double(nextUInt()) / UINT_MAX;
	}
} rnd;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	//while (true) {
	//	ll N = rnd.nextUInt(30) + 1;
	//	ll M = rnd.nextUInt(30) + 1;
	//	ll ans = solve(N, M);
	//	if (ans > 100000)
	//		cerr << N << ", " << M << endl;
	//}

	ll N, M;
	cin >> N >> M;

	cout << solve(N, M) << endl;

	return 0;
}

Measured memory_bytes: 1536