MOD = 10**9+7
N, K = map(int, input().split())
div = [i for i in range(10**5+1)]
for i in range(2, 10**5+1):
    if div[i] != i:
        continue
    for j in range(2, (10**5)//i+1):
        if div[i*j] == i*j:
            div[i*j] = i


def query(n, k):
    if k==0:
        return n
    if n == 2:
        # print(f"{n=} {k=}")
        if k % 2 == 0:
            return pow(2, pow(2, k//2, MOD-1), MOD)
        else:
            return query(3, k-1)
    elif n == 3:
        # print(f"{n=} {k=}")
        if k % 2 == 0:
            return pow(3, pow(2, k//2, MOD-1), MOD)
        else:
            return query(2, k+1)
    else:
        d = {}
        t = n
        while t > 1:
            if div[t] in d:
                d[div[t]] += 1
            else:
                d[div[t]] = 1
            t //= div[t]
        ans = 1
        # print(f"{n=} {k=} {d=}")
        if 2 in d:
            ans *= pow(query(2, k), d[2], MOD)
            ans %= MOD
            d.pop(2)
        # print(f"{n=} {k=} {ans=}")
        if 3 in d:
            ans *= pow(query(3, k), d[3], MOD)
            ans %= MOD
            d.pop(3)
        # print(f"{n=} {k=} {ans=}")
        for i, j in d.items():
            ans *= pow(query(i+1, k-1), j, MOD)
            ans %= MOD
        # print(f"{n=} {k=} {ans=}")
        return ans


print(query(N, K))