#include<cmath>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
const int N=210;
inline int read(){int X=0,w=1;char ch=0;while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}while(ch>='0'&&ch<='9')X=(X<<1)+(X<<3)+ch-'0',ch=getchar();return X*w;
}
int n,m,b[N],bb[N],s[N];
int ds[N],zy[N],dds[N],zzy[N];
int a[N][N][11],len[N][N];
bool vis[N];
bool dfs(int k,int w){for(int j=1;j<=len[k][w];j++){int u=a[k][w][j];if(vis[u])continue;vis[u]=1;if(b[u]){ds[k]=u;zy[k]=w;b[u]--;return 1;}else{for(int l=1;l<=n;l++){//这里debug 3h+才发现。 if(l==k)continue;if(ds[l]==u){if(dfs(l,zy[l])){ds[k]=u;zy[k]=w;return 1;}}}}}return 0;
}
inline void copy(int k){for(int i=1;i<=m;i++)b[i]=bb[i];for(int i=1;i<=k;i++){ds[i]=dds[i];zy[i]=zzy[i];b[ds[i]]--;}for(int i=k+1;i<=n;i++)ds[i]=-1;return;
}
inline void work2(){for(int i=1;i<=n;i++){if(zzy[i]<=s[i])printf("0 ");else{int l=1,r=i-1,ans=0;while(l<=r){int mid=(l+r)>>1;bool ok=0;copy(mid-1);memset(vis,0,sizeof(vis));for(int j=1;j<=s[i];j++){if(dfs(i,j)){ans=mid;l=mid+1;ok=1;break;}}if(!ok)r=mid-1;}printf("%d ",i-ans);}}puts("");
}
inline void work1(){for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));for(int j=1;j<=m;j++){if(!len[i][j])continue;if(dfs(i,j))break;}}for(int i=1;i<=n;i++){zzy[i]=zy[i];dds[i]=ds[i];printf("%d ",zy[i]);}puts("");
}
inline void init(){n=read(),m=read();memset(len,0,sizeof(len));for(int i=1;i<=m;i++)bb[i]=b[i]=read();for(int i=1;i<=n;i++){zy[i]=m+1;ds[i]=-1;for(int j=1;j<=m;j++){int k=read();if(k)a[i][k][++len[i][k]]=j;}}for(int i=1;i<=n;i++)s[i]=read();
}
int main(){int t=read(),c=read();while(t--){init();work1();work2();}return 0;
}