#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n, m;
  IN(n, m);
  vector x(m, pair(INT64_C(0), vector<int64_t>(n)));
  for (int t : Rep(0, m)) {
    for (int i : Rep(0, n)) {
      IN(x[t].second[i]);
      x[t].first += x[t].second[i];
    }
  }
  ranges::sort(x);

  for (int i : Rep(0, n)) {
    for (int j : Rep(0, n)) {
      bool ok = true;
      int64_t t1 = x[1].first - x[0].first;
      int64_t x1 = x[1].second[j] - x[0].second[i];
      for (int t : Rep(2, m)) {
        int64_t t2 = x[t].first - x[0].first;
        int64_t x2 = x[t].second[j] - x[0].second[i];
        if (t1 * x2 != t2 * x1) {
          ok = false;
          break;
        }
      }
      if (ok) {
        OUT2(j + 1, " \n"[i + 1 == n]);
      }
    }
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  IN(t);
  while (t--) {
    Solve();
  }
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define IN(...) cin >> forward_as_tuple(__VA_ARGS__)
#define OUT2(...) [&](auto&&... xs) { (cout << ... << xs); }(__VA_ARGS__)

#endif  // __INCLUDE_LEVEL__ == 1