#include<bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
const int N=4e5+100,INF=1e18;
#define gc getchar()
#define rd read()
inline int read(){
	int x=0,f=0; char c=gc;
	for(;c<'0'||c>'9';c=gc) f|=(c=='-');
	for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

int n,m,k,a[N],idx[N],c[N],s[N],ad[N];
vector<int> p[N];

void solve(){
	n=rd,m=rd,k=rd;
	for(int i=1;i<=n;++i) p[i]={},s[i]=c[i]=0;
	for(int i=1;i<=n;++i) for(int j=0,x;j<m;++j) p[i].pb(x=rd),s[i]+=(x!=-1?x:0),c[i]+=(x==-1);
	for(int i=1;i<=n;++i) a[i]=rd,idx[i]=i;
	sort(idx+1,idx+n+1,[&](int x,int y){ return a[x]<a[y]; });
	for(int i=1,x,lst=-INF;i<=n;++i){
		x=idx[i];
		ad[x]=min(max(lst+1,s[x]),s[x]+k*c[x]);
		if(ad[x]<=lst) return printf("No\n"),void();
		lst=ad[x],ad[x]-=s[x];
	}
	printf("Yes\n");
	for(int i=1;i<=n;++i){
		for(int j=0;j<m;++j){
			if(p[i][j]==-1) p[i][j]=min(k,ad[i]),ad[i]-=p[i][j];
			printf("%lld ", p[i][j]);
		}
		puts("");
	}
}

signed main(){

	int T=rd;
	while(T--) solve();

	return 0;
}