#include <cstdlib>
#include <iostream>
const int MM = 1e7 + 10;
int tab[MM]{};
void fill_tab() {
for (int i = 1; i < MM; i++) {
tab[i] = 0; // Initialize all values to zero
}
for (int i = 1; i < MM; i++) { // i is a potential divisor
for (int j = 2 * i; j < MM; j += i) { // add i to all multiples of i, excluding itself
tab[j] += i;
}
}
}
int calculate_imperfection(const int &n) {
return std::abs(n - tab[n]);
}
int main() {
std::ios_base::sync_with_stdio(0);
fill_tab();
int a, b;
std::cin >> a >> b;
unsigned long long sum = 0;
for (int i = a; i <= b; i++) {
sum += calculate_imperfection(i);
}
std::cout << sum << std::endl;
return 0;
}
