#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#define I inline
#define int long long
using namespace std;

const int N = 400010;
struct node {
	vector<int> a;
	int v,id;
	int dn,up,fi,sm;
}a[N];
int n,m,k;

I bool cmp(node n1,node n2) {
	return n1.v<n2.v;
}
I bool cmp2(node n1,node n2) {
	return n1.id<n2.id;
}
I void out(node x) {
	int rev=x.fi-x.sm;
	//cout<<"!!"<<rev<<' '<<x.fi<<endl;
	for(auto &t:x.a) {
		if(t==-1) {
			if(rev>=k) {
				rev-=k;
				cout<<k<<' ';
			} else if(rev) {
				cout<<rev<<' ';
				rev=0;
			} else {
				cout<<0<<' ';
			}
		} else cout<<t<<' ';
	} cout<<endl;
}
I void solve() {
	cin>>n>>m>>k;
	for(int i=1;i<=n;++i) a[i].a.clear(),a[i].up=a[i].dn=a[i].sm=a[i].fi=0;
	for(int i=1;i<=n;++i) {
		cin>>a[i].v;
		a[i].id=i;
		int sum=0,cnt=0;
		for(int j=1;j<=m;++j) {
			int x; cin>>x;
			a[i].a.push_back(x);
			if(x==-1) cnt++;
			else sum+=x;
		}
		a[i].sm=sum;
		a[i].dn=sum;
		a[i].up=sum+cnt*k;
	}
	sort(a+1,a+1+n,cmp);
	int mn=1,nv=0,can=1;
	
	for(int i=1;i<=n;++i) {
		if(a[i].v!=nv) {
			for(int j=i-1;j>=1;--j) {
				if(a[j].v==nv) mn=max(mn,a[j].fi+1);
				else break; 
			}
			nv=a[i].v;
		}
		if(a[i].up<max(mn,a[i].dn)) {
			can=0;
			break;
		}
		a[i].fi=max(mn,a[i].dn);
	}
	if(!can) {
		cout<<"No"<<endl;
		return ;
	}
	cout<<"Yes"<<endl;
	sort(a+1,a+1+n,cmp2);
	for(int i=1;i<=n;++i) {
		out(a[i]);
	}
}
signed main()
{
	int T; cin>>T;
	while(T--) {
		solve();
	}
}