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

ll n, m;

ll p (ll n) {
	if (!n) return 0;
	ll ptr = 1, ans = 0;
	
	while (ptr != m + 1) {
		ll l = ptr + 1, r = m + 1;
		
		while (l < r) {
			ll mid = (l + r) / 2;
			if (n / mid < n / ptr) r = mid;
			else l = mid + 1;
		}
		ans += (l - ptr) * (n / ptr);
		ptr = l;
	}
	return ans;
}

int main () {
	cin >> n >> m;

	
	cout << p (m) - p (n - 1);
}