#include <bits/stdc++.h>
using namespace std;
const int N = 10000100;
bool judge[N];
int rec[N];
int stk[N];
int cnt;
int main() {
  int a, n;
  long long ans = 0;
  long long i, j;
  for (i = 1; i * i < N; i++) {
    judge[i * i] = 1;
    stk[cnt++] = i * i;
  }
  for (i = 1; i < N; i++) rec[i] = i;
  for (i = 0; i < cnt; i++) {
    for (j = 1; stk[i] * j < N; j++)
      rec[stk[i] * j] = min(rec[stk[i] * j], int(j));
  }
  scanf("%d%d", &a, &n);
  for (i = a; i < a + n; i++) ans += rec[i];
  cout << ans << endl;
}
