import math
def prime(x):
  p = {}
  last = math.floor(x ** 0.5)
  if x % 2 == 0:
    cnt = 1
    x //= 2
    while x & 1 == 0:
      x //= 2
      cnt += 1
    p[2] = cnt
  for i in range(3, last + 1, 2):
    if x % i == 0:
      x //= i
      cnt = 1
      while x % i == 0:
        cnt += 1
        x //= i
      p[i] = cnt
  if x != 1:
    p[x] = 1
  return p

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

DP = [0] * N
L = [0] * N

P = []

def nasu(n, k):
  p = prime(n)
  ans = 1
  for key, val in p.items():
    if k == 1:
      ans = ans * pow(key + 1, val) % MOD
    else:
      if key == 2:
        d, m = divmod(k, 2)
        if m:
          t = pow(3, pow(2, d, MOD) * val % MOD, MOD)
        else:
          t = pow(2, pow(2, d, MOD) * val % MOD, MOD)
        ans = ans * t % MOD
      else:
        ans = ans * pow(nasu(key + 1, k - 1), val) % MOD
  return ans

print(nasu(N, K))