#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 n, p, ans;

void dfs(int s)
{
    visit[s] = true, ans++;
    for(int i = 2*s; i <= n; i += s){
        if (!visit[i]) {
            dfs(i);
        }
    }
    for(const int to : G[s]){
        if (!visit[to]) {
            dfs(to);
        }
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> p;
    for (int i = 2; i <= n; i++) {
        for (int j = 2*i; j <= n; j += i) {
            G[j].push_back(i);
        }
    }
    dfs(p);
    cout << ans << "\n";
    return 0;
}