#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
typedef long long ll;
typedef atcoder::modint998244353 mint;
int main(){
	ll n, m; cin >> n >> m;
	ll i = n;
	mint ans = 0;
	mint inv2 = mint(2).inv();
	while (i > 0){
		ll v = m/i;
		ll j = m/(v+1);
		ans += mint(m%(j+1) + m%i) * (i-j) * inv2;
		i = j;
	}
	cout << ans.val() << '\n';
}