#include <iostream>
#include <queue>
#include <vector>
#include <cassert>
int main()
{
    int N, P;
    std::cin >> N >> P;
    assert(1 <= N and N <= 1000000);
    assert(1 <= P and P <= N);
    std::vector<std::vector<int>> G(N + 1);
    for (int i = 2; i <= N; i++) {
        for (int j = 2; i * j <= N; j++) {
            G[i].push_back(i * j);
            G[i * j].push_back(i);
        }
    }
    std::vector<bool> visited(N + 1, false);
    std::queue<int> Q;
    Q.push(P);
    visited[P] = true;
    int ans = 1;
    while (not Q.empty()) {
        const int s = Q.front();
        Q.pop();
        for (const int to : G[s]) {
            if (visited[to]) { continue; }
            visited[to] = true;
            Q.push(to);
            ans++;
        }
    }
    std::cout << ans << std::endl;
    return 0;
}