#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

typedef long long ll;
typedef long double ld;
int n, m;
const int maxN = 105;
int a[maxN][maxN];
int b[maxN][maxN];
int val_a[maxN][maxN];
int val_b[maxN][maxN];
int cnt[maxN][maxN];
void solve() {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> cnt[i][j];
        }
    }

    for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m + 1; j++) {
            cin >> b[i][j];
        }
    }
    for (int i = 0; i <= n + 1; i++) {
        for (int j = 0; j <= m + 1; j++) {
            val_a[i][j] = val_b[i][j] = 0;
        }
    }

    ll score = 0;
    if (cnt[1][1] == 4) {
        val_b[1][1] = 1;
        val_a[1][1] = 1;
    }
    else {
        val_b[1][1] = 0;
        val_a[1][1] = 0;
    }
    for (int i = 2; i <= m + 1; i++) {
        if (val_a[1][i - 1] == 1) {
            val_b[1][i] = 1;
            val_a[1][i] = 0;
        }
        else {
            if (i == m + 1) {
                val_b[1][i] = 0;
            }
            else {
                if (cnt[1][i] >= 3) {
                    val_b[1][i] = val_a[1][i] = 1;
                }
                else {
                    val_b[1][i] = val_a[1][i] = 0;
                }
            }
        }
    }
    for (int row = 2; row <= n + 1; row++) {
        for (int col = 1; col <= m; col++) {
            val_a[row][col] = cnt[row - 1][col] - val_a[row - 1][col] - val_b[row - 1][col] - val_b[row - 1][col + 1];
            if (val_a[row][col] < 0 || val_a[row][col] > 1) {
                cout << -1 << '\n';
                return;
            }
        }
        if (row == n + 1) break;
        for (int col = 1; col <= m + 1; col++) {
            val_b[row][col] = (val_b[row - 1][col] ^ val_a[row][col - 1]) ^ val_a[row][col];
        }
        val_b[row][1] = (val_b[row - 1][1] ^ val_a[row][1]);

    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            int F = val_a[i + 1][j] + val_a[i][j] + val_b[i][j] + val_b[i][j + 1];
            if (F != cnt[i][j]) {
                cout << -1 << '\n';
                continue;
            }
        }
    }
    for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j <= m + 1; j++) {
            int X = val_a[i][j] + val_a[i][j - 1] + val_b[i - 1][j] + val_b[i][j];
            if (X != 0 && X != 2) {
                cout << -1 << '\n';
                return;
            }
        }
    }

    for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j + 1 <= m; j++) {
            if (val_a[i][j] && val_a[i][j + 1]) {
                cout << -1 << '\n';
                return;
            }
        }
    }


    for (int i = 1; i <= n - 1; i++) {
        for (int j = 1; j <= m + 1; j++) {
            if (val_b[i][j] && val_b[i + 1][j]) {
                cout << -1 << '\n';
                return;
            }
        }
    }

    for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j <= m; j++) {
            if (val_a[i][j] < 0 || val_a[i][j] > 1) {
                cout << -1 << '\n';
                return;
            }
            score += val_a[i][j] * a[i][j];
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m + 1; j++) {
            if (val_b[i][j] < 0 || val_b[i][j] > 1) {
                cout << -1 << '\n';
                return;
            }
            score += val_b[i][j] * b[i][j];
        }
    }

    cout << score << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    while (cin >> n >> m) {
        solve();
    }
    return 0;
}