#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

int main(){
    ll n, m;
    cin >> n >> m;

    vector<ll> div;
    for(ll i=1; i*i<=m; i++){
        if(m%i != 0) continue;
        if(i == m/i){
            div.pb(i);
        }else{
            div.pb(i);
            div.pb(m/i);
        }
    }

    vector<vector<ll>> cnt(n, vector<ll>((ll)div.size(), 0));
    rep(i, (ll)div.size()) cnt[0][i] = 1;
    vector<vector<ll>> P((ll)div.size());
    rep(i, (ll)div.size()){
        rep(j, (ll)div.size()){
            if(m%(div[i]*div[j]) == 0){
                P[i].pb(j);
            }
        }
    }

    for(ll i=1; i<n; i++){
        rep(j, (ll)div.size()){
            
        }
    }

    ll ans = 0;
    rep(i, (ll)div.size()){
        ans += cnt[n-1][i];
        ans %= MOD;
    }

    cout << ans << endl;
}