def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr
ans = set()
INF = 10**9
def addNum(n,cnt):
    if cnt == len(l):
        return
    for i in range(l[cnt][1]+INF):
        num = n*l[cnt][0]**i
        if num > N:
            break
        ans.add(num)
        addNum(num,cnt+1)

N,P = map(int,input().split())
P_fac = factorization(P)
flg = False
r = 1
for i in range(N,0,-1):
    if flg:
        break
    for j,k in P_fac:
        if i%j == 0:
            r = i
            flg = True
            break
l = factorization(r)
addNum(1,0)
print(len(ans)-1)