#include <bits/stdc++.h>
using namespace std;
const int N = 1.1e3;
const int mod = 998244353;
int n, m, l[N][N], u[N][N], E;

signed main()
{
    ios::sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            cin >> l[i][j];
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            cin >> u[i][j];
    for (int i = 1; i <= n; ++i)
        for (int j = n; j >= 1; --j)
            l[i][j] = (l[i][j] + l[i][j + 1]) % mod;
    for (int j = 1; j <= n; ++j)
        for (int i = n; i >= 1; --i)
            u[i][j] = (u[i][j] + u[i + 1][j]) % mod;

    // for (int i = 1; i <= n; ++i)
    //     for (int j = 1; j <= n; ++j)
    //         printf("%d%c", l[i][j], " \n"[j == n]);

    // for (int i = 1; i <= n; ++i)
    //     for (int j = 1; j <= n; ++j)
    //         printf("%d%c", u[i][j], " \n"[j == n]);

    for (int i = 1; i < n; ++i)
        for (int j = 1; j < n; ++j)
        {
            int v1 = 1ll * (mod - l[i][j] + 1) * (mod - u[i][j] + 1) % mod;
            int v2 = 1ll * l[i + 1][j] * u[i][j + 1] % mod;
            E = (E + 1ll * v1 * v2 % mod) % mod;
        }
    cout << E + 2 << endl;
    return 0;
}