def binomial_coefficient(n, r):
    if r < 0 or r > n:
        return 0
    res = 1
    div = 1
    r = min(r, n - r)
    for i in range(r):
        res = res * (n - i) % mod
        div = div * (i + 1) % mod
    return res * pow(div, mod-2, mod) % mod


def prime_factorization(n):  # 素因数分解
    res = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n //= i
            res.append((i, cnt))
    if n > 1:
        res.append((n, 1))
    return res


comb = binomial_coefficient
mod = 10 ** 9 + 7
N, K = map(int, input().split())
ans = 1

for p, f in prime_factorization(N):
    ans *= comb(K + f, K)
    ans %= mod
print(ans)