#include <bits/stdc++.h>
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define FT(m, n) FOR(k, m, n)

using namespace std;

typedef long long ll;

ll N, M;

ll som(ll P) {
    ll A(sqrt(P)), S(0), L(P), H;
    FT(1, P&&((H=P/k)>A))S+=H;
    FT(1, A+1)H=P/(k+1),S+=k*(L-H),L=H;
    return S;
}

int main() {
    cin >> N >> M;
    cout << som(M) - som(N - 1) << endl;
    return 0;
}