import collections
MOD = 10 ** 9 + 7

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def n_fact(N):
    c = collections.Counter(prime_factorize(N))
    return c

N, M = map(int, input().split())
X = n_fact(M)
x2 = collections.Counter(X.values())

ans = 1
for k, v in x2.items():
    dp = [1] * (k + 1)
    for i in range(N-1):
        dp2 = [0] * (k+1)
        sump = 0
        for j in range(k+1):
            sump += dp[j]
            dp2[k-j] = sump
        dp = dp2
    ans *= pow(sum(dp),v,MOD)
    ans %= MOD

print(ans)