#include<iostream>
#include<vector>

using namespace std;
using ll=long long;

ll pow_mod(ll a, ll n, ll m){
    if (n==0) return 1;
    else if (n%2==1) return (a*pow_mod(a,n-1,m))%m;
    else{
        ll y=pow_mod(a,n>>1,m);
        return (y*y)%m;
    }
}

ll nCr(ll n, ll r, ll m){
    ll a=1, b=1;
    while (r){
        a=(a*(n--))%m; b=(b*(r--))%m;
    }
    return (a*pow_mod(b,m-2,m))%m;
}

ll nHr(ll n, ll r, ll m){return nCr(n+r-1,r,m);}

vector<pair<ll,ll>> Prime_Factorization(ll N) {
    vector<pair<ll,ll>> R;
    ll e=0;

    while (N%2==0){
        e++;
        N/=2;
    }
    R.push_back({2,e});

    e=0;
    while (N%3==0){
        e++;
        N/=3;
    }
    R.push_back({3,e});

    ll p=5,f=0;
    while (p*p<=N) {
        if (N % p==0){
            ll e=0;
            while (N % p == 0){
                e++;
                N/=p;
            }
            R.push_back({p,e});
        }
        p+=2+2*f;
        f^=1;
    }

    if (N != 1) R.push_back({N, 1});
    return R;
}

int main(){
    ll N,K;
    cin >> N >> K;

    ll Mod=1000000007;
    ll X=1;
    for (auto x:Prime_Factorization(N)){
        ll e=x.second;
        X*=nHr(K+1,e,Mod);
        X%=Mod;
    }

    cout << X << endl;
}