#include using namespace std; #define rep(i,a,b) for(int i=a;i primes; void make_primes(int n) { primes.resize(n + 1, true); primes[0] = primes[1] = false; rep(i, 2, sqrt(n)) { if (primes[i]) { for (int j = 0; i * (j + 2) < n; j++) primes[i * (j + 2)] = false; } } } //----------------------------------------------------------------- typedef long long ll; int N, L; //----------------------------------------------------------------- int main() { cin >> N >> L; make_primes(L); ll ans = 0; rep(i, 0, L) if(primes[i]) { int _max = i * (N - 1); if (L < _max) break; ans += L - _max + 1; } cout << ans << endl; }