#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
const int MAX = 10000000;
int n;
int m;
int f[MAX + 1];
long long res[MAX + 1];
int main() {
  for (int i = 2; i <= MAX; i++)
    if (!f[i]) {
      f[i] = i;
      if (i <= MAX / i)
        for (int j = i * i; j <= MAX; j += i) f[j] = i;
    }
  res[1] = 1;
  for (int i = 2; i <= MAX; i++)
    if (f[i] <= i / f[i] && i % (f[i] * f[i]) == 0)
      res[i] = res[i / (f[i] * f[i])];
    else
      res[i] = f[i] * res[i / f[i]];
  scanf("%d%d", &n, &m);
  long long ans = 0;
  for (int i = n; i < n + m; i++) ans += res[i];
  cout << ans << endl;
  return 0;
}
