#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

const mint inv2 = mint(2).inv();

// ONE DIMENSION
// sum[0<=i<x] i
mint d1sum(ll x){
	return mint(x) * mint(x-1) * inv2;
}

// sum[0<=i<x] sum[0<=j<y] ij
mint d2sum(ll x, ll y){
	return d1sum(x) * d1sum(y);
}

int main(){
	ll h, w; cin >> h >> w;
	mint ans = 0;
	ans += (d1sum(h) - d1sum((h+2)/2)) * w * 2;
	ans += (d1sum(w) - d1sum((w+2)/2)) * h * 2;
	ans += (d2sum(h, w) - d2sum((h+2)/2, w)) * 4;
	ans += (d2sum(h, w) - d2sum(h, (w+2)/2)) * 4;
	ans -= (d2sum(h, w) - d2sum(h, (w+2)/2) - d2sum((h+2)/2, w) + d2sum((h+2)/2, (w+2)/2)) * 4;
	cout << ans.val() << '\n';
}