#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
#define endl '\n'
const int N=2e5+10;
const double eps=1e-9;
struct node
{
	ll x,sum,id,l,r;
}b[N];
bool cmp(node x,node y)
{
	return x.x>y.x;
}
void solve()
{
	ll n,m,k;
	cin>>n>>m>>k;
	map<ll,ll> mp;
	vector<vector<ll>> a(n+1,vector<ll>(m+10,0));
	for(int i=1;i<=n;i++)
	{
		ll s;
		cin>>s;
		mp[s]++;
		b[i].id=i,b[i].x=s;
		ll sum=0,cnt=0;
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
			if(a[i][j]!=-1) sum+=a[i][j];
			else cnt++;
		}
		b[i].l=sum;
		b[i].r=sum+cnt*k;
	}
	sort(b+1,b+1+n,cmp);
	ll maxx=1e18;
	map<ll,ll> mmp;
	for(int i=1;i<=n;i+=mp[b[i].x])
	{
		ll c=mp[b[i].x];
		ll mx=maxx,mn=0;
		for(int j=i;j<=i+c-1;j++)
		{
			if(b[j].r<mn||b[j].l>mx)
			{
				cout<<"No"<<endl;
				return;
			}
			mx=min(mx,b[j].r);
			mn=max(mn,b[j].l);
			if(mn>mx) 
			{
				cout<<"No"<<endl;
				return;
			}
		}
		maxx=mx-1;
		mmp[b[i].x]=mx;
	}
	for(int i=1;i<=n;i++)
	{
		ll id=b[i].id;
		ll x=mmp[b[i].x];
		ll ssm=0;
		for(int j=1;j<=m;j++)
		{
			if(a[id][j]!=-1) ssm+=a[id][j];
		}
		x-=ssm;
		for(int j=1;j<=m;j++)
		{
			if(a[id][j]==-1)
			{
				if(!x) a[id][j]=0;
				if(x<k)
				{
					a[id][j]=x;
					x-=x;
				}
				else if(x>=k)
				{
					a[id][j]=k;
					x-=k;
				}
			}
		}
	}
	cout<<"Yes"<<endl;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cout<<a[i][j]<<' ';
		}
		cout<<endl;
	}
	return;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int _=1;
	cin>>_;
	while(_--)
	{
		solve();	
	}	
	return 0;
}