#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  return gcd(b, a%b);    
}

int solve(int n, int p) {
  if (p == 1)
    return 1;

  vector<long long> d(n+1);
  for (int i = 1; i <= n; i++) d[i] = i;
  for (int i = 2; i <= n; i++) {
    if (d[i] != i) continue;
    for (int j = i; j <= n; j += i)
      d[j] = min<long long>(d[j], i);
  }

  int ret = 0;
  for (int i = 2; i <= n; i++) {
    if (gcd(i, p) != 1)
      ++ret;
    else {
      bool ck = false;
      ck |= 2 * d[p] <= n && 2 * d[i] <= n;
      ck |= p * d[i] <= n;
      ck |= i * d[p] <= n;
      if (ck)
        ++ret;
    }
  }

  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, p;
  cin >> n >> p;
  cout << solve(n, p) << endl;
  
  return 0;
}