N,K = map(int,input().split())
mod = 10**9 + 7
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
if N == 1:
  print(1)
  exit()
p = factorization(N)
L = len(p)
ans = 1
def H(n,r):
  tmp = 1
  for i in range(r):
    tmp *= n+r-1-i
    tmp %= mod
    tmp *= pow(r-i,-1,mod)
    tmp %= mod
  return tmp
for i in range(L):
  p_num = p[i][1]
  S_p = 1
  for j in range(1,p_num+1):
    S_p += H(K,j)
    S_p %= mod
  ans *= S_p
  ans %= mod
print(ans%mod)