#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")


/*
  e[x][y] = [corner at (x, y)]  (0 <= x <= M, 0 <= y <= N)
  C[x][y] = \sum e[x, x+1][y, y+1]  (0 <= x < M, 0 <= y < N)
  
  D[x][y] := \sum c[x][y, y+1]  (0 <= x <= M, 0 <= y < N)
  C[x][y] = D[x][y] + D[x+1][y]  (0 <= x < M)
  \sum D[0, M][y] = \sum e[0, M][y] + \sum e[0, M][y+1] == 0 + 0 = 0  (mod 2)
  D[x][y] mod 2: determined if M: even
  
  (e[x][0], ..., e[x][N]): at most 2 ways
  given e[x][*],
  (e[x+1][y], e[x+1][y+1]) = (0, 0), (1, 1): distinguishable
  
  bad case: (0,1, 0,1, ..., 0,1), (1,0, 1,0, ..., 1,0)
  determined if there is tate-sen at 1 <= y <= N-1
  2-taku for O(1) states
  O(M) states finally
*/

constexpr Int INF = 1001001001001001001LL;

int M, N;
int C[110][110];
Int Yoko[110][110], Tate[110][110];

int D[110][110];

using INT = __int128;
bool can[110][2];
INT E[110][2];
INT jama[110][2];
Int cost[110][2];
bool adj[110][2][2];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &M, &N);
    if (M % 2 == 0) {
      for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) scanf("%d", &C[x][y]);
      for (int x = 0; x <= M; ++x) for (int y = 0; y < N; ++y) scanf("%lld", &Yoko[x][y]);
      for (int x = 0; x < M; ++x) for (int y = 0; y <= N; ++y) scanf("%lld", &Tate[x][y]);
    } else if (N % 2 == 0) {
      swap(M, N);
      for (int y = 0; y < N; ++y) for (int x = 0; x < M; ++x) scanf("%d", &C[x][y]);
      for (int y = 0; y <= N; ++y) for (int x = 0; x < M; ++x) scanf("%lld", &Tate[x][y]);
      for (int y = 0; y < N; ++y) for (int x = 0; x <= M; ++x) scanf("%lld", &Yoko[x][y]);
    } else {
      assert(false);
    }
/*
cerr<<COLOR("33");
cerr<<"C = "<<endl;for(int x=0;x<M;++x)pv(C[x],C[x]+N);
cerr<<"Yoko = "<<endl;for(int x=0;x<=M;++x)pv(Yoko[x],Yoko[x]+N);
cerr<<"Tate = "<<endl;for(int x=0;x<M;++x)pv(Tate[x],Tate[x]+(N+1));
cerr<<COLOR();
*/
    
    for (int y = 0; y < N; ++y) {
      D[0][y] = 0;
      for (int x = 1; x < M; x += 2) D[0][y] ^= C[x][y];
      D[0][y] &= 1;
      for (int x = 0; x < M; ++x) D[x+1][y] = (C[x][y] ^ D[x][y]) & 1;
    }
// cerr<<"D = "<<endl;for(int x=0;x<=M;++x)pv(D[x],D[x]+N);
    for (int x = 0; x <= M; ++x) {
      for (int s = 0; s < 2; ++s) {
        E[x][s] = s;
        jama[x][s] = 0;
        cost[x][s] = 0;
        int e = s;
        int yokosen = e;
        for (int y = 0; y < N; ++y) {
          e ^= D[x][y];
          E[x][s] |= (INT)e << (y+1);
          if (yokosen && !e) jama[x][s] |= (INT)1 << (y+1);
          if (yokosen) cost[x][s] += Yoko[x][y];
          yokosen ^= e;
        }
        can[x][s] = !yokosen;
      }
    }
    for (int x = 0; x < M; ++x) {
      for (int s = 0; s < 2; ++s) for (int t = 0; t < 2; ++t) {
        bool &ok = adj[x][s][t] = true;
        ok = ok && can[x][s] && can[x+1][t];
        for (int y = 0; y < N; ++y) {
          int c = 0;
          c += (E[x][s] >> y & 1);
          c += (E[x][s] >> (y+1) & 1);
          c += (E[x+1][t] >> y & 1);
          c += (E[x+1][t] >> (y+1) & 1);
          ok = ok && (C[x][y] == c);
        }
      }
    }
    
    // state: tate-sen set
    map<INT, Int> crt[2];
    for (int s = 0; s < 2; ++s) if (can[0][s]) {
      crt[s][E[0][s]] = cost[0][s];
    }
    for (int x = 0; x < M; ++x) {
      map<INT, Int> nxt[2];
      for (int s = 0; s < 2; ++s) for (int t = 0; t < 2; ++t) if (adj[x][s][t]) {
        for (const auto &kv : crt[s]) {
          if (!(kv.first & jama[x+1][t])) {
            const INT kk = kv.first ^ E[x+1][t];
            Int co = kv.second;
            for (int y = 0; y <= N; ++y) if (kv.first >> y & 1) co += Tate[x][y];
            co += cost[x+1][t];
            auto it = nxt[t].find(kk);
            if (it != nxt[t].end()) {
              chmin(it->second, co);
            } else {
              nxt[t][kk] = co;
            }
          }
        }
      }
      for (int t = 0; t < 2; ++t) {
        crt[t].swap(nxt[t]);
      }
    }
    Int ans = INF;
    for (int s = 0; s < 2; ++s) {
      for (const auto &kv : crt[s]) {
        if (!kv.first) {
          chmin(ans, kv.second);
        }
      }
    }
    printf("%lld\n", (ans < INF) ? ans : -1);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}