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

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

//const ll mod = 998'244'353;
const ll mod = 1'000'000'006;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

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

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

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

    ll n,k;
    cin>>n>>k;
    modint 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;
}