#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long inv(long long i) {
  if (i == 1) return 1;
  return (mod - ((mod / i) * inv(mod % i)) % mod) % mod;
}
long long mod_mul(long long a, long long b, long long m) {
  a = a % m;
  b = b % m;
  return (((a * b) % m) + m) % m;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long ceil_div(long long a, long long b) {
  return a % b == 0 ? a / b : a / b + 1;
}
long long pwr(long long a, long long b) {
  a %= mod;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t, n, i, j, ans, temp, sum, a, curr;
  string sans;
  t = 1;
  while (t--) {
    sans = "NO";
    ans = temp = sum = 0;
    cin >> a >> n;
    vector<bool> perfectsq(10000001, false);
    for (i = 1; i <= 10000000; i++) {
      if (i * i <= 10000000) {
        perfectsq[i * i] = 1;
      }
    }
    vector<long long> fac(10000000, 1);
    for (i = 1; i <= 10000000; i++) {
      if (perfectsq[i]) {
        for (j = i; j <= 10000000; j += i) {
          fac[j] = i;
        }
      }
    }
    for (i = 0; i <= n - 1; i++) {
      ans += (a + i) / (fac[a + i]);
    }
    cout << ans;
  }
  return 0;
}
