#include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define revrep(i, a, n) for (int i = n; i >= a; --i)
using namespace std;

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;

template<const int &mod> struct Z {
	int x;
	Z(ll a = 0): x(a % mod) { if (x < 0) x += mod; }
	explicit operator int() const { return x; }
	Z& operator +=(Z b) { x += b.x; if (x >= mod) x -= mod; return *this; }
	Z& operator -=(Z b) { x -= b.x; if (x < 0) x += mod; return *this; }
	Z& operator *=(Z b) { x = 1ll * x * b.x % mod; return *this; }
	friend Z operator +(Z a, Z b) { return a += b; }
	friend Z operator -(Z a, Z b) { return a -= b; }
	friend Z operator *(Z a, Z b) { return a *= b; }

	Z pow(ll k) const {
		Z res = 1, a = *this;
		for (; k; k >>= 1, a = a * a)  if (k & 1) res = res * a;
		return res;
	}
	Z& operator /=(Z b) {
		assert(b.x != 0);
		*this = *this * b.pow(mod - 2);
		return *this;
	}
	friend Z operator /(Z a, Z b) { return a /= b; }
	friend string to_string(Z a) { return to_string(a.x); }
};
const int mod = 998244353;
using Mint = Z<mod>;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin >> n >> m;
	auto binom = [](int n, int m) -> Mint {
		Mint res = 1;
		rep(i, 0, m - 1) res *= n - i;
		rep(i, 1, m) res /= i;
		return res;
	};
	auto separate = [&](int n) {
		return binom(n, 4);
	};
	auto contain = [&](int n) {
		return binom(n, 4);
	};
	auto tot = [&](int n) {
		return binom(n, 2) * binom(n, 2);
	};
	Mint res = 0;
	res += separate(n) * tot(m);
	res += separate(m) * tot(n);
	res -= separate(n) * separate(m) * 2;
	res += contain(n) * contain(m);
	printf("%d\n", (int) res);
	return 0;
}