def aa(m):
    c=[]
    while m!=uf[m]:
        c.append(m)
        m=uf[m]
    for i in c:
        uf[i]=m
    return m

n,p=map(int,input().split())
uf=[i for i in range(n+1)]
x=[1]*len(uf)
a=[0]*len(uf)
for i in range(2,n+1):
    if a[i]:
         continue
    for j in range(i,n+1,i):
        a[j]=1
        l,k=aa(i),aa(j)
        if l==k:
            continue
        uf[k]=l
        x[l]+=x[k]
print(x[aa(p)])