#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int ONE_SIXTH = 166374059;
vector<pair<int, pair<int, int>>> quotient_ranges(int N){
	vector<pair<int, pair<int, int>>> ans;
	for (int i = 1; i * i <= N; i++){
		ans.push_back(make_pair(N / i, make_pair(i, i)));
	}
	for (int i = N / ((int) sqrt(N) + 1); i >= 1; i--){
		ans.push_back(make_pair(i, make_pair(N / (i + 1) + 1, N / i)));
	}
	return ans;
}
long long sum1(long long x){
  return x * (x + 1) / 2 % MOD;
}
long long sum2(long long x){
  return x * (x + 1) % MOD * (x * 2 + 1) % MOD * ONE_SIXTH % MOD;
}
int main(){
  int N, M;
  cin >> N >> M;
  long long ans = (long long) N * (N + 1) / 2 % MOD * M % MOD;
  vector<pair<int, pair<int, int>>> Q = quotient_ranges(N);
  int cnt = Q.size();
  long long ans2 = 0;
  for (int i = 0; i < cnt; i++){
    int q = Q[i].first;
    int mn = Q[i].second.first;
    int mx = Q[i].second.second;
    mx = min(mx, M);
    if (mn <= mx){
      long long S1 = (long long) (N + 1) * (sum1(mx) - sum1(mn - 1) + MOD) % MOD * q % MOD;
      long long S2 = (long long) q * (q + 1) / 2 % MOD;
      S2 *= (sum2(mx) - sum2(mn - 1) + MOD) % MOD;
      S2 %= MOD;
      ans += MOD - S1 + S2;
    }
  }
  ans %= MOD;
  cout << ans << endl;
}