#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for(ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for(auto &&e : v)
#define all(a) begin(a), end(a)
#define si(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }
template <typename T, typename S> bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t

struct _ {
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int rnd(int l, int r) {
    mt19937_64 mt(time(NULL));
    return uniform_int_distribution<int>(l, r - 1)(mt);
}

const ll mod = 998244353;

int main() {
    ll n, m;
    cin >> n >> m;
    ll ans = 0;
    if(n > m) {
        ans += (n - m) % mod * (m % mod) % mod;
        n = m;
    }
    ans += n % mod * (m % mod) % mod;

    ll d = 1;
    ll pre = 1;
    while(d) {
        ll l = m / (d + 1) + 1, r = m / d;
        chmin(r, n);
        if(l <= r) ans -= d % mod * ((l + r) % mod) % mod * ((r - l + 1) % mod) % mod * ((mod + 1) / 2) % mod;
        if(l == 1) break;
        d = m / (l - 1);
        pre = l - 1;
    }
    cout << (ans % mod + mod) % mod << endl;
}