#include <bits/stdc++.h>
using namespace std;
int p, a, n;
int v[4096];
int mark[10000100];
long long int sum;
int calc(int y) {
  for (int i = p - 1; i >= 0; i--)
    if (y % v[i] == 0) return y / v[i];
  return 0;
}
int main() {
  p = 0;
  for (int i = 1; i * i < 10000100; i++) v[p++] = i * i;
  memset(mark, 0, sizeof(mark));
  for (int i = 1; i < p; i++)
    for (int j = v[i]; j < 10000100; j += v[i]) mark[j] = v[i];
  scanf("%d %d", &a, &n);
  sum = 0ll;
  for (int y = a; y <= a + n - 1; y++)
    sum += (long long int)(mark[y] == 0 ? y : y / mark[y]);
  cout << sum << '\n';
  return 0;
}
