#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

//等差数列の和を求める(初項,項数,公差)
mint arith_sum1(long long fst, long long n, long long d){
    return mint(n) * (fst + (n - 1) * mint(d) * 499122177);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, m;
    cin >> n >> m;
    mint ans;
    if(n > m) ans += mint(n - m) * m;
    n = min(n, m - 1);
    ll cur = 1;
    while(cur <= n && cur * cur <= m){
        ans += m % cur;
        cur++;
    }
    while(cur <= n){
        ll d = m / cur;
        ll nxt = m / d + 1;
        ll dn = min(n + 1, nxt) - cur;
        ans += arith_sum1(m % cur, dn, -d);
        cur = nxt;
    }
    cout << ans.val() << '\n';
}