#include <bits/stdc++.h>

using namespace std;

vector<int> sieve(int n) {
  vector<bool> is_prime(n, 1);
  vector<int> ret;
  is_prime[0] = is_prime[1] = 0;
  for (int i = 0; i < n; i++) {
    if (is_prime[i]) {
      ret.push_back(i);
      for (int j = 2 * i; j <= n; j += i) {
        is_prime[j] = 0;
      }
    }
  }
  return ret;
}

int main() {
  int n, l; cin >> n >> l;
  auto primes = sieve(l + 1);
  int64_t m = 0;
  for (int i = 0; i < primes.size(); ++i) {
    int64_t cand = l - (int64_t) primes[i] * (n - 1) + 1;
    if (cand > 0) {
      m += cand;
    }
  }
  cout << m << "\n";
}