MOD = 10 ** 9 + 7

def matpow(A, B, w):
    l = len(A)
    while w:
        if w & 1:
            C = [0] * l
            for i in range(l):
                for j in range(l):
                    C[i] += A[i][j] * B[j]
                    C[i] %= MOD
            B = C
        C = [[0] * l for _ in range(l)]
        for i in range(l):
            for j in range(l):
                for k in range(l):
                    C[i][j] += A[i][k] * A[k][j]
                    C[i][j] %= MOD
        A = C
        w >>= 1
    return B

memo = {}
def f(x):
    if x in memo:
        return memo[x]
    B = [1] * (x + 1)
    A = [[0] * (x + 1) for _ in range(x + 1)]
    for i in range(x + 1):
        for j in range(x + 1):
            if i + j <= x:
                A[j][i] = 1
    C = matpow(A, B, n - 1)
    ret = sum(C) % MOD
    memo[x] = ret
    return ret

n, m = map(int, input().split())
ans = 1
i = 2
while i * i <= m:
    if m % i == 0:
        c = 0
        while m % i == 0:
            m //= i
            c += 1
        ans *= f(c)
        ans %= MOD
    i += 1
if m != 1:
    ans *= f(1)
    ans %= MOD

print(ans)