def make_divisors(n):
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            yield i
            if i != n // i:
                yield n // i


N, X = map(int, input().split())
div = sorted(make_divisors(X + 1))
st = set(div)
dp = [{d: 0 for d in div} for _ in range(N + 1)]
dp[0][1] = 1
for d in div:
    if d == 1:
        continue
    for v in div:
        if d * v in st:
            for i in range(N):
                dp[i + 1][d * v] += dp[i][v]
print(dp[N][X + 1])