N,K=map(int,input().split()) ans=1 mod=10**9+7 if N==1: print(1) exit() 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 M=K+100 fact=[1 for _ in range(M+1)] factinv=[1 for _ in range(M+1)] a=1 b=1 p=10**9+7 for i in range(M): a*=(i+1) a%=p b*=pow(i+1,p-2,p) b%=p fact[i+1],factinv[i+1]=a,b def comb(n,k,p): return fact[n]*(factinv[k]*factinv[n-k])%p L=factorization(N) for l in L: a=l[1] s=0 for i in range(a+1): s+=comb(i+K-1,K-1,mod) ans*=s ans%=mod print(ans)