#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll V = 1e6+1;
ll solve(ll n) {
    ll res = 0;
    for(ll i=1;i<V;i++) {
        res += n/i;
    }
    for(ll i=1;i<=V;i++) {
        ll high = n/i, low = n/(i+1)+1;
        low = max(low,V);
        if(high < V)
            continue;
        res += (high-low+1)*i;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    ll n,m;
    cin >> n >> m;
    if(n == 1)
        cout<<solve(m)<<"\n";
    else
        cout<<solve(m)-solve(n-1)<<"\n";
   
}