/* -*- coding: utf-8 -*-
 *
 * 826.cc:  No.826 連絡網 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_P = 1000000;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;

/* global variables */

bool primes[MAX_P + 1], used[MAX_P + 1], cvs[MAX_P + 1];

/* subroutines */

int gen_primes(int maxp, vi &pnums) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

/* main */

int main() {
  vi pnums;
  int pn = gen_primes(MAX_P, pnums);
  //printf("pn=%d\n", pn);

  int n, st;
  scanf("%d%d", &n, &st);

  if (st == 1) {
    puts("1");
    return 0;
  }
  
  qi q;
  for (int i = 0; i < pn && pnums[i] <= st; i++) {
    int &pi = pnums[i];
    if (st % pi == 0)
      q.push(pi), used[i] = true;
  }

  while (! q.empty()) {
    int u = q.front(); q.pop();

    for (int i = 0; i < pn && u * pnums[i] <= n; i++)
      if (! used[i]) {
	q.push(pnums[i]);
	used[i] = true;
      }
  }

  for (int i = 0; i < pn && pnums[i] <= n; i++)
    if (used[i]) {
      int &pi = pnums[i];
      for (int p = pi; p <= n; p += pi) cvs[p] = true;
    }

  int cnt = 0;
  for (int i = 2; i <= n; i++)
    if (cvs[i]) cnt++;
  printf("%d\n", cnt);
  return 0;
}