#include <bits/stdc++.h>
using namespace std;
struct p {
  int a[12];
  int ma;
};
p a[2001];
int tmp[4096];
int f[13][4096];
bool cmp(const p& a, const p& b) { return a.ma > b.ma; }
int main() {
  int t;
  int n, m, fk;
  int x;
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d", &n, &m);
    memset(f, 0, sizeof(f));
    memset(a, 0, sizeof(a));
    for (int i = 0; i < n; ++i)
      for (int j = 1; j <= m; ++j) {
        scanf("%d", &a[j].a[i]);
        a[j].ma = max(a[j].ma, a[j].a[i]);
      }
    fk = 1 << n;
    sort(a + 1, a + 1 + m, cmp);
    m = min(n, m);
    for (int i = 1; i <= m; ++i) {
      for (int st = 0; st < n; ++st) {
        for (int j = 0; j < fk; ++j) tmp[j] = f[i - 1][j];
        for (int j = 0; j < fk; ++j) {
          for (int k = 0, w = 1; k < n; ++k, w <<= 1) {
            if ((w & j) == 0) continue;
            tmp[j] = max(tmp[j], tmp[j ^ w] + a[i].a[(st + k) % n]);
          }
        }
        for (int j = 0; j < fk; ++j) f[i][j] = max(f[i][j], tmp[j]);
      }
    }
    printf("%d\n", f[m][fk - 1]);
  }
  return 0;
}
