#include <bits/stdc++.h>
#define endl '\n'
#define mk make_pair
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 2e6+7;
int n, m, k, x;

struct node{
    int s=0,sum=0,max1=0,num1=0,p;
    vector<int>v;
};

int cmp1(node a,node b){
    return a.p<b.p;
}

int cmp2(node a,node b){
    return a.s==b.s?a.sum<b.sum:a.s>b.s;
}

void sovle()
{
    cin>>n>>m>>k;
    node a[n+5];
    map<int,int>maxs,minm,u;
    for(int i=1;i<=n;i++){
        cin>>a[i].s;
        for(int j=1;j<=m;j++){
            cin>>x;
            if(x==-1) a[i].num1++;
            else{
                a[i].sum+=x;
            }
            a[i].v.push_back(x);
        }
        a[i].max1=a[i].sum+a[i].num1*k;
        a[i].p=i;
        if(maxs.count(a[i].s)) maxs[a[i].s]=max(maxs[a[i].s],a[i].sum);
        else maxs[a[i].s]=a[i].sum;
        if(minm.count(a[i].s)) minm[a[i].s]=min(minm[a[i].s],a[i].max1);
        else minm[a[i].s]=a[i].max1;
    }
    sort(a+1,a+n+1,cmp2);
    u[a[1].s]=minm[a[1].s];
    for(int i=1;i<=n;i++){
        if(maxs[a[i].s]>minm[a[i].s]){
            cout<<"No"<<endl;
            return;
        }
        if(i>=2&&a[i].s!=a[i-1].s){
            if(maxs[a[i].s]>=u[a[i-1].s]){
                cout<<"No"<<endl;
                return;
            }
            u[a[i].s]=min(minm[a[i].s],u[a[i-1].s]-1);
        }
    }
    sort(a+1,a+n+1,cmp1);
    for(int i=1;i<=n;i++){
        int ko=u[a[i].s]-a[i].sum;
        for(int j=0;j<m;j++){
            if(a[i].v[j]!=-1) continue;
            if(ko){
                a[i].v[j]=min(k,ko);
                ko=max(0ll,ko-k);
            }else a[i].v[j]=0;
        }
        if(ko){
            cout<<"No"<<endl;
            return;
        }
    }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++){
        for(int j=0;j<m;j++){
            cout<<a[i].v[j]<<' ';
        }cout<<endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        sovle();
    }

    return 0;
}