#include <bits/stdc++.h>
// #include <windows.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int> 
#define pli pair<LL,int> 
#define vct vector 
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
// cLL mod[2]={1686688681ll,1666888681ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
int rnd(int l,int r) { return rd()%(r-l+1)+l; }
void main_init()
{
}
cint N=510,L=N*N*N;
int n,m,tot,hav;
LL sum[N],sum2[N];
array <LL,N> a[N],a_[N];
int h[N];
struct Num
{
    int x,y;
    short i,j,k;
    bool operator < (const Num &A) const
    {
        if(y==A.y) return x<A.x;
        return (1ll*x*A.y<1ll*y*A.x);
    }
    bool operator == (const Num &A) const
    {
        return (x==A.x&&y==A.y);
    }
}c[L];
bool vis[N][N],vis2[N];
pair<Num,LL> z[N];
int f[N],f2[N];
vct <pii> d[N];
void work(int l,int r)
{
    vct<int> h;
    // printf("[%d,%d]\n",l,r);
    For(t,l,r)
    {
        auto [x,y,i,j,k]=c[t];
        // printf("%d,%d,%d,%d,%d\n",x,y,i,j,k);
        d[k].pb({i,j});
        h.pb(k);
    }
    for(auto k:h)
    {
        if(sz(d[k])<m-1)
        {
            d[k].clear();
            continue;
        }
        int cnt=0;
        for(auto [i,j]:d[k])
            if((!vis[i][j])&&(!vis2[i]))
                cnt++,vis2[i]=true;
        // printf("cnt=%d\n",cnt);
        if(cnt==m-1)
        {
            hav++;
            z[k]={{c[l].x,c[l].y},a[1][k]};
            for(auto [i,j]:d[k])
                if(vis2[i]&&(!vis[i][j]))
                {
                    // printf("%d,%d\n",i,j);
                    vis[i][j]=true,vis2[i]=false;
                }
        }
        for(auto [i,j]:d[k])
            vis2[i]=false;
        d[k].clear();
    }
}
unordered_set <LL> st;
void main_solve()
{
    inpr(n,m);
    if(n==1)
    {
        For(i,1,m) For(j,1,n) { int t; inint(t); };
        outint(1);
        return ;
    }
    For(i,1,m)
    {
        sum[i]=0ll,h[i]=i;
        For(j,1,n)
            inll(a_[i][j]),sum[i]+=a_[i][j];
    }
    bool ck=true;
    For(i,2,m) For(j,1,n) ck&=(a_[i][j]==a_[i-1][j]);
    if(ck)
    {
        For(i,1,n) outint_(i);
        return ;
    }
    sort(h+2,h+m+1,[&](cint &w1,cint &w2)->bool{return sum[w1]<sum[w2];});
    For(i,1,m) For(j,1,n) a[i][j]=a_[h[i]][j];
    For(i,1,m) sum2[i]=sum[h[i]];
    For(i,1,m) swap(sum[i],sum2[i]);
    For(i,2,m) sum[i]-=sum[1]; sum[1]=0ll;
    tot=0;
    st.clear();
    For(i,2,2) For(j,1,n) For(k,1,n)
    {
        if(a[i][j]>=a[1][k])
        {
            LL x=a[i][j]-a[1][k],y=sum[i],g=__gcd(x,y);
            if(g) x/=g,y/=g;
            st.insert(x<<25|y);
        }
    }
    For(i,2,m) For(j,1,n) For(k,1,n)
    {
        if(a[i][j]>=a[1][k])
        {
            LL x=a[i][j]-a[1][k],y=sum[i],g=__gcd(x,y);
            if(g) x/=g,y/=g;
            if(st.count(x<<25|y));
                c[++tot]={x,y,i,j,k};
        }
    }
    For(i,2,m) For(j,1,n) vis[i][j]=false;
    sort(c+1,c+tot+1);
    For(i,1,n) z[i]={{0ll,0ll},0};
    /*For(t,1,tot)
    {
        auto [x,y,i,j,k]=c[t];
        printf("%lld,%lld %d,%d,%d\n",x,y,i,j,k);
    }*/
    vct <pii> range;
    for(int l=1,r;l<=tot;l=r+1)
    {
        r=l; while(r<tot&&c[r+1]==c[r]) r++;
        exc(r-l+1<m-1);
        range.pb({l,r});
    }
    // sort(all(range),[&](const pii &w1,const pii &w2)->bool{return (w1.sc-w1.ft<w2.sc-w2.ft);});
    hav=0;
    for(auto [l,r]:range)
    {
        stop(hav==n);
        work(l,r);
    }
    // For(i,1,n)
    // {
    //     if(!z[i].ft.y)
    //         while(true);
    // }
    // For(i,1,n) printf("%lld,%lld,%lld\n",z[i].ft.x,z[i].ft.y,z[i].sc);
    For(i,1,n) f[i]=i;
    sort(f+1,f+n+1,[&](cint &w1,cint &w2)->bool{return z[w1]<z[w2];});
    For(i,1,n) f2[f[i]]=i;
    For(i,1,n) outint_(f2[i]);
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/