def prime_factorize(n):
    a = set()
    while n % 2 == 0:
        a.add(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.add(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.add(n)
    return a

N, P = map(int,input().split())
if P == 1:
    print(N)
    exit()

X = [0] * (N + 1)
Q = prime_factorize(P)
Q2 = {1}
while Q:
    x = Q.pop()
    X[x] = 1
    if x not in Q2:
        for i in range(1,N//x + 1):
            X[x * i] = 1
            if i not in Q2:
                Q.add(i)
    Q2.add(x)
print(sum(X))