#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 a[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++) {
        for (int j = 2*i; j <= n; j += i) {
            G[j].push_back(i);
        }
    }
    int l = 0, r = 0;
    a[r++] = p;
    visit[p] = true;
    int ans = 1;
    while (r-l) {
        const int s = a[l++];
        for(int i = 2*s; i <= n; i += s){
            if (visit[i]) { continue; }
            visit[i] = true;
            a[r++] = i;
            ans++;
        }
        for(const int to : G[s]){
            if (visit[to]) { continue; }
            visit[to] = true;
            a[r++] = to;
            ans++;
        }
    }
    cout << ans << "\n";
    return 0;
}