def divisor_list(N): #約数のリスト
    if N == 1: return [1]
    res = []
    for i in range(1,N):
        if i*i >= N: break
        if N%i == 0:
            res.append(i)
            res.append(N//i)
    if i*i == N: res.append(i)
    return sorted(res)

n,x = map(int,input().split())
x += 1
lst = divisor_list(x)
L = len(lst)
dp = [[0]*L for _ in range(n+1)]
dp[0][0] = 1
z = {d:di for di,d in enumerate(lst)}
for zd in range(1,L):
    d = lst[zd]
    for i in range(n):
        for j in range(L):
            if dp[i][j] and x%(lst[j]*d)==0:
                dp[i+1][z[lst[j]*d]] += dp[i][j]
print(dp[n][-1])