MOD = 10**9+7
from collections import Counter
N, M = map(int, input().split())

def prime_factorize(n): # O(√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

cnt = Counter(prime_factorize(M))
ans = 1
for k, v in cnt.items():
    dp = [[0] * (v + 1) for _ in range(N + 1)]
    dp[0][0] = 1
    for i in range(N):
        for j in range(v + 1):
            # dp[i][j] から配る
            memo = dp[i][j]
            for k in range(v + 1):
                # となりに k を置く
                if j + k > v:
                    break
                dp[i + 1][k] += memo
                dp[i + 1][k] %= MOD
    sub = sum(dp[-1]) % MOD
    ans *= sub
    ans %= MOD

print(ans)