#include <bits/stdc++.h>

#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint1000000007;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

mint calc(int n, int cnt) {
    vector<vector<mint>> dp(n, vector<mint>(cnt + 1)),
        cum(n, vector<mint>(cnt + 2, 0));
    for (int i = 0; i <= cnt; i++) {
        dp[0][i] = 1;
        cum[0][i + 1] = cum[0][i] + dp[0][i];
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j <= cnt; j++) {
            dp[i][j] = cum[i - 1][cnt - j + 1];
            cum[i][j + 1] = cum[i][j] + dp[i][j];
        }
    }
    return cum[n - 1][cnt + 1];
}
int main() {
    fast_io();
    int n;
    long long m;
    cin >> n >> m;
    map<int, int> cnts;
    for (long long i = 2; i * i <= m; i++) {
        if (m % i == 0) {
            int cnt = 0;
            while (m % i == 0) {
                m /= i;
                cnt++;
            }
            cnts[cnt]++;
        }
    }
    if (m > 1) {
        cnts[1]++;
    }
    mint ans = 1;
    for (auto [cnt, freq] : cnts) {
        ans *= calc(n, cnt).pow(freq);
    }
    cout << ans.val() << endl;
}