#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,P;

int gcd(int a, int b) {
    if(a < b) swap(a,b);
    int r;
    while ((r=a%b)) {
        a = b;
        b = r;
    }
    return b;
}

void solve() {
    cin>>N>>P;
    
    if(P==1) {
        cout << N << endl;
        return;
    }
    
    vector<int> primes, s;
    primes.push_back(2);
    if (P%2==0) s.push_back(2);
    FOR(i,3,1e3+1) {
        for (auto p:primes) if (i%p==0) continue;
        primes.push_back(i);
        if (P%i==0) s.push_back(i);
    }
    
    int ans = 0;
    FOR(i,2,N+1) {
        for (auto t:s) {
            if (t*i/(gcd(t, i)) <= N) {
                ans++;
                break;
            }
        }
    }
    
    cout << ans << endl;
}