#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,p;
signed main(){
	srand(time(0));
	cin >> n >> p;
	int res =0 ;
//	if(p>n)swap(p,n);
	if(p>=n){
		cout << n*n << endl;return 0;
	}
	//先处理 j<=p 的情况，这个时候不管怎么做都成立
	int ans = p*n;
	// j>p，拆成两段做
	for(int l = p+1,r;l<=n;l = r+1){
		int k = n/l;r = n/k;
		ans+=(p+1)*(r-l+1)*k;
	}
//	cout << ans <<endl;
	//第二段，没有取满，可以在段内做一下二分
	for(int l = p+1,r;l<=n;l = r+1){
		int k = n/l;r = n/k;
		int ll = l,rr = r+1;
		while(ll<rr){
			int mid = ll+rr>>1;
			if(n-k*mid+1<p+1)rr = mid;
			else ll = mid+1;
		}
		ans+=(rr-l)*(p+1)+(n+1)*(r-rr+1)-k*((r+rr)*(r-rr+1)/2);
	}
	ans-=(n-p);
	cout << ans<<endl;
	return 0;
}
/*
13 0 
*/