#include<bits/stdc++.h>
#define ll long long
#define F(x,y,z) for(int x=(y);x<=(z);x++)
using namespace std;
const int N=4e5+10;
int n,m,k;
int vid[N];
struct node{
    int s;
    int id;
    vector <int> v;
}a[N];
int cnt[N];
bool cmp(node x,node y){
    return x.s>y.s;
}
map <int,int> mp;
void solve(){
    mp.clear();
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        cnt[i]=0;
        a[i].v.clear();
    }
    int u;
    for(int i=1;i<=n;i++){
        cin>>a[i].s;
        a[i].id=i;
        for(int j=1;j<=m;j++){
            cin>>u;
            a[i].v.push_back(u);
        }
    }
    sort(a+1,a+1+n,cmp);
    a[0].s=-1;
    ll sum=0,minn,lstmax=1e18,totmax=1e18;
    for(int i=1;i<=n;i++){
        vid[a[i].id]=i;
        sum=0;minn=0;
        for(auto y:a[i].v){
            if(y!=-1) sum+=y,minn+=y,cnt[i]+=y;
            else sum+=k;
        }
        if(minn>=lstmax){
            cout<<"No"<<endl;
            return;
        }
        totmax=min(totmax,min(lstmax-1,sum));
        if(a[i].s!=a[i-1].s){
            mp[a[i].s]=totmax;
            lstmax=totmax,totmax=1e18;
            // cout<<a[i].s<<' '<<mp[a[i].s]<<endl;
        }
    }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++){
        int id=vid[i];
        int rest=mp[a[id].s];
        rest-=cnt[id];
        for(auto y:a[id].v){
            if(y!=-1) cout<<y<<' ';
            else{
                if(rest<=0) cout<<0<<' ';
                else
                    if(rest>=k){
                        cout<<k<<' ';
                        rest-=k;
                    } 
                    else{
                        cout<<rest<<' ';
                        rest=0;
                    }
            }
        }
        cout<<endl;
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;
    cin>>T;
    while(T--) solve();
    return 0;
}