MOD = 10 ** 9 + 7

def nCk(n, k):
    k = min(k, n - k)
    ret = 1
    for i in range(n, n - k, -1):
        ret *= i
        ret %= MOD
    inv = 1
    for i in range(1, k + 1):
        inv *= i
        inv %= MOD
    ret *= pow(inv, MOD - 2, MOD)
    return ret % MOD

n, k = map(int, input().split())
lst = []
for i in range(2, int(n ** 0.5 + 1)):
    if n % i == 0:
        cnt = 0
        while n % i == 0:
            n //= i
            cnt += 1
        lst.append(cnt)
        
if n != 1:
    lst.append(1)

ans = 1
for l in lst:
    ans *= nCk(k + l, k)
    ans %= MOD
    
print(ans)