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

ll n , k , ans;

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k;
    for (ll i = 1 , j , f , l ; i <= min(n , k) ; i = j + 1) {
        j = k / (k / i);
        f = k % i , l = k % j;
        ans += (f + l) * (j - i + 1) / 2;
        cout << f << " " << l << " " << i << " " << j << " " << ans << endl;
    }
    if (n > k) ans += (n - k) * k;
    cout << ans;
	return 0;
}

蒟蒻使用了不知道什么逆天算法，求条