#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
long long ans=  0;
long long K;
vector<long long> x;
map<long long,long long> mp;
vector<long long> v,sum;
void dfs(int ind,long long cur){
	if(cur > K)return;
	if(ind == x.size()){
		int d = distance(v.begin(),upper_bound(v.begin(),v.end(),K/cur));
		ans += sum[d-1];
		return;
	}
	else{
		dfs(ind+1,cur);
		dfs(ind+1,cur*x[ind]);
	}
}

int main(){
	int N;
	cin>>N;
	cin>>K;
	vector<int> d = {2,3,5,7,11,13,17,19};
	mp[1]++;
	
	for(int i=1;i<=N;i++){
		int t = i;
		rep(j,d.size()){
			while(t%d[j]==0){
				t /= d[j];
			}
		}
		
		if(t!=1){
			x.push_back(i);
		}
		else{
			map<long long,long long> mp2 = mp;
			for(auto a:mp){
				if(a.first*i>K)break;
				mp2[a.first*i] += a.second;
			}
			swap(mp,mp2);
		}
	}
	
	v.push_back(0);
	sum.push_back(0);
	for(auto a:mp){
		v.push_back(a.first);
		long long t = sum.back();
		sum.push_back(a.second + t);
	}
	
	dfs(0,1);
	ans--;
	cout<<ans<<endl;
	
	return 0;
}