from sqlalchemy import union class UnionFind: def __init__(self, n): self.par = [i for i in range(n+1)] self.rank = [0] * (n+1) self.size = [1 for _ in range(n+1)] # 検索 def find(self, x): if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] # 併合 def union(self, x, y): x = self.find(x) y = self.find(y) if self.rank[x] < self.rank[y]: self.par[x] = y self.size[y] += self.size[x] else: self.par[y] = x self.size[x] += self.size[y] if self.rank[x] == self.rank[y]: self.rank[x] += 1 # 同じ集合に属するか判定 def same_check(self, x, y): return self.find(x) == self.find(y) n,p = map(int,input().split()) ki = UnionFind(n+1) for i in range(2,n): tmp = 2 while tmp*i <= n: ki.union(i,tmp*i) tmp += 1 #print(i,tmp*i) ans = 0 idx = ki.par[p] for i in range(n): if ki.par[i+1] == idx: ans += 1 print(ans)