#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double pi = acos(-1.0);
int sgn(double d) { return d > eps ? 1 : (d < -eps ? -1 : 0); }
double trim(double d, double l = 1.0) { return d > l ? l : (d < -l ? -l : d); }
vector<int> average(const vector<vector<int> >& x, int start, int len) {
  vector<int> ret;
  for (int i = 0; i < (x[start].size()); ++i) {
    int v = 0;
    for (int j = 0; j < (len); ++j) {
      v += x[start + j][i];
    }
    ret.push_back(v);
  }
  return ret;
}
int vdiff(const vector<int>& x, const vector<int>& y) {
  int ans = 0;
  for (int i = 0; i < (x.size()); ++i) {
    ans += (x[i] - y[i]) * (x[i] - y[i]);
  }
  return ans;
}
const int AVER_NUM = 2;
int calc_dis(const vector<vector<int> >& pic, int k, int x, int y) {
  int h = pic.size();
  int part = h / k;
  return vdiff(average(pic, (x + 1) * part - AVER_NUM, AVER_NUM),
               average(pic, y * part, AVER_NUM));
}
int dp[65540][17];
int opt[65540][17];
int dis[20][20];
int main() {
  int q;
  int h, w, k;
  scanf("%d", &q);
  for (int x = 0; x < (q); ++x) {
    scanf("%d%d%d", &h, &w, &k);
    vector<vector<int> > pic;
    for (int i1 = 0; i1 < (h); ++i1) {
      vector<int> line;
      int v;
      for (int j1 = 0; j1 < (w); ++j1) {
        scanf("%d", &v);
        line.push_back(v);
      }
      pic.push_back(line);
    }
    memset(dp, -1, sizeof(dp));
    memset(dis, -1, sizeof(dis));
    for (int i = 0; i < (k); ++i) {
      for (int j = 0; j < (k); ++j) {
        if (i == j) continue;
        dis[i][j] = calc_dis(pic, k, i, j);
      }
    }
    for (int i = 0; i < (k); ++i) {
      dp[(1 << i)][i] = 0;
    }
    for (int i = 0; i < ((1 << k)); ++i) {
      for (int u = 0; u < (k); ++u) {
        if (!(i & (1 << u))) continue;
        if (dp[i][u] == -1) continue;
        for (int v = 0; v < (k); ++v) {
          if ((i & (1 << v))) continue;
          int i1 = i + (1 << v);
          int candi = dp[i][u] + dis[u][v];
          if (dp[i1][v] == -1 || dp[i1][v] > candi) {
            dp[i1][v] = candi;
            opt[i1][v] = u;
          }
        }
      }
    }
    if (k == -1) {
      cout << " Dis:\n";
      for (int i = 0; i < (k); ++i) {
        for (int j = 0; j < (k); ++j) {
          cout << dis[i][j] << " ";
        }
        cout << endl;
      }
    }
    int cur = 0;
    int sta = (1 << k) - 1;
    for (int i = 0; i < (k); ++i) {
      if (dp[sta][i] < dp[sta][cur]) {
        cur = i;
      }
    }
    vector<int> ans, bans;
    ans.push_back(cur + 1);
    for (int i = 0; i < (k - 1); ++i) {
      int next = opt[sta][cur];
      sta -= (1 << cur);
      cur = next;
      ans.push_back(cur + 1);
    }
    for (int i = 0; i < (k); ++i) bans.push_back(0);
    for (int i = 0; i < (k); ++i) {
      bans[ans[i] - 1] = k - i;
    }
    cout << bans[0];
    for (int i = 1; i < (k); ++i) cout << " " << bans[i];
    cout << endl;
  }
  return 0;
}
