#include <bits/stdc++.h>
using namespace std;
//*/
#include <atcoder/all>
using namespace atcoder;
// //*/
// #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());

using mint = modint998244353;

mint su(mint x){
    return x*(x+1)/2;
}
void solve(){
    ll n,m; cin >> n >>  m;
    m %= 998244353;
    mint ans = n;
    ans *= (mint)m;
    ll now = 1,nxt = 0;
    auto f = [&](ll x)->ll{
        int p = m/x;
        if(p == m/n) return n+1;
        ll wa = n+1,ac = 0;
        while(wa-ac > 1){
            ll mid = (wa+ac)/2;
            if(m/mid < p) wa = mid;
            else ac = mid;
        }
        return wa;
    };
    while(now != n+1){
        nxt = f(now);
        //cerr << now << " " << nxt << endl;
        mint diff = (mint)(m/now);
        diff *= (su((mint)(nxt-1))-su((mint)(now-1)));
        ans -= diff;
        swap(now,nxt);
    }
    cout << ans.val() << endl;
    // mint test = 0;
    // for(int i = 1;i <= n;i++) test += m%i;
    // cout << test.val() << endl;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(testcase,t) solve();
}