#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cout << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

void inc(ll &a, ll b) {
    a += b;
    if (a >= mod) a -= mod;
}

void dec(ll &a, ll b) {
    a -= b;
    if (a < 0) a += mod;
}

ll add(ll a, ll b) {
    a += b;
    return a >= mod ? a - mod : a;
}

ll del(ll a, ll b) {
    a -= b;
    return a < 0 ? a + mod : a;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    vector<vector<ll>> p(n, vector<ll>(m));
    vector<vector<ll>> q(n, vector<ll>(m));
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
        cin >> p[i][j];
        if (j) p[i][j] += p[i][j - 1];
    }
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
        cin >> q[i][j];
        if (i) q[i][j] += q[i - 1][j];
    }
    ll ans = 2;
    for (int i = 1; i + 1 < n; ++i) for (int j = 1; j + 1 < m; ++j) {
        inc(ans, p[i][j - 1] * q[i - 1][j] % mod * del(1, p[i + 1][j - 1]) % mod * del(1, q[i - 1][j + 1]) % mod);
    }
    cout << ans << el;
}