#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        ll k;
        cin>>n>>m>>k;
        vector<int>s(n);
        vector<vector<int>>p(n,vector<int>(m));
        for(int i=0;i<n;i++)
        {
            cin>>s[i];
            for(int j=0;j<m;j++)
                cin>>p[i][j];
        }
        vector<int>id(n);
        for(int i=0;i<n;i++)
            id[i]=i;
        sort(id.begin(),id.end(),[&](int x,int y){
            return s[x]>s[y];
        });
        bool ok=true;
        ll mx=1e18;
        for(int i=0;i<n;)
        {
            int j=i;
            while(j<n-1&&s[id[j+1]]==s[id[i]])
                j++;
            ll new_mx=mx;
            for(;i<=j;i++)
            {
                int x=id[i];
                ll sum=0,cnt=0;
                for(int l=0;l<m;l++)
                    if(p[x][l]!=-1)sum+=p[x][l];
                    else cnt++;
                if(sum>=mx)
                {
                    ok=false;
                    break;
                }
                ll tar=min(mx-sum-1,cnt*k);
                new_mx=min(new_mx,sum+tar);
                for(int l=0;l<m;l++)
                {
                    if(p[x][l]!=-1)continue;
                    ll cur=min(tar,k);
                    p[x][l]=cur;
                    tar-=cur;
                }
            }
            mx=new_mx;
        }
        if(!ok)
        {
            cout<<"No"<<endl;
            continue;
        }
        cout<<"Yes"<<endl;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
                cout<<p[i][j]<<" ";
            cout<<endl;
        }
    }
    return 0;
}