#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline T gcd(T a, T b) {
  return __gcd(a, b);
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
long long modpow(long long a, long long n, long long temp) {
  long long res = 1, y = a;
  while (n > 0) {
    if (n & 1) res = (res * y) % temp;
    y = (y * y) % temp;
    n /= 2;
  }
  return res % temp;
}
long long ison(long long mask, long long pos) { return (mask & (1 << pos)); }
long long cbit(long long n) {
  long long k = 0;
  while (n) n &= (n - 1), k++;
  return k;
}
long long nbit(long long n) {
  long long k = 0;
  while (n) n /= 2, k++;
  return k;
}
long long mod = 1e9 + 7;
int sgn(long long x) { return x < 0 ? -1 : !!x; }
const double eps = 1e-7;
const double pi = acos(-1.0);
inline void inc(long long &x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
}
inline void dec(long long &x, long long y) {
  x -= y;
  if (x < 0) x += mod;
}
inline void chmax(long long &x, long long y) {
  if (y > x) x = y;
}
inline void mulm(long long &x, long long y) {
  x *= y;
  if (x >= mod) x -= mod;
}
long long xo(long long i) {
  if ((i & 3) == 0) return i;
  if ((i & 3) == 1) return 1;
  if ((i & 3) == 2) return i + 1;
  return 0;
}
long long ans[10000005];
long long pri[10000005];
void sieve(long long n) {
  pri[1] = 1;
  pri[0] = 1;
  for (long long i = 2; i <= n; i++) {
    if (pri[i] == 0) {
      for (long long j = i; j <= n; j += i) pri[j] = i;
    }
  }
}
int main() {
  long long a, n, i, b, m, r, j;
  cin >> a >> n;
  sieve(n + a - 1);
  ans[1] = 1;
  long long res = 0;
  for (i = 1; i <= n + a - 1; i++) {
    long long c = 0, k = pri[i], j = i;
    if (i > 1) {
      while (j % k == 0) j /= k, c++;
      if (c % 2)
        ans[i] = (ans[j] * k);
      else
        ans[i] = ans[j];
    }
    if (i >= a) res += ans[i];
  }
  cout << res;
}
