#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;
}

ll mod=1000000007;
using mint=modint1000000007;
int MAX=1e6;
vector<mint> fac(MAX),inv(MAX),finv(MAX);
void COMinit(){
  fac[0]=fac[1]=1;
  inv[1]=1;
  finv[0]=finv[1]=1;
  rep(i,2,MAX){
    fac[i]=fac[i-1]*i;
    inv[i]=-(mod/i)*inv[mod%i];
    finv[i]=finv[i-1]*inv[i];
  }
  return;
}

mint COM(ll n,ll k){
  if(n<k || n<0 || k<0) return 0;
  return (fac[n]*finv[k])*finv[n-k];
}

void solve(){
  int n,k; cin >> n >> k;
  COMinit();
  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;
  for(auto [p,e]:fac){
    ans*=COM(k+e,e);
  }
  cout << ans.val() << "\n";

  return;
}

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

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