N,P = map(int, input().split())

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a%b == 0:
        return b
    return gcd(b, a%b)

ans = 1
if P > 1:
    n = 2
    num = P
    while n <= P**0.5:
        if P%n == 0:
            num = n
            break
        n += 1

    for i in range(2, P):
        if i*num <= N:
            ans += 1
    for i in range(P+1, N+1):
        if gcd(P, i) > 1:
            ans += 1
print(ans)