#include <bits/stdc++.h>
using namespace std;
const int N = 12, M = 2010;
int n, m;
int grid[N][M];
int mxcol[M];
int tot;
vector<pair<int, int> > v;
vector<int> arr;
int tmp[N];
void shift(int col) {
  for (int i = 0; i < n; i++) {
    if (i == n - 1)
      tmp[0] = grid[i][col];
    else
      tmp[i + 1] = grid[i][col];
  }
  for (int i = 0; i < n; i++) {
    grid[i][col] = tmp[i];
  }
}
int cur = 0;
int val[N][(1 << N) + 1];
int dp[N + 1][(1 << N) + 1];
vector<int> nxt[(1 << N)];
void solve() {
  scanf("%d%d", &n, &m);
  tot = (1 << n) - 1;
  v.clear();
  arr.clear();
  for (int i = 0; i < m; i++) mxcol[i] = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      scanf("%d", &grid[i][j]);
      mxcol[j] = max(mxcol[j], grid[i][j]);
    }
  }
  for (int i = 0; i < m; i++) {
    v.push_back(make_pair(mxcol[i], i));
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  for (int i = 0; i < (int)v.size() && i < n; i++) {
    arr.push_back(v[i].second);
  }
  for (int i = 0; i < (int)arr.size(); i++)
    for (int mask = 0; mask < (1 << n); mask++) val[i][mask] = 0;
  for (int i = 0; i < (int)arr.size(); i++) {
    for (int it = 0; it < n; it++) {
      for (int mask = 1; mask < (1 << n); mask++) {
        cur = 0;
        for (int k = 0; k < n; k++) {
          if (((mask >> k) & 1) == 1) cur += grid[k][arr[i]];
        }
        val[i][mask] = max(val[i][mask], cur);
      }
      shift(arr[i]);
    }
  }
  for (int col = (int)arr.size(); col >= 0; col--) {
    dp[col][tot] = 0;
    for (int mask = 0; mask < tot; mask++) {
      if (col == (int)arr.size()) {
        dp[col][mask] = -1000000010;
        continue;
      }
      dp[col][mask] = 0;
      for (int i = 0; i < (int)nxt[mask].size() && nxt[mask][i] <= tot; i++) {
        dp[col][mask] = max(dp[col][mask], dp[col + 1][(mask | nxt[mask][i])] +
                                               val[col][nxt[mask][i]]);
      }
    }
  }
  printf("%d\n", dp[0][0]);
}
int main() {
  for (int i = 0; i < (1 << N); i++) {
    for (int j = 0; j < (1 << N); j++) {
      if ((i & j) == 0) nxt[i].push_back(j);
    }
  }
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
