#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

void solve() {
  int n, m;
  cin >> n >> m;

  constexpr int INF = 1e7;

  vector<int> a1(n + 1, 0);
  vector<ll> sum(m + 1, 0);
  for (int i = 1; i <= n; ++i) {
    cin >> a1[i];
    sum[1] += a1[i];
  }

  vector<int> tmp(n, 0);
  for (int i = 0; i < n; ++i) {
    cin >> tmp[i];
    sum[2] += tmp[i];
  }

   while (sum[2] == sum[1]);

  vector<vector<int>> s(n + 1);
  vector<vector<int>> s2(n + 1);

  for (int i = 1; i <= n; ++i) {
    s[i] = tmp;
  }


  for (int i = 3; i <= m; ++i) {
    unordered_set<int> s3;

    for (int j = 1; j <= n; ++j) {
      int x;
      cin >> x;
      s3.insert(x);
      sum[i] += x;
    }

    for (int j = 1; j <= n; ++j) {
      for (auto a2 : s[j]) {
        // (a3 - a1) / (a2 - a1) = (sum[i] - sum[1]) / (sum[i - 1] - sum[1])
        // (a3 - a1) = (a2 - a1) * (sum[i] - sum[1]) / (sum[i - 1] - sum[1])
        // a3 = (a2 - a1) * (sum[i] - sum[1]) / (sum[i - 1] - sum[1]) + a1
        if (1LL * (a2 - a1[j]) * (sum[i] - sum[1]) % (sum[2] - sum[1]))
          continue;

        auto a3 = 1LL * (a2 - a1[j]) * (sum[i] - sum[1]) / (sum[2] - sum[1]) + a1[j];

        if (a3 >= INF || a3 <= -INF)
          continue;

        if (s3.count(a3)) {
          s2[j].push_back(a2);
        }
      }

      swap(s2[j], s[j]);
      s2[j].clear();
    }
  }

  vector<pair<int, int>> vit;
  for (int i = 1; i <= n; ++i) {
    //assert(s[i].size() == 1);
    vit.push_back({s[i][0] - a1[i], i});
  }

  sort(vit.begin(), vit.end());

  vector<int> ans(n + 1, 0);
  for (int i = 0; i < vit.size(); ++i) {
    ans[vit[i].second] = i + 1;
  }

  for (int i = 1; i <= n; ++i)
    cout << ans[i] << " ";
  cout << "\n";
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}