import collections

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


N,M = map(int, input().split())
ans = 1
mod = 10**9+7
CA = collections.Counter(prime_factorize(M))
CACA = collections.Counter()
for k,v in CA.items():
    CACA[v]+=1
for k,v in CACA.items():
    DP = [1]*(k+1)
    for i in range(N-1):
        ACDP = list(DP)
        for j in range(1,k+1):
            ACDP[j]=(ACDP[j]+ACDP[j-1])%mod
        DP = ACDP[::-1]

    ans = pow(sum(DP),v,mod)*ans%mod

print(ans%mod)