#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
using namespace std;
typedef long long ll;
template<class T>il void rd(T &x){char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);
}
template<class T>il void output(T x){if(x/10)output(x/10);putchar(x%10+'0');}
template<class T>il void ot(T x){if(x<0) putchar('-'),x=-x;output(x);putchar(' ');}
template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}namespace Miracle{
const int N=201;
int n,m,C;
int vis[N];
int con[N][N];
int to[N][N][N],cnt[N][N];
int b[N],mem[N][N],p[N];//teacher
int s[N];
int c[N];//ans1
struct node{int mem[N][N],p[N];
}tim[N];
bool dfs(int x,int d,int st){for(reg i=1;i<=cnt[x][d];++i){int y=to[x][d][i];if(vis[y]==st) continue;vis[y]=st;if(p[y]<b[y]){mem[y][++p[y]]=x;return true;}else{for(reg j=1;j<=b[y];++j){if(dfs(mem[y][j],c[mem[y][j]],st)){mem[y][j]=x;return true;}}}}return false;
}
void wrk1(){for(reg i=1;i<=n;++i){c[i]=m+1;memset(vis,0,sizeof vis);for(reg j=1;j<=m;++j){if(cnt[i][j]==0) continue;if(dfs(i,j,j)){c[i]=j;break;}}memcpy(tim[i].mem,mem,sizeof mem);memcpy(tim[i].p,p,sizeof p);}
}
bool fin(int x,int d,int t,int st){for(reg i=1;i<=cnt[x][d];++i){int y=to[x][d][i];if(vis[y]==st) continue;vis[y]=st;if(tim[t].p[y]<b[y]){return true;}else{for(reg j=1;j<=b[y];++j){if(fin(tim[t].mem[y][j],c[tim[t].mem[y][j]],t,st)){return true;}}}}return false;
}
bool che(int x,int t){memset(vis,0,sizeof vis);for(reg j=1;j<=s[x];++j){if(cnt[x][j]==0) continue;if(fin(x,j,t,j)) return true;}return false;
}
int ans[N];
void wrk2(){for(reg i=1;i<=n;++i){if(c[i]<=s[i]) {ans[i]=0;continue;}int l=0,r=i-2;int ok=-1;while(l<=r){int mid=(l+r)/2;if(che(i,mid)){ok=mid;l=mid+1;}else r=mid-1;}ans[i]=i-ok-1;}
}
void clear(){memset(ans,0,sizeof ans);memset(cnt,0,sizeof cnt);memset(p,0,sizeof p);
}
int main(){int t;rd(t);rd(C);    while(t--){clear();rd(n);rd(m);for(reg i=1;i<=m;++i) rd(b[i]);for(reg i=1;i<=n;++i){for(reg j=1;j<=m;++j){rd(con[i][j]);to[i][con[i][j]][++cnt[i][con[i][j]]]=j;}}for(reg i=1;i<=n;++i){rd(s[i]);}wrk1();
//        cout<<"hahaha "<<endl;for(reg i=1;i<=n;++i){printf("%d ",c[i]);}puts("");wrk2();for(reg i=1;i<=n;++i){printf("%d ",ans[i]);}puts("");
//        cout<<" hahaah"<<endl;
    }return 0;
}}
signed main(){Miracle::main();return 0;
}/*Author: *Miracle*Date: 2019/3/25 17:52:55
*/