#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;
int n,m,tot;
LL sum[N],sum2[N];
array <int,N> a[N],a_[N];
int h[N];
unordered_map <LL,vct<int>> mp[N];
bool vis[N][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 (1ll*x*A.y==1ll*y*A.x);
    }
};
pair<Num,LL> z[N];
int f[N],f2[N];
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)
            inint(a_[i][j]),sum[i]+=a_[i][j];
    }
    m=n+1;
    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;
    For(i,2,m) For(j,1,n) vis[i][j]=false;
    For(i,1,n) z[i]={{0ll,0ll},0};
    For(i,2,m)
    {
        mp[i].clear();
        For(j,1,n) mp[i][1ll*a[i][j]].pb(j);
    }
    For(i,1,n) For(j,1,n)
    {
        LL x=a[2][j]-a[1][i],y=sum[2];
        exc(x<0ll);
        bool f=true;
        For(k,2,m)
        {
            LL t=x*sum[k];
            exc(t%y);
            t=a[1][i]+t/y;
            if(mp[k][t].empty())
            {
                f=false;
                break;
            }
        }
        exc(!f);
        For(k,2,m)
        {
            LL t=x*sum[k];
            exc(t%y);
            t=a[1][i]+t/y;
            mp[k][t].pop_back();
        }
        z[i]={{x,y},a[1][i]};
    }
    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) printf("%lld,%lld\n",z[i].ft.x,z[i].ft.y);
    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;
}
/*

*/