#int(input())
#map(int, input().split())
#list(map(int, input().split()))

N, K = map(int, input().split())
mod = 10 ** 9 + 7

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

def f(A):
    p = prime_factorize(A)
    for i in range(len(p)):
        p[i] += 1
    return p

while K:
    u = f(N)
    K -= 1
    N = 1
    for y in u:
        N *= y
    if u[-1] <= 4:
        break


if K != 0:
    p3 = u.count(3)
    p2 = 2 * u.count(4)
    a, b = divmod(K, 2)
    p2 = (p2 * pow(2, a, mod-1)) % (mod-1)
    p3 = (p3 * pow(2, a, mod-1)) % (mod-1)
    if b:
        p2, p3 = 2*p3, p2
    ans = (pow(2, p2, mod) * pow(3, p3, mod)) % mod
else:
    ans = N

print(ans % mod)