#include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k, l;
const int N = 1e7 + 7;
int d[N], o[N];
int p[666666];
int main() {
  int a, b, f;
  cin >> a >> n;
  b = a + n - 1;
  for (i = 1; i <= b; ++i) d[i] = i;
  m = 0;
  o[1] = 1;
  for (i = 2; i <= b; ++i) {
    if (d[i] == i) p[m++] = i;
    f = i / d[i];
    if (o[f] % d[i] == 0)
      o[i] = o[f] / d[i];
    else
      o[i] = o[f] * d[i];
    for (j = 0; j < m && p[j] <= i && i * p[j] <= b; ++j) d[i * p[j]] = p[j];
  }
  long long s = 0;
  for (i = a; i <= b; ++i) s += o[i];
  cout << s << endl;
  return 0;
}
