INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  collections import deque

def sieve(n):
    prime = []
    limit = n ** 0.5
    data = [i + 1 for i in range(1,n)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e%p != 0]

def main():
    n, p = map(int,input().split())
    primes = sieve(n + 1)
    G = [[] for _ in range(n + 1)]
    for q in primes:
        for i in range(2 * q,n + 1,q):
            G[q].append(i)
            G[i].append(q)
    
    stack = []
    stack.append(p)
    visited = [0] * (n + 1)
    visited[p] = 1
    while stack:
        p = stack.pop()
        for v in G[p]:
            if visited[v]:
                continue
            else:
                visited[v] = 1
                stack.append(v)
    
    print(sum(visited))

if __name__ == '__main__':
    main()