#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
#define ce(x, y) (x + y - 1) / y
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
bool sieve[int(1e7)];
vi AtkinSieve(int limit) {
	vi results;
	int factor = int(sqrt(limit)) + 1;
	int n;
	rep(i, 1, factor) {
		rep(j, 1, factor) {
			n = 4*(i * i) + (j * j);
			if ((n <= limit) && (n % 12 == 1 || n % 12 == 5))
				sieve[n] ^= true;
			n = 3 * (i * i) + (j * j);
			if ((n <= limit) && (n % 12 == 7))
				sieve[n] ^= true;
			if (i > j) {
				n = 3 * (i * i) - (j * j);
				if ((n <= limit) && (n % 12 == 11))
					sieve[n] ^= true;
			}
		}
	}
	rep(index, 5, factor)
		if (sieve[index])
			for (int jndex = index * index; jndex < limit; jndex += index * index)
				sieve[jndex] = false;
	for(int i: {2, 3, 5})
		if (i < limit) {
			sieve[i] = true;
			results.eb(i);
		}
	for (int index = 7; index < limit; index += 2)
		if (sieve[index])
			results.eb(index);
	return results;
}
ll solve() {
	ll n, l; cin >> n >> l;
	if (n * 2 - 1 > l) {
		return 0;
	}
	int limit = int(l / (n - 1) + 1);
	vi ret = AtkinSieve(limit);
	ll ans = 0;
	ans += l - 2 * (n - 1) + 1;
	for (int index = 3; index < limit; index += 2)
		if (sieve[index])
			ans += l - index * (n - 1) + 1;
	return ans;
}
int main() {
	print(solve());
	return 0;
}