#include <bits/stdc++.h>
using namespace std;
vector<long long int> p[200005], q[200005], f(100005), b(100005), d(100005);
map<pair<pair<long long int, long long int>, long long int>, long long int> mp;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int bpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
void fact(long long int i) {
  f[0] = 1;
  for (long long int k = 1; k <= i; k++) {
    (f[k] = f[k - 1] * k) %= 1000000007;
  }
}
long long int isprime(long long int n) {
  if (n == 1) return 0;
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
long long int find(long long int x) {
  if (f[x] == x)
    return x;
  else
    return f[x] = find(f[x]);
}
bool cmp(long long int x, long long int y) { return x < y; }
long long int comb(long long int i, long long int j) {
  long long int k = f[i];
  long long int g = (f[j] * (f[i - j])) % 1000000007;
  long long int h = bpow(g, 1000000007 - 2);
  return (k * h) % 1000000007;
}
long long int dp[105][105], a[105][105];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    memset(dp, 0, sizeof(dp));
    long long int n, m;
    cin >> n >> m;
    for (long long int i = 0; i < n; i++) {
      for (long long int j = 1; j <= m; j++) {
        cin >> a[i][j];
      }
    }
    for (long long int i = 1; i <= m; i++) {
      for (long long int j = 0; j < (1 << n); j++) {
        for (long long int k = 0; k < 4; k++) {
          long long int val = 0;
          for (long long int l = 0; l < 4; l++) {
            if ((j >> l) & 1) val += a[l][i];
          }
          for (long long int l = 0; l < (1 << n); l++) {
            if (l & j) continue;
            dp[i][l | j] = max(dp[i][l | j], dp[i - 1][l] + val);
          }
          a[n][i] = a[0][i];
          for (long long int l = 0; l < 4; l++) {
            a[l][i] = a[l + 1][i];
          }
        }
      }
    }
    cout << dp[m][(1 << n) - 1] << "\n";
  }
}
