#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;

vector<bool> primes;
void make_primes(int n)
{
	primes.resize(n + 1, true);
	primes[0] = primes[1] = false;
	REP(i, 2, sqrt(n))
	{
		if (primes[i])
		{
			for (int j = 0; i * (j + 2) < n; j++)
				primes[i * (j + 2)] = false;
		}
	}
}

int main() {
	int N,L;
	cin>>N>>L;
	make_primes(L);
	ll ans=0;
	REP(i,0,L) if(primes[i]){
		int mx=i*(N-1);
		if(L<mx) break;
		ans+=L-mx+1;
	}
	p(ans);
	return 0;
}