from functools import lru_cache


def prime_factorization(n):  # 素因数分解
    res = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n //= i
            res.append((i, cnt))
    if n > 1:
        res.append((n, 1))
    return res


@lru_cache(None)
def solve(N, d):
    dp = [1] * (d + 1)
    for _ in range(N-1):
        ndp = [0] * (d + 1)
        add = 0
        for i in range(d + 1):
            add += dp[i]
            add %= mod
            ndp[d - i] += add
            ndp[d - i] %= mod
        dp = ndp
    return sum(dp) % mod


N, M = map(int, input().split())
mod = 10 ** 9 + 7
ans = 1
for p, f in prime_factorization(M):
    ans = ans * solve(N, f) % mod
print(ans)