#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=double;
#define FOR(i,a,b) for(ll i=a;i<(ll)b;++i)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define aa first
#define bb second
#define PB push_back
#define EQ(a,b) (fabs(a-b)<=(fabs(a+b)*EPS))
#define MOD ((ll)(1e9+7))
#define INF (1ll << 40)

ll f(ll n) {
  if (n <= 0) return 0;
  ll res = 0;
  //cout << 1 << ": " << res << endl;
  for (ll i = 1; i*i <= n; ++ i) {
    res += 2*(n/i);
    res -= (((ll)sqrt(n)));
    }
  //res += sqrt(n);


  //res += (n - ((ll)sqrt(n) - 1));
  //if (n >= 1) res += (n - ((ll)sqrt(n)));
  return res;
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  ll n, m;
  cin >> n >> m;
  cout << f(m) - f(n-1) << endl;
  //cout << f(12) << endl;
  //cout << f(5) << endl;

  return 0;
}