#include <bits/stdc++.h>
using namespace std;
template <typename X>
ostream& operator<<(ostream& x, const vector<X>& v) {
  for (long long i = 0; i < v.size(); ++i) x << v[i] << " ";
  return x;
}
template <typename X>
ostream& operator<<(ostream& x, const set<X>& v) {
  for (auto it : v) x << it << " ";
  return x;
}
template <typename X, typename Y>
ostream& operator<<(ostream& x, const pair<X, Y>& v) {
  x << v.ff << " " << v.ss;
  return x;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v) {
  for (auto it : v) os << it.first << "=>" << it.second << endl;
  return os;
}
struct pair_hash {
  inline std::size_t operator()(
      const std::pair<long long, long long>& v) const {
    return v.first * 31 + v.second;
  }
};
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const int N = 10 * 1000005;
;
long long f[N];
int main() {
  vector<long long> sq;
  int i = 1;
  while (1) {
    sq.push_back(i * i);
    i++;
    if ((i * i) > 1e7) {
      break;
    }
  }
  for (long long i = 0; i < sq.size(); i++) {
    for (int j = sq[i]; j < N; j += sq[i]) {
      f[j] = sq[i];
    }
  }
  long long a, n;
  cin >> a >> n;
  long long ans = 0;
  for (long long i = a; i < a + n; i++) {
    ans += (long long)(i / f[i]);
  }
  cout << ans << endl;
}
