#include <iostream>
#include <queue>
#include <vector>
#include <cassert>

using namespace std;

const int MAX_N = 1000005;

vector<int> 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, 0);
    }
    for (int i = 2; i <= n; i++) {
        for (int j = 2; i*j <= n; j++) {
            G[i][id[i]++] = j, G[i*j][id[i*j]++] = i;
        }
    }
    queue<int> q;
    q.push(p);
    visit[p] = true;
    int ans = 1;
    while (not q.empty()) {
        const int s = q.front();
        q.pop();
        for (const int to : G[s]) {
            if (visit[to]) { continue; }
            visit[to] = true;
            q.push(to);
            ans++;
        }
    }
    cout << ans << "\n";
    return 0;
}