#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
long long sum(long long n){
	return n * (n+1) / 2;
}


int main(){
	long long h,w;
	cin>>h>>w;
	long long X = sum(h/2);
	X *= 2;
	X += h;
	long long Y = sum(w/2);
	Y *= 2;
	Y += w;
	mint ans = X;
	ans *= Y;
	ans -= h*w;
	mint aa = h*w;
	aa *= (h*w-1);
	aa -= ans;
	cout<<aa.val()<<endl;
	/*
	int h,w;
	h = 3,w = 4;
	int ans = 0;
	rep(i,h){
		rep(j,w){
			rep(k,h){
				rep(l,w){
					if(i==k&&j==l)continue;
					if(k==0&&i>=1){
						ans++;
						continue;
					}
					if(k==2&&i<=1){
						ans++;
						continue;
					}
					
					if(l==0&&j>=1){
						ans++;
						continue;
					}
					if(l==3&&j<=2){
						ans++;
						continue;
					}
					
				}
			}
		}
	}
	cout<<ans<<endl;
	*/
	return 0;
}