#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint1000000007;


ll modpow(ll n,ll k,ll mod){
    ll res = 1;
    while(k){
        if(k&1) res = (res*n)%mod;
        n = (n*n)%mod;
        k>>=1;
    }
    return res%mod;
}

mint calc(ll n,ll a,ll k){
    if(k==0) return mint(n).pow(a);
    if(n==2){
        ll can = k >> 1;
        const ll use = 1000000006;
        ll c = modpow(2,can,use);
        c = (c*a) % use;
        if(k&1) return mint(3).pow(c);
        else return mint(2).pow(c);
    }
    ll m = n + 1;
    mint res = 1;
    while(m%2==0){
        res *= calc(2,a,k-1);
        m /= 2; 
    }
    if(m!=1) res *= calc(m,a,k-1);
    return res;
}

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

    ll n,k;
    cin>>n>>k;
    mint ans = 1;
    for(int i = 2;i<=n;i++){
        if(n%i!=0) continue;
        while(n%i==0){
            ans *= calc(i,1,k);
            n /= i;
        }
    }
    cout<<ans.val()<<endl;
}