#include #include #include #include using namespace std; const int MAX_N = 1000005; vector G[MAX_N]; bool visit[MAX_N]; int id[MAX_N]; int main() { cin.tie(0); ios::sync_with_stdio(false); int n, p; cin >> n >> p; for(int i = 2; i <= n; i++){ G[i].assign(n / i + 20, 0); } for (int i = 2; i <= n; i++) { for (int j = 2*i; j <= n; j += i) { G[i][id[i]++] = j, G[j][id[j]++] = i; } } queue q; q.push(p); visit[p] = true; int ans = 1; while (not q.empty()) { const int s = q.front(); q.pop(); for(int i = 0; i < id[s]; i++){ int& to = G[s][i]; if (visit[to]) { continue; } visit[to] = true; q.push(to); ans++; } } cout << ans << "\n"; return 0; }