#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cmath>

using namespace std;

template <class T>
vector<bool> getIsPrime(T n) {
	vector<bool> p(n + 1, true);
	p[0] = p[1] = false;

	T limit = sqrt(n);
	for (T i = 4; i <= n; i += 2) {
		p[i] = false;
	}
	for (T i = 3; i <= limit; i += 2) {
		if (p[i]) {
			for (T j = i * i; j <= n; j += i) {
				p[j] = false;
			}
		}
	}

	return p;
}

template <class T>
vector<T> getPrimes(T n) {
	auto isPrime = getIsPrime(n);
	vector<T> primes((n + 1) / 2, 0);
	auto it = primes.begin();
	for (T i = 2; i <= n; i++) {
		if (isPrime[i]) {
			*it = i;
			it++;
		}
	}
	primes.erase(it, primes.end());
	return primes;
}

int main() {
	long long n, l;

	cin >> n >> l;
	vector<long long> primes = getPrimes(l);


	long long ans = 0;
	for (auto p : primes) {
		long long total_len = p * (n - 1);
		if (total_len > l) {
			break;
		}
		ans += l - total_len + 1;
	}

	cout << ans << endl;
	return 0;
}