#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int>PII;
const int N=1e6+10;
const ll MX=1e9+10;
ll n,m,k;
struct MS{
    ll id,sum,cnt,s;
}a[N];
bool cmp(MS a,MS b){
    return a.s>b.s;
}

void solve(){
    cin>>n>>m>>k;
    vector<ll>v1[n+10];
    for(int i=1;i<=n;i++){
        ll s,sum=0,cnt=0;
        cin>>s;
        for(int j=1;j<=m;j++){
            ll s1;
            cin>>s1;
            v1[i].push_back(s1);
            if(s1>=0){
                sum+=s1;
            }else{
                cnt++;
            }
        }
        a[i]={i,sum,cnt,s};
    }
    sort(a+1,a+1+n,cmp);
    a[n+1]={MX,MX,MX,0};
    /*
    map<ll,ll>mp;
    ll l=0,r=1e18+10;
    ll last=r;
    bool f=false;
    for(int i=1;i<=n+1;i++){
        if(a[i].s!=a[i-1].s&&i!=1){
            if(l>=r) 
            {
                f=true;
                break;
            }
            mp[a[i-1].s]=r;
            r--;
            l=a[i].sum;
            r=min(r,a[i].sum+k*a[i].cnt);
            //cout<<l<<" "<<r<<endl;
            if(l>r&&i!=n+1){
                //cout<<i<<endl;
                f=true;
                break;
            }
        }else{
            l=max(l,a[i].sum);
            r=min(r,a[i].sum+a[i].cnt*k);
        }
    }
    if(f){
        cout<<"No"<<endl;
        return;
    }
    cout<<"Yes"<<endl;
    vector<ll>v[n+10];
    for(int i=1;i<=n;i++){
        ll id=a[i].id;
        ll sum=max(0ll,mp[a[i].s]-a[i].sum);
        for(int j=0;j<m;j++){
            if(v1[id][j]!=-1){
                v[id].push_back(v1[id][j]);
            }else{
                ll t=min(sum,k);
                v[id].push_back(t);
                sum-=t;
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<m;j++){
            cout<<v[i][j]<<" ";
        }
        cout<<endl;
    } */
    bool f=false;
    map<ll,ll>mp;
    mp[0]=1e18+10;
    for(int i=1;i<=n;i++){
        int j=i+1;
        ll l=a[i].sum;
        ll r=a[i].sum+a[i].cnt*k;
        while(a[j].s==a[i].s){
            l=max(l,a[j].sum);
            r=min(r,a[i].sum+a[i].cnt*k);
            j++;
        }
        j--;
        if(l>=mp[a[i-1].s]){
            f=true;
            break;
        }
        mp[a[j].s]=min(mp[a[i-1].s]-1,r);
        i=j;
    }
    if(f){
        cout<<"No"<<endl;
        return;
    }
    vector<ll>v[n+10];
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++){
        ll id=a[i].id;
        ll sum=max(mp[a[i].s]-a[i].sum,0ll);
        for(int j=0;j<m;j++){
            if(v1[id][j]==-1){
                ll t=min(sum,k);
                v[id].push_back(t);
                sum-=t;
            }else{
                v[id].push_back(v1[id][j]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<m;j++){
            cout<<v[i][j]<<" ";
        }
        cout<<endl;
    }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}