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

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int inf=0x3f3f3f3f;

#define FOR(i,b,e) for(int i=b; i<=e; i++)
#define FORD(i,b,e) for(int i=b; i>=e; i++)
#define SIZE(x) ((int)x.size())
#define pb push_back
#define st first
#define nd second
#define sp ' '
#define ent '\n'

const int N=1e6+5;

ll ans;

ll ile(ll v, ll l, ll r){
	ll pier, ost;
	pier=l-l%v;
	if(pier<l) pier+=v;
	ost=r-r%v;
	if(ost<pier) return 0;
	return (ost-pier)/v+1;
}

ll kwd(ll v, ll l, ll r){
	return (l<=v*v && v*v<=r);
}

ll licz(ll l, ll r, ll fl){
	if(l>r) return 0;
	ll lans=0;
	FOR(i, 1, N) lans+=ile(i, l, r)*(fl+1);
	if(fl>0) FOR(i, 1, N) lans-=kwd(i, l, r);
	return lans;
}

void solve(){
	ll l, r;
	cin>>l>>r;
	ans+=licz(l, min((ll)N, r), 0)+licz(max(l, (ll)N+1), r, 1);
	cout<<ans<<ent;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	solve();
	return 0;
}