import collections
mod = 10 ** 9 + 7
N,K = map(int,input().split())

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

c = collections.Counter(prime_factorize(N))

def comb(n, k):
    tmp = 1
    for i in range(k):
        tmp = (tmp * (n - i) * pow(i+1, mod-2, mod)) % mod
    return tmp

nc = len(c)
dp = [0] * len(c)

i = 0
for v in c.values():
    tmp = 0
    for j in range(v+1):
        tmp += comb(K+j-1,j) % mod 
        tmp %= mod
    dp[i] = tmp
    i += 1

ans = 1
for d in dp:
    ans *= d
    ans %= mod
print(ans)