#include<bits/stdc++.h>
using namespace std;
constexpr int _N = 1000 + 5, mod = 998244353;
int n, m, a[_N][_N], b[_N][_N];
int suma[_N][_N], sumb[_N][_N];
int Add(int x, int y) {
	int res = x + y;
	return res >= mod ? res - mod : res;
}
void Addmod(int &x, int y) { x = Add(x, y); }
signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j)	
			cin >> a[i][j], suma[i][j] = Add(suma[i][j - 1], a[i][j]);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j)
			cin >> b[i][j], sumb[i][j] = Add(sumb[i - 1][j], b[i][j]);
	int ans = 2;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j) {
			int res = 1ll * suma[i][j - 1] * sumb[i - 1][j] % mod;
			res = 1ll * res * Add(suma[i + 1][n], mod - suma[i + 1][j - 1]) % mod;
			res = 1ll * res * Add(sumb[n][j + 1], mod - sumb[i - 1][j + 1]) % mod;
			Addmod(ans, res);
		}
	cout << ans << '\n';
}