import collections
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a


N,K = map(int,input().split())
P = prime_factorize(N)
C = collections.Counter(P)
mod = 10**9+7
for _ in range(min(30,K)):
    NC = collections.Counter()
    for k,v in C.items():
        for p in prime_factorize(k+1):
            NC[p]+=v
    C = NC
K = K-min(K,30)
if K==0:
    ans = 1
    for k,v in C.items():
        ans=ans*pow(k,v,mod)%mod
    print(ans)
else:
    if K%2==1:
        NC = collections.Counter()
        for k,v in C.items():
            for p in prime_factorize(k+1):
                NC[p]+=v
        C = NC
    K2=K//2
    print(pow(2,C[2]*pow(2,K2,mod-1),mod)*pow(3,C[3]*pow(2,K2,mod-1),mod)%mod)