#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// corners on the board: [1, M+1] * [1, N+1]
int M, N;
int A[210][210];

int f[210][210];

Int solve() {
  for (int x = 0; x <= 2*M+4; ++x) for (int y = 0; y <= 2*N+4; ++y) f[x][y] = 0;
  // yoko x = 1
  for (int y0 = 1, y1 = 1; y0 <= N; y0 = y1) {
    for (; y1 <= N && A[1 + 2][y0 + y0+1] == A[1 + 2][y1 + y1+1]; ++y1) {}
    if (A[1 + 2][y0 + y0+1] == 4) {
      f[1 + 1][y0 + y0+1] = 1;
    } else if (A[1 + 2][y0 + y0+1] == 3) {
      for (int y = y0; y < y1; y += 2) f[1 + 1][y + y+1] = 1;
    }
  }
  // tate y = 1
  for (int x0 = 1, x1 = 1; x0 <= M; x0 = x1) {
    for (; x1 <= M && A[x0 + x0+1][1 + 2] == A[x1 + x1+1][1 + 2]; ++x1) {}
    if (A[x0 + x0+1][1 + 2] == 4) {
      f[x0 + x0+1][1 + 1] = 1;
    } else if (A[x0 + x0+1][1 + 2] == 3) {
      for (int x = x0; x < x1; x += 2) f[x + x+1][1 + 1] = 1;
    }
  }
  // inflate path
  for (int x = 1; x <= M; ++x) for (int y = 1; y <= N; ++y) {
    // corner (x, y+1)
    f[x + x+1][y+1 + y+1] = f[x + x-1][y+1 + y+1] ^ f[x + x][y+1 + y] ^ f[x + x][y+1 + y+2];
    // cell (x+1/2, y+1/2)
    f[x+1 + x+1][y + y+1] = (A[x + x+1][y + y+1] & 1) ^ f[x + x][y + y+1] ^ f[x + x+1][y + y] ^ f[x + x+1][y+1 + y+1];
  }
// for(int x=0;x<=2*M+4;++x)pv(f[x],f[x]+(2*N+5));cerr<<endl;
  for (int x = 1; x <= M+1; ++x) for (int y = 1; y <= N+1; ++y) {
    const int sum = f[x + x-1][y + y] + f[x + x][y + y-1] + f[x + x][y + y+1] + f[x + x+1][y + y];
    if (!(sum == 0 || sum == 2)) return -1;
  }
  for (int x = 1; x <= M; ++x) for (int y = 1; y <= N; ++y) {
    const int sum = f[x + x][y + y+1] + f[x + x+1][y + y] + f[x + x+1][y+1 + y+1] + f[x+1 + x+1][y + y+1];
    if (sum != A[x + x+1][y + y+1]) return -1;
  }
  Int ans = 0;
  for (int x = 0; x <= 2*M+4; ++x) for (int y = 0; y <= 2*N+4; ++y) {
    ans += A[x][y] * f[x][y];
  }
  return ans;
}

int main() {
  for (; ~scanf("%d%d", &M, &N); ) {
    for (int x = 0; x <= 2*M+4; ++x) for (int y = 0; y <= 2*N+4; ++y) A[x][y] = 0;
    for (int x = 1; x <= M; ++x) for (int y = 1; y <= N; ++y) scanf("%d", &A[x + x+1][y + y+1]);
    for (int x = 1; x <= M+1; ++x) for (int y = 1; y <= N; ++y) scanf("%d", &A[x + x][y + y+1]);
    for (int x = 1; x <= M; ++x) for (int y = 1; y <= N+1; ++y) scanf("%d", &A[x + x+1][y + y]);
// for(int x=0;x<=2*M+4;++x)pv(A[x],A[x]+(2*N+5));cerr<<endl;
    
    const Int ans = solve();
    printf("%lld\n", ans);
  }
  return 0;
}