#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;i++)
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using si =vector<char>;
using ssi =vector<si>;
//using mint = modint998244353;
const long long INF = 1e18;
//bit全探索 rep(i,0,1<<(n-1)){rep(j,0,n-1)if(I&(1<<j))}
//int a = s[0] - ‘0’;文字列から数字
//int a=atoi(s.c_str());
//“ABCDEFGHIJKLMNOPQRSTUVWXYZ"
//#define INF (long long)2e+18

//printf("%.9f\n", ans);
int main() { 
 int n,p;
 cin>>n>>p;
 vvi vec(n+1);
 rep(i,2,n+1){
 	for(int j=2;j*j<=i;j++){
 		if(j*j==i){vec[i].push_back(j);vec[j].push_back(i);}
 		else if(i/j==0){vec[i].push_back(j);vec[i].push_back(i/j);vec[j].push_back(i);vec[i/j].push_back(i);}
 	}
 }
 int cnt=1;
 vector<bool>seen(n+1);
 queue<int>que;
 que.push(p);

 while(!que.empty()){
 	int a=que.front(); 
 	seen[a]=true;
 	que.pop();
 	for(auto m:vec[a]){
 		if(seen[m])continue;
 		
 		else cnt++;
 		que.push(m);
 	}
 }
 cout<<cnt;
}