#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;
#define li long long
#define pb push_back
#define mp make_pair
#define y1 y12345678909
#define rii register int
#define pii pair<int,int>
#define r(x) scanf("%d",&x)
#define ck(x) cout<<x<<endl;
#define uli unsigned long long
#define clr(x) memset(x,0,sizeof(x))
#define sp cout<<"------------------------------------------------------"<<endl
int g[222],nxt[222][222],pre[222][222],belong[222],T,used[222],n,m,back[222];
inline void del(int x,int y){if(g[x]==y)g[x]=nxt[x][y];else {nxt[x][pre[x][y]]=nxt[x][y];pre[x][nxt[x][y]]=pre[x][y];}return;
}
inline bool work(int x,int lit){for(rii i=g[x];i;i=nxt[x][i])if(used[i]!=T){used[i]=T;if(!belong[i]||(belong[i]>lit&&work(belong[i],lit))){belong[i]=x;back[x]=i;return 1;}}return 0;
}
inline void go(){for(rii i=1;i<=n;++i){T++;work(i,0);}for(rii j=1;j<=n;++j){T++;for(rii k=g[j];k;k=nxt[j][k]){if(belong[k]==j)break;if(belong[k]<j)continue;int x=belong[k],y=back[j];belong[back[j]]=0;back[belong[k]]=0;belong[k]=j;back[j]=k;if(work(x,j))break;back[x]=k;belong[k]=x;belong[y]=j;back[j]=y;}}return;
}
int main(){int i,j,k,t,x;r(t);while(t--){r(n),r(m);clr(pre),clr(nxt);for(rii i=1;i<=n;++i){g[i]=1;int now=1;for(rii j=2;j<=n;++j){nxt[i][now]=j;pre[i][j]=now;now=j;}}for(rii i=1;i<=m;++i)for(rii j=1;j<=n;++j){r(x);del(j,x);}ck(n-m);for(rii i=m+1;i<=n;++i){T=0;clr(back);clr(belong);clr(used);go();for(rii j=1;j<=n;++j)del(j,back[j]);for(rii j=1;j<=n;++j)printf("%d ",back[j]);puts("");}}return 0;
}