#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long N = 1e6 + 5;
void pairsort(long long a[], long long b[], long long n) {
  pair<long long, long long> pairt[n];
  for (long long i = 0; i < n; i++) {
    pairt[i].first = a[i];
    pairt[i].second = b[i];
  }
  sort(pairt, pairt + n);
  for (long long i = 0; i < n; i++) {
    a[i] = pairt[i].first;
    b[i] = pairt[i].second;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long isPrime(long long n) {
  if (n < 2) return 0;
  if (n < 4) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (long long i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
long long C(long long n, long long r) {
  if (r > n - r) r = n - r;
  long long ans = 1;
  for (long long i = 1; i <= r; i++) {
    ans *= n - r + i;
    ans /= i;
  }
  return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
  long long res = 1;
  x = x % mod;
  while (p) {
    if (p % 2) res = res * x;
    p >>= 1;
    x = x * x % mod;
    res %= mod;
  }
  return res;
}
long long t, n, m, x, a[10], b[5][105];
multiset<long long, greater<long long>> ms;
map<long long, vector<pair<long long, long long>>> M;
map<long long, long long> mp;
long long check(long long ans) {
  long long s = 0;
  for (long long i = 1; i <= n; i++) {
    long long mx = 0;
    for (long long j = 1; j <= m; j++) mx = (mx > b[i][j] ? mx : b[i][j]);
    s += mx;
  }
  return (ans > s ? ans : s);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> t;
  while (t--) {
    cin >> n >> m, ms.clear(), M.clear(), mp.clear();
    for (long long i = 0; i < n; i++)
      for (long long j = 0; j < m; j++)
        cin >> x, b[i + 1][j + 1] = x, M[x].push_back({i + 1, j + 1}),
                               ms.insert(x);
    if (n <= 3 || m == 1) {
      long long ans = 0;
      while (n--) ans += *ms.begin(), ms.erase(ms.begin());
      cout << ans << "\n";
      continue;
    }
    long long ans = 0, tans = 0;
    for (long long i = 0; i < n + 1; i++)
      a[i] = *ms.begin(), ans += a[i], tans += a[i], ms.erase(ms.begin());
    ans -= a[n], tans = 0;
    if (a[n] == a[n - 1]) {
      cout << ans << "\n";
      continue;
    }
    set<long long> dc;
    pair<long long, long long> p[4];
    for (long long i = 0; i < n; i++)
      p[i] = M[a[i]][mp[a[i]]++], dc.insert(p[i].second);
    if (dc.size() != 2) {
      cout << ans << "\n";
      continue;
    }
    long long x1 = *dc.begin(), x2;
    dc.erase(x1), x2 = *dc.begin();
    for (long long i = 1; i <= 5; i++) {
      long long tp = b[1][x1];
      for (long long k = 1; k < 4; k++) b[k][x1] = b[k + 1][x1];
      b[4][x1] = tp;
      for (long long j = 1; j <= 5; j++) {
        long long tp = b[1][x2];
        for (long long k = 1; k < 4; k++) b[k][x2] = b[k + 1][x2];
        b[4][x2] = tp;
        tans = check(tans);
      }
    }
    cout << tans << "\n";
  }
  return 0;
}
