#include <bits/stdc++.h>
using namespace std;
using ll = long long;
inline int read();
int save[32][2048], n, m;
vector<int> get_cols() {
  for (int j = 1; j <= m; ++j) {
    save[0][j] = 0;
    for (int i = 1; i <= n; ++i) save[0][j] = max(save[0][j], save[i][j]);
  }
  vector<int> cols;
  for (int j = 1; j <= m; ++j) cols.push_back(j);
  sort(cols.begin(), cols.end(),
       [](int a, int b) { return save[0][a] > save[0][b]; });
  cols.resize(min(n, m));
  return cols;
}
int cal_table[16][4096];
int cal(int c, int x) {
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    int tmp = 0;
    for (int j = 0; j < n; ++j)
      if (x >> j & 1) tmp += save[i + j][c];
    ans = max(ans, tmp);
  }
  return ans;
}
int dp[16][4096];
vector<int> sub[4096];
int main(void) {
  for (int i = 0; i < 4096; ++i)
    for (int j = 0; j <= i; ++j)
      if ((i | j) == i) sub[i].push_back(j);
  int T = read();
  while (T--) {
    n = read(), m = read();
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= m; ++j) save[i][j] = read();
    vector<int> cols = get_cols();
    m = min(n, m);
    for (int c : cols)
      for (int i = 1; i <= n; ++i) save[i + n][c] = save[i][c];
    for (int i = 1; i <= m; ++i)
      for (int x = 0; x < (1 << n); ++x) cal_table[i][x] = cal(cols[i - 1], x);
    for (int i = 1; i <= m; ++i)
      for (int j = 0; j < (1 << n); ++j) {
        dp[i][j] = 0;
        for (int k : sub[j])
          dp[i][j] = max(dp[i][j], dp[i - 1][k] + cal_table[i][j - k]);
      }
    printf("%d\n", dp[m][(1 << n) - 1]);
  }
  return 0;
}
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
