#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define per(i, a, n) for (int i = (n) - 1; i >= (a); i--)
#define FOR(i, n) rep(i, a, (n))

ll f(ll x){
    if(x==0) return 0;
    ll res=0;
    ll i;
    for(i=1;i<=1000000;i++){
        if(i*i>x) break;
        res++;
        res+=(2*((x-i*i)/i));
    }
    return res;
}
int main(void)
{
    ll N,M;
	scanf("%lld %lld",&N, &M);
	printf("%lld\n", f(M)-f(N-1));
	return 0;
}