#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
template <class T, class F>
T binarySearch(T ok, T ng, const F &f) {
	while (abs(ok - ng) > 1) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
mint calc(long long x, long long y) {
	mint sz = y - x + 1;
	return sz * (x + y) / 2;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n, m; cin >> n >> m;
	mint ans = 0;
	ans = mint(m) * n;
	for (long long i = 1; i <= n; i++) {
		long long target = m / i;
		if (0 == target)break;
		auto f = [&](long long x)->bool {
			return target == m / x;
		};
		long long j = binarySearch(i, n + 1, f);
		ans -= mint::raw(target) * calc(i, j);
		i = j;
	}
	cout << ans.val() << endl;
	return 0;
}