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 class Combinatorics: def __init__(self, n: int) -> None: self.n = n self.fa = [1] * (self.n * 2 + 1) self.fi = [1] * (self.n * 2 + 1) for i in range(1, self.n * 2 + 1): self.fa[i] = self.fa[i - 1] * i % mod self.fi[-1] = pow(self.fa[-1], mod - 2, mod) for i in range(self.n * 2, 0, -1): self.fi[i - 1] = self.fi[i] * i % mod def comb(self, n: int, r: int) -> int: if n < r:return 0 if n < 0 or r < 0:return 0 return self.fa[n] * self.fi[r] % mod * self.fi[n - r] % mod def perm(self, n: int, r: int) -> int: if n < r:return 0 if n < 0 or r < 0:return 0 return self.fa[n] * self.fi[n - r] % mod def combr(self, n: int, r: int) -> int: if n == r == 0:return 1 return self.comb(n + r - 1, r) C = Combinatorics(10 ** 6) n, k = map(int, input().split()) c = Counter(prime_factorize(n)) ans = 1 for _, v in c.items(): ans *= C.comb(k + v, k) ans %= mod print(ans)