#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint1000000007;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

ll n,m;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m;
    ll x=2;
    mint ans=1;
    while(x*x<=m){
        int c=0;
        while(m%x==0){
            m/=x;
            c++;
        }
        x++;
        if(c==0)continue;
        vector<vector<mint>>dp(n+1,vector<mint>(c+1)),S(n+1,vector<mint>(c+1));
        rep(i,c+1){
            dp[0][i]=1;
            S[0][i]=i+1;
        }
        rep(i,n-1){
            rep(j,c+1){
                dp[i+1][j]+=S[i][c-j];
            }
            S[i+1][0]=dp[i+1][0];
            rep2(j,1,c+1){
                S[i+1][j]=S[i+1][j-1]+dp[i+1][j];
            }
        }
        ans*=S[n-1][c];
    }
    if(m>1){
        int c=1;
        vector<vector<mint>>dp(n+1,vector<mint>(c+1)),S(n+1,vector<mint>(c+1));
        rep(i,c+1){
            dp[0][i]=1;
            S[0][i]=i+1;
        }
        rep(i,n-1){
            rep(j,c+1){
                dp[i+1][j]+=S[i][c-j];
            }
            S[i+1][0]=dp[i+1][0];
            rep2(j,1,c+1){
                S[i+1][j]=S[i+1][j-1]+dp[i+1][j];
            }
        }
        ans*=S[n-1][c];
    }
    cout<<ans.val()<<"\n";
}