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

using namespace std;

const int MAX_N = 1000005;
const int M = 10;

vector<int> G[MAX_N];
bool visit[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, p;
    cin >> n >> p;
    vector<int> a;
    for(int i = 2; i <= M; i++) a.push_back(i);
    for (int i = 2; i <= n; i++) {
        if(i <= M) continue;
        for (int j = 2*i; j <= n; j += i) {
            G[j].push_back(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(int i = 2*s; i <= n; i += s){
            if (visit[i]) { continue; }
            visit[i] = true;
            q.push(i);
            ans++;
        }
        for(const int to : a){
            if(s % to == 0 && !visit[to]){
                visit[to] = true;
                q.push(to);
                ans++;
            }
        }
        for(const int to : G[s]){
            if (visit[to]) { continue; }
            visit[to] = true;
            q.push(to);
            ans++;
        }
    }
    cout << ans << "\n";
    return 0;
}