from collections import defaultdict

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

def prime_factorization(n):
    arr = defaultdict(int)
    for i in range(2, int(n**0.5)+1):
        while n % i == 0:
            arr[i] += 1
            n //= i
    if n != 1:
        arr[n] += 1
    return arr

def comb(n, r, mod=10**9+7):
    ans = 1
    for i in range(1, r+1):
        ans *= (n-i+1)*pow(i, mod-2, mod)
        ans %= mod
    return ans

arr = prime_factorization(n)
ans = 1
for i, m in arr.items():
    ans *= comb(k+m, m)
    ans %= mod
print(ans)