#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

struct Combination
{
    vector< int64_t > mfact, rfact;
    
    Combination(int sz) : mfact(sz + 1), rfact(sz + 1)
    {
        mfact[0] = 1;
        for(int i = 1; i < mfact.size(); i++) {
            mfact[i] = mfact[i - 1] * i % mod;
        }
        rfact[sz] = inv(mfact[sz]);
        for(int i = sz - 1; i >= 0; i--) {
            rfact[i] = rfact[i + 1] * (i + 1) % mod;
        }
    }
    
    int64_t fact(int k) const
    {
        return (mfact[k]);
    }
    
    int64_t pow(int64_t x, int64_t n) const
    {
        int64_t ret = 1;
        while(n > 0) {
            if(n & 1) (ret *= x) %= mod;
            (x *= x) %= mod;
            n >>= 1;
        }
        return (ret);
    }
    
    int64_t inv(int64_t x) const
    {
        return (pow(x, mod - 2));
    }
    
    int64_t P(int n, int r) const
    {
        if(r < 0 || n < r) return (0);
        return (mfact[n] * rfact[n - r] % mod);
    }
    
    int64_t C(int p, int q) const
    {
        if(q < 0 || p < q) return (0);
        return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
    }
    
    int64_t H(int n, int r) const
    {
        if(n < 0 || r < 0) return (0);
        return (r == 0 ? 1 : C(n + r - 1, r));
    }
} table(1e6);

int N;
vector<int> divisor;

int find(vector<int> array, int num){
    return int(lower_bound(all(array), num) - array.begin());
}

long dp[1000][1000][30];

long make(int now_divisor, int remaining, int divide_count){
    if(divide_count > N){
        return 0;
    }else if(remaining == 0){
        return 1;
    }else if(now_divisor == divisor.size()){
        return 0;
    }else if(dp[now_divisor][remaining][divide_count] != -1){
        return dp[now_divisor][remaining][divide_count];
    }
    long ans = 0;
    int count = 0, now = divisor[remaining];
    ans += make(now_divisor + 1, remaining, divide_count);
    while(now % divisor[now_divisor] == 0){
        now /= divisor[now_divisor];
        count++;
        ans += table.C(N - divide_count, count) * make(now_divisor + 1, find(divisor, now), divide_count + count);
    }
    return dp[now_divisor][remaining][divide_count] = ans % mod;
}

int main(){
    int M;
    cin >> N >> M;
    for(int i = 1; i * i <= M; i++){
        if(M % i == 0){
            divisor.push_back(i);
            if(i * i != M){
                divisor.push_back(M / i);
            }
        }
    }
    sort(all(divisor));
    memset(dp, -1, sizeof(dp));
    cout << make(1, int(divisor.size()) - 1, 0) << endl;
}


Measured memory_bytes: 250368