def prime_factorize(N): #素因数分解
    exponent = 0
    while N%2 == 0:
        exponent += 1
        N //= 2
    if exponent: factorization = [[2,exponent]]
    else: factorization = []
    i=1
    while i*i <=N:
        i += 2
        if N%i: continue
        exponent = 0
        while N%i == 0:
            exponent += 1
            N //= i
        factorization.append([i,exponent])
    if N!= 1: factorization.append([N,1])
    assert N != 0, "zero"
    return factorization

n,k = map(int,input().split())
primes = prime_factorize(n)
ans = 1
MOD = 10**9+7
for _,e in primes:
    r = s = 1
    for i in range(1,e+1):
        r = r*(k+i)%MOD
        s = s*i%MOD
    r *= pow(s,MOD-2,MOD)
    ans = ans*r%MOD
print(ans)