#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define pb push_back
#define it per[cs[cr]]
using namespace std;
int rdn()
{int ret=0;bool fx=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')fx=0;ch=getchar();}while(ch>='0'&&ch<='9')ret=ret*10+ch-'0',ch=getchar();return fx?ret:-ret;
}
const int N=205,M=15;
int n,m,s[N]; bool vis[N];
int a[N][N][M],len[N][N];
struct Gra{int b[N],c[N],cs[N];vector<int> per[N];bool xyl(int cr,int nw){for(int i=1,v;i<=len[cr][nw];i++)if(!vis[v=a[cr][nw][i]]){vis[v]=1;if(b[v]){if(cs[cr]){b[cs[cr]]++;//
        it.erase(remove(it.begin(),it.end(),cr));//
          }b[v]--;per[v].pb(cr);cs[cr]=v; c[cr]=nw; return true;}for(int j=0,lm=per[v].size();j<lm;j++)if(xyl(per[v][j],c[per[v][j]])){if(cs[cr]){b[cs[cr]]++;it.erase(remove(it.begin(),it.end(),cr));//
        }b[v]--;per[v].pb(cr);cs[cr]=v; c[cr]=nw; return true;}}return false;}void solve(int cr){for(int i=1,lm;i<=m;i++)if(len[cr][i]){memset(vis,0,sizeof vis);if(xyl(cr,i))break;}if(!c[cr])c[cr]=m+1;}
}g[N],f;
bool chk(int cr,int mid)
{f=g[cr-mid-1];for(int i=1;i<=s[cr];i++){memset(vis,0,sizeof vis);//
      if(f.xyl(cr,i))return true;}return false;
}
int main()
{int T=rdn(),C=rdn();while(T--){memset(len,0,sizeof len);n=rdn();m=rdn();for(int i=1;i<=m;i++)g[0].b[i]=rdn();for(int i=1,d;i<=n;i++)for(int j=1;j<=m;j++){d=rdn();if(d)a[i][d][++len[i][d]]=j;}for(int i=1;i<=n;i++)s[i]=rdn();for(int i=1;i<=n;i++){ g[i]=g[i-1]; g[i].solve(i);}for(int i=1;i<=n;i++)printf("%d ",g[i].c[i]);puts("");for(int i=1;i<=n;i++){if(g[i].c[i]<=s[i]){printf("0 ");continue;}int l=1,r=i-1,ret=i;while(l<=r){int mid=l+r>>1;if(chk(i,mid))ret=mid,r=mid-1;else l=mid+1;}printf("%d ",ret);}puts("");}return 0;
}