#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...);}
template<typename T>
bool is_prime(T n) {
  for (T i=3; i*i<=n; i+=2LL)
    if (n%i==0) return false;
  return true;
}
ll solve() {
	ll n, l; cin >> n >> l;
	ll ans = 0;
	if (n >= l) return 0;
	vll a{2};
	bool flg;
	for (ll i = 3, k = l / (n - 1) + 1; i <= k; i += 2LL) {
		flg = true;
		for (ll j = 3, m = int(sqrt(i)) + 1; j <= m; j += 2LL)
			if (i % j == 0) {
				flg = false;
				break;
			}
		if (flg)
			a.eb(i);
	}
	ll t;
	each(v, a) {
		t = (l + 1) - ((n - 1) * v + 1) + 1;
		if (t > 0)
			ans += t;
	}
	return ans;
}
int main() {
	print(solve());
	return 0;
}