mod=10**9+7
def m(a,b):
  r=[[0]*len(b[0]) for i in range(len(a))]
  for i in range(len(a)):
    for k in range(len(b)):
      for j in range(len(b[0])):
        r[i][j]=(r[i][j]+a[i][k]*b[k][j])%mod
  return r

def p(a,n):
  r=[[0]*len(a) for i in range(len(a))]
  b=[]
  for i in range(len(a)):
    r[i][i]=1
    b.append(a[i][:])
  l=n
  while l>0:
    if l&1:
      r=m(b,r)
    b=m(b,b)
    l>>=1
  return r

N,K=map(int,input().split())
X=[]
for i in range(2,int(N**0.5)+1):
  if N%i==0:
    X.append(0)
    while N%i==0:
      N//=i
      X[-1]+=1
if N>1:
  X.append(1)
ANS=1
for i in range(len(X)):
  x=X[i]
  A=[[0]*(x+1) for j in range(x+1)]
  B=[[0]*(x+1) for j in range(x+1)]
  for j in range(x+1):
    for k in range(j,x+1):
      A[k][j]=1
  B[0][-1]=1
  C=m(p(A,K),B)
  ANS=ANS*sum([C[j][-1] for j in range(x+1)])%mod
print(ANS)