from collections import Counter


def prime_factorize(n: int) -> list:
    res = []

    while n % 2 == 0:
        res.append(2)
        n //= 2

    f = 3

    while f ** 2 <= n:
        if n % f == 0:
            res.append(f)
            n //= f
        else:
            f += 2

    if n != 1:
        res.append(n)

    return res

mod = 10 ** 9 + 7

def comb(n, k):
    res = 1
    for i in range(k):
        res *= n - i
        res //= i + 1
    return res % mod
n, k = map(int, input().split())
c = Counter(prime_factorize(n))
ans = 1
for _, v in c.items():
    ans *= comb(k + v, v)
    ans %= mod
print(ans)