#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,m;
    cin >> n >> m;
    ll ans = n % MOD * m % MOD;
    ll inv2 = (MOD+1)/2;
    for(ll i=1;i*i<=m&&i<=n;++i){
        ans = (ans + MOD - m/i*i % MOD) % MOD;
        // cout << m/i*i << '\n';
        if(i<m/i){
            ll r1 = 0, r2 = m+1;
            while(r1+1<r2){
                ll md = (r1 + r2) / 2;
                if(m/md>=i) r1 = md;
                else r2 = md;
            }
            ll l1 = 0, l2 = m+1;
            while(l1+1<l2){
                ll md = (l1 + l2) / 2;
                if(m/md>i) l1 = md;
                else l2 = md;
            }
            if(l2<=n){
                chmin(r1, n);
                // cout << i << " " << l2 << " " << r1 << " ";
                ll x = ((l2+r1)%MOD) * ((r1-l2+1)%MOD) % MOD * inv2 % MOD * i % MOD;
                // cout << x << '\n';
                ans = (ans + MOD - x) % MOD;
            }
        }
    }
    cout << ans << '\n';
    return 0;
}