#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <random>
#include <vector>
#include <algorithm>
#include <array>
#include <functional>
#include <utility>
#include <regex>
#include <tuple>
#include <map>

using namespace std;

int main(){
	int n,l;
	int64_t cnt=0;
	-scanf("%d%d",&n,&l);
	vector<int> prime;
	prime.push_back(2);
	for(int i=3;i<l;i+=2){
		if(all_of(prime.begin(),prime.end(),[i](int p){return i%p;})){
			prime.push_back(i);
		}
	}
	for(int p=0;(n-1)*prime[p]<=l;p++){
		cnt+=l-(n-1)*prime[p]+1;
	}
	printf("%ld\n",cnt);
	return 0;
}