#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
mt19937 ggen;
int h, w, k;
int a[700][700];
int st[20];
int en[20];
int nxt[20];
int pre[20];
long long grad(int r1, int r2) {
  long long res = 0;
  int r = 2;
  for (int i = r; i < w - r; i++) {
    long long s1 = 0;
    long long s2 = 0;
    for (int jj = r1 - r; jj <= r1; jj++)
      for (int ii = i - r; ii <= i + 1; ii++)
        if (abs(i - ii) + abs(jj - r1) <= r) s1 += a[jj][ii];
    for (int jj = r2 + r; jj >= r2; jj--)
      for (int ii = i - r; ii <= i + 1; ii++)
        if (abs(i - ii) + abs(jj - r2) <= r) s2 += a[jj][ii];
    res += (((long long)(s1 - s2)) * ((long long)(s1 - s2)));
  }
  return res;
}
int u[20];
int ans[20];
long long calc(int start) {
  int cur = start;
  memset(u, 0, sizeof u);
  for (int i = 0; i < k - 1; i++) {
    u[cur] = 1;
    long long mn = ((long long)(1e18));
    long long mnv = 0;
    for (int j = 0; j < k; j++) {
      if (u[j]) continue;
      int r1 = h / k * j;
      long long val = grad(en[cur], st[j]);
      if (val < mn) {
        mn = val;
        mnv = j;
      }
    }
    nxt[cur] = mnv;
    cur = mnv;
  }
  cur = start;
  vector<int> cyc;
  for (int j = 0; j < k; j++) {
    cyc.push_back(cur);
    cur = nxt[cur];
  }
  long long res = 0;
  for (int j = 0; j < k - 1; j++) {
    res += grad(en[cyc[j]], st[cyc[j + 1]]);
  }
  for (int j = 0; j < k; j++) {
    ans[cyc[j]] = j + 1;
  }
  return res;
}
void solve() {
  scanf("%d%d%d", &h, &w, &k);
  for (int i = 0; i < h; i++)
    for (int j = 0; j < w; j++) scanf("%d", &a[i][j]);
  for (int i = 0; i < k; i++) {
    st[i] = h / k * i;
    en[i] = h / k * (i + 1) - 1;
  }
  long long mn = ((long long)(1e18));
  int mnv;
  for (int i = 0; i < k; i++) {
    long long val = calc(i);
    if (val < mn) {
      mn = val;
      mnv = i;
    }
  }
  calc(mnv);
  for (int i = 0; i < k; i++) cout << ans[i] << ' ';
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  srand(1313);
  ggen = mt19937(13);
  int ts;
  scanf("%d", &ts);
  for (int i = 0; i < ts; i++) solve();
  return 0;
}
