from collections import defaultdict

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

inv = [1] * 41
for i in range(2, 41):
    inv[i] = mod - inv[mod % i] * (mod // i) % mod

def comb(x, y):
    cnt = 1
    for i in range(y):
        cnt *= (x - i)
        cnt %= mod
        cnt *= inv[i + 1]
        cnt %= mod
    return cnt

nc = n
prime_cnt = defaultdict(int)
while nc % 2 == 0:
    nc //= 2
    prime_cnt[2] += 1
f = 3
while f * f <= n:
    while nc % f == 0:
        nc //= f
        prime_cnt[f] += 1
    f += 2
if nc != 1:
    prime_cnt[nc] += 1

ans = 1
for cnt in prime_cnt.values():
    ans *= comb(k + cnt, cnt)
    ans %= mod
print(ans)