#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));
    for (int i = 0; i <= cnt; i++) {
        dp[0][i] = 1;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j <= cnt; j++) {
            for (int k = 0; k <= cnt; k++) {
                if (j + k <= cnt) {
                    dp[i][k] += dp[i - 1][j];
                }
            }
        }
    }
    mint res = 0;
    for (int i = 0; i <= cnt; i++) {
        res += dp[n - 1][i];
    }
    return res;
}
int main() {
    fast_io();
    int n;
    long long m;
    cin >> n >> m;
    mint ans = 1;
    for (long long i = 2; i * i <= m; i++) {
        if (m % i == 0) {
            int cnt = 0;
            while (m % i == 0) {
                m /= i;
                cnt++;
            }
            ans *= calc(n, cnt);
        }
    }
    if (m > 1) {
        ans *= calc(n, 1);
    }
    cout << ans.val() << endl;
}