#include <bits/stdc++.h>
#include <atcoder/modint.hpp>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
int main() {
    ll n,m; cin >> n >> m;
    ll sqrt_m = sqrt(n);
    ll r = n;
    mint ans = 0;
    for (ll d=0; d <= sqrt_m; d++) {
        ll l = min(r, m / (d+1));
        ans += mint(m) * mint(r - l) - mint(d) * mint(r + l + 1) * mint(r - l) / mint(2);
        r = l;
        if (r == 0) break;
    }
    for (ll i=1; i<=r; i++) {
        ans += (m % i);
    }
    cout << ans.val() << '\n';
}