#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10000010;
int start, len;
long long solution;
int rest[MAX_N];
char is_prime[MAX_N];
int main() {
  cin >> start >> len;
  for (int i = 2; i < start + len; ++i) {
    rest[i] = 1;
    is_prime[i] = 1;
  }
  rest[1] = 1;
  for (int i = 2; i < start + len; ++i) {
    if (is_prime[i]) {
      for (int j = i; j < start + len; j += i) {
        is_prime[j] = 0;
        int flag = 0;
        int number = j;
        while (number % i == 0) {
          flag ^= 1;
          number /= i;
        }
        if (flag) {
          rest[j] *= i;
        }
      }
    }
  }
  for (int i = start; i < start + len; ++i) {
    solution += rest[i];
  }
  cout << solution << endl;
  return 0;
}
