#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;
using mint = modint998244353;

mint greedy(ll n, ll m) {
    mint ans = 0;
    rep(k, 1, n + 1) { ans += m % k; }
    return ans;
}

mint f(ll n, ll m) {
    mint ans = 0;
    set<ll> st;
    for (ll i = 1; i * i <= m; i++) {
        st.insert(i);
        st.insert(m / i);
    }
    for (ll i : st) {
        ll xl = m / (i + 1) + 1;
        ll xr = m / i;
        xr = min(xr, n);
        if (xl <= xr) {
            ans += (mint)i * (xl + xr) * (xr - xl + 1) / 2;
        }
    }
    return ans;
}

mint solve(ll n, ll m) {
    mint ans = (mint)m * n;
    ans -= f(n, m);
    return ans;
}

int main() {
    ll n, m;
    cin >> n >> m;
    cout << solve(n, m).val() << endl;
    // rep(i, 1, 100) rep(j, 1, 100) {
    //     if (solve(i, j).val() != greedy(i, j).val()) {
    //         cout << i << " " << j << " " << solve(i, j).val() << " "
    //              << greedy(i, j).val() << endl;
    //     }
    // }
}