#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; }
mint inv2;
mint f(long long n, long long p) {
	long long c = n / p;
	mint x = p;
	mint y = p * c;
	return (x + y) * c * inv2;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	long long n, m; cin >> n >> m;
	inv2 = mint(2).inv();
	vector<mint>c(10000007);
	rrep2(i, 1, 10000007) {
		auto x = f(n, i);
		auto y = f(m, i);
		mint z = x * y;
		c[i] = z;
		for (long long j = i * 2; j < 10000007; j += i) {
			c[i] -= c[j];
		}
	}
	cout << c[1].val() << endl;
	return 0;
}