#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define rep(i, n) for (int i = 0; i < (n); i++)
ll num(int r) {

    ll left=0, right=0;
    int k = floor(sqrt(r));
    for (int i=1; i<=k; i++) {
        left+=r/i;
    }
    for(int i=1; i<=k; i++) {
        int curr = r/i-r/(i+1);
        //cout<<curr<<" ";
        right+=i*curr;
    }
    if (r < k*k+k) left -= k;
    //cout<<"left: "<<left<<"  "<<"right:"<<right<<endl;
    return left+right;
}

ll num2(int r) {
    ll ans = 0;
    for (int i = 1; i <= r; i++) for (int j = 1; j <= i; j++) if (i%j == 0) ans++;
    return ans;
}

int main(void){
    //for (int i = 1; i < 100000; i++) if(num(i) != num2(i)) cout << i << ' ' << num(i) << ' ' << num2(i) << endl;

	ll n, m; cin >> n >> m;
    cout<<num(m) - num(n-1)<<endl;

}