from heapq import heappush, heappop

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i == 0:
            cnt = 0
            while temp%i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])
    if temp != 1:
        arr.append([temp, 1])
    if arr == []:
        arr.append([n, 1])
    return arr

def matrix(a, b):
    ans = [[0]*len(b[0]) for _ in range(len(a))]
    for i in range(len(a)):
        for j in range(len(b[0])):
            ans[i][j] = sum(a[i][k]*b[k][j]%MOD for k in range(len(b)))%MOD
    return ans

N, K = map(int, input().split())

MOD = 10**9+7

que = []
S = set()
for n, c in factorization(N):
    heappush(que, -n)
    S.add(n)

while que:
    a = -heappop(que)
    for n, c in factorization(a+1):
        if n not in S:
            heappush(que, -n)
            S.add(n)
S = sorted(S)
D = dict()
for i, s in enumerate(S):
    D[s] = i

dp = [[[0]*len(D) for _ in range(len(D))]]
for i, s in enumerate(S):
    n = s+1
    for j, s2 in enumerate(S):
        cnt = 0
        while n%s2 == 0:
            n //= s2
            cnt += 1
        dp[0][j][i] = cnt

for _ in range(59):
    dp.append(matrix(dp[-1], dp[-1]))

A = [[0] for _ in range(len(D))]
for n, c in factorization(N):
    A[D[n]][0] = c

for i in range(60):
    if 1<<i & K:
        A = matrix(dp[i], A)

ans = 1
for i in range(len(D)):
    ans *= pow(S[i], A[i][0], MOD)
    ans %= MOD

print(ans)