#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;} return false;}
template <typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;} return false;}

vector<int> make_prime(int N){
  vector<bool> isprime(N+1,true);
  vector<int> res; 
  rep(p,2,N+1){
    if(!isprime[p]) continue;
    res.push_back(p);
    for(int q=2*p;q<=N;q+=p){
      isprime[q]=false;
    }
  }

  return res;
}


void solve(){
  using mint=modint1000000007;
  int n,k; cin >> n >> k;
  vector<int> prime=make_prime(1e6+100);
  vector<pair<int,int>> fac;
  for(auto p:prime){
    int cnt=0;
    while(n%p == 0){
      cnt++;
      n/=p;
    }
    if(cnt) fac.push_back({p,cnt});
  }
  if(n>1) fac.push_back({n,1});
  mint ans=1;
  // COM[i]=COM(k+i,i)
  vector<mint> COM(60);
  COM[0]=1;
  rep(i,1,60) COM[i]=COM[i-1]*(k+i)/(mint)i;
  for(auto [p,e]:fac){    
    ans*=COM[e];
  }
  cout << ans.val() << "\n";

  return;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int T=1;
  // cin >> T;
  while(T--) solve();
}