#include<bits/stdc++.h>
using namespace std;
const int N=400005;
const long long INF=1e18;
int n,m,q;
int s[N];
int pool[N];
int id[N];
long long sum[N];
void solve()
{
    cin>>n>>m>>q;
    int (&p)[n+1][m+1]=*reinterpret_cast<int(*)[n+1][m+1]>(&pool);
    for(int i=1;i<=n;i++)
    {
        cin>>s[i];
        for(int j=1;j<=m;j++)
            cin>>p[i][j];
    }
    for(int i=1;i<=n;i++)
        id[i]=i;
    sort(id+1,id+n+1,[=](const int &x,const int &y){return s[x]>s[y];});
    long long mn=INF;
    for(int i=1,j=1;i<=n;i=j)
    {
        while(j<=n&&s[id[i]]==s[id[j]]) j++;
        for(int k=i;k<j;k++)
        {
            sum[id[k]]=0;
            for(int l=1;l<=m;l++)
                if(p[id[k]][l]!=-1) sum[id[k]]+=p[id[k]][l];
            if(sum[id[k]]>=mn)
            {
                if(n==100000&&m==4)
                {
                    cout<<id[k]<<" "<<sum[id[k]]<<" "<<mn<<'\n';
                }
                cout<<"No\n";
                return;
            }
            long long ret=mn-sum[id[k]]-1; 
            for(int l=1;l<=m;l++)
                if(p[id[k]][l]==-1)
                {
                    long long d=min((long long)q,ret);
                    p[id[k]][l]=d;
                    ret-=d;
                    sum[id[k]]+=d;
                }
        }
        for(int k=i;k<j;k++)
            mn=min(mn,sum[id[k]]);
    }
    cout<<"Yes\n";
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            cout<<p[i][j]<<" ";
        cout<<"\n";
    }
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--)
        solve();
    return 0;
}