#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10;
const int INF=1e10;
vector<int> p[N];
int n,m,k,a[N],idx[N],c[N],s[N],ad[N];
bool cmp(int b,int c)
{
    return a[b]<a[c];
}
void solve()
{
    cin>>n>>m>>k;
    for(int i=1;i<=n;++i) p[i]={},idx[i]=i,s[i]=c[i]=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        for(int j=1;j<=m;j++)
        {
            int x;
            cin>>x;
            p[i].push_back(x);
            if(p[i][j]==-1)
            {
                c[i]++;
            }
            else
            {
                s[i]+=p[i][j];
            }
        }
    }
    sort(idx+1,idx+1+n,cmp);
    for(int i=1,x,j,mx=-INF,lst=-INF;i<=n;i=j){
		for(j=i,mx=-INF;j<=n&&a[idx[j]]==a[idx[i]];++j){
			x=idx[j];/*x为j所在的行*/
			ad[x]=min(max(lst+1,s[x]),s[x]+k*c[x]);/*当前行的分数,要么比上一难度分数多1(或者本身就高),(或者全打高分得到的max值判断)*/
			if(ad[x]<=lst) {printf("No\n");return ;}
			mx=max(mx,ad[x]),ad[x]-=s[x];/*更新上限,和未知数的和*/
		}
		lst=mx;
	}
    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;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}