#include<bits/stdc++.h>
#define int long long
using namespace std;
bool vis[10000005];
vector<int> prime;
int n,m;
signed main(){
	cin>>n>>m;
	vis[0]=vis[1]=1;
	for(int i=2;i<=m;i++){
		if(!vis[i]){
			prime.push_back(i);
		}
		for(int j=0;j<prime.size() && prime[j]*i<=m;j++){
			vis[prime[j]*i]=1;
			if(i%prime[j]==0){
				break;
			}
		}
	}
	int ans=0;
	for(int i=0;i<prime.size();i++){
		int r=m-prime[i]*(n-1);
		if(r<0){
			break;
		}
		ans+=r+1;
	}
	cout<<ans<<endl;
	return 0;
}