#include <algorithm>
#include <array>
#include <bit>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>

template <int D>
int Solve(const std::vector<int>& z, const std::vector<std::vector<int>>& a) {
  const int n = a.size(), m = a.front().size();
  assert(std::ssize(z) == n + m);

  std::vector<int> y(n + m, 0);
  for (int i = 1; i < n; ++i) {
    y[i] = a[i].front() ^ a.front().front();
  }
  for (int j = 0; j < m; ++j) {
    y[j + n] = a.front()[j];
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if ((y[i] ^ y[j + n]) != a[i][j]) return -1;
    }
  }

  // binary trie
  static constexpr int kNoEdge = -1;
  static constexpr std::array<std::pair<int, std::int64_t>, 2> kLeaf{
      std::make_pair(kNoEdge, 0), std::make_pair(kNoEdge, 0)};
  const int inf = (n + m) * 2 + 1;
  std::vector trie{kLeaf};
  const auto MakeNode = [&trie]() -> int {
    const int index = trie.size();
    trie.emplace_back(kLeaf);
    return index;
  };
  const auto Add = [&trie, MakeNode](const int y_i, const int z_i, const int w)
      -> void {
    int index = 0;
    for (int bit = D - 1; bit >= 0; --bit) {
      const int edge_label = (y_i ^ z_i) >> bit & 1;
      if ((z_i >> bit & 1) == 0) {
        if (trie[index][edge_label ^ 1].first == kNoEdge) {
          trie[index][edge_label ^ 1].first = MakeNode();
        }
        trie[index][edge_label ^ 1].second += w;
      }
      if (trie[index][edge_label].first == kNoEdge) {
        trie[index][edge_label].first = MakeNode();
      }
      index = trie[index][edge_label].first;
    }
  };

  for (int i = 0; i < n + m; ++i) {
    if (z[i] == 0) {
      Add(y[i], z[i], inf);
    } else {
      Add(y[i], 0, 1);
      Add(y[i], z[i], 1);
      Add(y[i], std::bit_ceil(static_cast<unsigned int>(z[i] + 1)) - 1, inf);
    }
  }

  std::int64_t ans = inf;
  const int node_num = trie.size();
  std::vector<std::int64_t> f(node_num, 0);  // 根からその頂点までの重み
  for (int i = 0; i < node_num; ++i) {
    for (const auto& [j, weight] : trie[i]) {
      if (j == kNoEdge) {
        ans = std::min(ans, f[i]);
      } else {
        f[j] = f[i] + weight;
      }
    }
  }
  return ans < inf ? ans : -1;
}

int main() {
  constexpr int kMaxT = 50000, kMaxNM = 50000, kDigits = 30;

  int t;
  std::cin >> t;
  assert(1 <= t && t <= kMaxT);

  while (t--) {
    int n, m;
    std::cin >> n >> m;
    assert(1 <= n && 1 <= m && n * m <= kMaxNM);
    std::vector<int> z(n + m);
    for (int i = 0; i < n + m; ++i) {
      std::cin >> z[i];
      assert(0 <= z[i] && z[i] < (1 << kDigits));
    }
    std::vector a(n, std::vector(m, 0));
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        std::cin >> a[i][j];
        assert(0 <= a[i][j] && a[i][j] < (1 << kDigits));
      }
    }
    std::cout << Solve<kDigits>(z, a) << '\n';
  }
  return 0;
}