#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
template<class T, class _Cmp = std::less<T>>
using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, _Cmp, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
#ifdef LOCAL
#include "debug.hpp"
#else 
#define debug(...) 
#endif
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 998244353;


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    ll n, m;
    cin >> n >> m;
    vector<vector<ll>> p(n + 1, vector<ll>(m + 1));
    vector<vector<ll>> q(n + 1, vector<ll>(m + 1));
    for (ll i = 1; i <= n; i++){
        for (ll j = 1; j <= m; j++){
            cin >> p[i][j];
            p[i][j] += p[i][j - 1];
            p[i][j] %= mod;
        }
    }
    for (ll i = 1; i <= n; i++){
        for (ll j = 1; j <= m; j++){
            cin >> q[i][j];
            q[i][j] += q[i - 1][j];
            q[i][j] %= mod;
        }
    }
    ll ans = 2;
    for (ll i = 2; i <= n; i++){
        for (ll j = 2; j <= m; j++){
            ans += (1 + mod - p[i][j - 2]) * (1 + mod - q[i - 2][j]) % mod * p[i - 1][j - 2] % mod * q[i - 2][j - 1] % mod;
            ans %= mod;
        }
    }
    cout << ans << "\n";

    return 0;
}