def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

N, M = map(int, input().split())
arr = factorization(M)
res = 1
mod = 10**9+7
calc = {}
for num, cnt in arr:
    if num==1:continue
    if cnt in calc:
        res *= calc[cnt]
        res %= mod
    else:
        dp = [[0]*(cnt+2) for _ in range(N)]
        dp[0][0] = 1
        dp[0][-1] = -1
        for i in range(1,N):
            for j in range(cnt+1):
                dp[i-1][j+1] += dp[i-1][j]
                dp[i-1][j+1] %= mod
            for j in range(cnt+1):
                dp[i][0] += dp[i-1][j]
                dp[i][0] %= mod
                dp[i][cnt-j+1] -= dp[i-1][j]
                dp[i][cnt-j+1] %= mod
        for i in range(cnt+1):
            dp[-1][i+1] += dp[-1][i]
            dp[-1][i+1] %= mod
        calc[cnt] = sum(dp[-1])
        res *= calc[cnt]
        res %= mod

print(res)