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])

    return arr

N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = 1
for _, n in factorization(N):
    for i in range(n):
        ans *= K + n - i
        ans *= pow(i + 1, mod - 2, mod)
        ans %= mod
print(ans)