#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <iomanip>
using namespace std;
template<typename T> void setmin(T& a, T& b) { a = min(a, b); }
template<typename T> void setmax(T& a, T& b) { a = max(a, b); }

typedef long long ll;

vector<ll> sieve(ll n) {
	vector<ll> ps;
	vector<bool> is_prime(n + 1, true);

	is_prime[0] = is_prime[1] = false;
	for(ll i = 2; i <= n; i++) {
		if(is_prime[i]) {
			ps.push_back(i);
			for(ll j = 2 * i; j <= n; j += i) {
				is_prime[j] = false;
			}
		}
	}
	return ps;
}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll N, L;
	cin >> N >> L;

	vector<ll> ps = sieve(L);

	ll ans = 0;
	for(int p : ps) {
		ll rem = L - (N + (N - 1) * (p - 1) - 1);
		if(rem >= 0) {
			ans += rem + 1;
		}
	}
	cout << ans << endl;
}