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

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

#include<atcoder/modint>
typedef atcoder::modint998244353 mint;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	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);
		if (m/(j+2) == v) {
			ans += mint(m%(j+1) + m%i) * (i-j) * inv2;
		}else{
			ans += m%(j+1);
		}
		i = j;
	}
	cout << ans.val() << '\n';
}