def divisors(N):
    ret = []
    d = 1
    while d * d <= N:
        if N % d == 0:
            ret.append(d)
            if(d * d != N): ret.append(N / d)
        d += 1
    ret.sort()
    return ret

N, X = map(int, input().split())
D = divisors(X + 1)
M = {}

for i, d in enumerate(D):
    M[d] = i

dp = [[[-1 for i in range(32)] for j in range(len(D))] for j in range(len(D))]

def dec(n, m, k):
    if k >= 32: return 0
    if dp[n][m][k] >= 0: return dp[n][m][k]
    if k == 0:
        if D[n] == 1:
            dp[n][m][k] = 1
            return 1
        else:
            dp[n][m][k] = 0
            return 0
    if k == 1:
        if n >= m:
            dp[n][m][k] = 1
            return 1
        else:
            dp[n][m][k] = 0
            return 0
    ret = 0
    p = m
    while D[p] * D[p] <= D[n]:
        if D[n] % D[p] == 0:
            a = D[n]
            cnt = 1
            while a % D[p] == 0 and k >= cnt:
                a /= D[p]
                ret += dec(M[a], p + 1, k - cnt)
                cnt += 1
        p += 1
    dp[n][m][k] = ret
    return ret

print(dec(len(D) - 1, 1, N))