n,k = map(int,input().split())
mod = 10**9+7

ans = 1

for i in range(2,int(n**0.5)+1):
    if n%i:
        continue
    count = 0
    while n%i == 0:
        n //= i
        count += 1
    base = 1
    for i in range(count):
        ans *= count+k-i
        ans %= mod
        base *= i+1
        base %= mod
    ans *= pow(base,mod-2,mod)
    ans %= mod
if n != 1:
    ans *= k+1
    ans %= mod
print(ans)