#include <iostream>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <tuple>
#include <bitset>
#include <map>
#include <queue>
#include <time.h>
#include <utility>
#include <numeric>
#include <deque>
#include <cassert>
#include <sstream>
#include <cctype>
#include <unordered_map>
#include <algorithm>
#include <chrono>
#define ll long long
#include <time.h>
#define mod % 1000000007
#define rep(i,n) for(long long i = 0;i < n;i ++)
ll MAX = 5'000'000'000'000'000'000LL;
using namespace std;

 vector<ll> p;

void MAKE_P(){
  p = {2,3};
  for(int i = 5;i <= 1000000;i ++){
    bool z = true;
    for(ll j:p){
      if(i%j==0){
        z = false;
        break;
      }
      if(j*j>i)break;
    }
    if(z)p.push_back(i);
  }
}

vector<vector<ll>> sub(vector<ll> q){
  vector<vector<ll>> Q;
  ll z = q.size();
  if(z==1){
    rep(i,q[0]+1){
      Q.push_back({i});
    }
    return Q;
  }
  vector<ll> r = q;
  r.pop_back();
  vector<vector<ll>> R = sub(r);
  for(auto a:R){
    rep(i,q[z-1]+1){
      a.push_back(i);
      Q.push_back(a);
      a.pop_back();
    }
  }
  return Q;
}

vector<ll> mul(vector<vector<ll>> A,vector<ll> B,ll n){
  vector<ll> C(n,0);
  rep(i,n){
    rep(j,n){
      C[j] += (A[i][j]*B[i]) mod;
    }
  }
  rep(i,n)C[i] = C[i] mod;
  return C;
}

vector<vector<ll>> mult(vector<vector<ll>> A,ll n){
  vector<vector<ll>> B(n,vector<ll>(n,0));
  rep(i,n){
    rep(j,n){
      rep(k,n){
        B[i][j] += (A[i][k]*A[k][j]) mod;
      }
    }
  }
  rep(i,n){
    rep(j,n){
      B[i][j] = B[i][j] mod;
    }
  }
  return B;
}

int main(){
  ll n,m;
  cin >> n >> m;
  if(m==1){
    cout << 1 << endl;
    return 0;
  }
  MAKE_P();
  vector<ll> q;
  rep(i,int(p.size())){
    if(m%p[i]==0){
      q.push_back(0);
      while(m%p[i] == 0){
        q[int(q.size())-1] ++;
        m = m/p[i];
      }
    }
  }
  if(m>1)q.push_back(1);
  vector<vector<ll>> Q = sub(q);
  map<vector<ll>,ll> mp;
  ll x = Q.size();
  rep(i,x){
    mp[Q[i]] = i;
  }
  vector<vector<ll>> A(x,vector<ll>(x,0));
  rep(i,x){
    auto w = q;
    rep(j,int(q.size())){
      w[j] -= Q[i][j];
    }
    auto a = sub(w);
    for(auto b:a){
      A[i][mp[b]] ++;
    }
  }
  vector<ll> B(x,0);
  B[0] = 1;
  while(n > 0){
    if(n%2==1){
      B = mul(A,B,x);
    }
    A = mult(A,x);
    n = n/2;
  }
  ll ans = 0;
  rep(i,x)ans += B[i];
  cout << ans mod << endl;
  
  return 0;
}