#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k,m;
struct com{
    int r,id;
    ll low,high;
    com(){r=low=high=0;}
    com(int a,ll b,ll c,int d){
        r=a,low=b,high=c;id=d;
    }
}a[400005];
vector<ll> p[400005];
int rank1[400005];
ll sum[400005];
bool cmp(com a,com b){
    return a.r>b.r;
}
ll ans[400005];
void __(){
    cin>>n>>m>>k;
    ll x,maxx;
    for(int i=1;i<=n;i++){
        p[i].clear();
        ans[i]=0;
        a[i]=com();
    }
    for(int i=1;i<=n;i++){
        cin>>rank1[i];sum[i]=0;maxx=0;
        for(int j=1;j<=m;j++){
            cin>>x;//sum+=x;
            if(x==-1) maxx+=k;
            else sum[i]+=x,maxx+=x;
            p[i].push_back(x);
        }
        a[i]=com(rank1[i],sum[i],maxx,i);
    }
    sort(a+1,a+1+n,cmp);
    //for(int i=1;i<=n;i++){
    //    cout<<a[i].r<<" "<<a[i].low<<" "<<a[i].high<<endl;
    //}
    //cout<<"*"<<endl;
    ans[a[1].id]=a[1].high;
    for(int i=2;i<=n;i++){
        //cout<<i<<" "<<a[i].id<<" "<<a[i].low<<" "<<a[i].high<<endl;
        if(a[i].low >= ans[a[i-1].id]){
            cout<<"No"<<endl;return;
        }
        else{
            ans[a[i].id]=min(a[i].high , ans[a[i-1].id]-1);
        }
    }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++){
        ans[i]-=sum[i];
        for(int j=0;j<p[i].size();j++){
            if(p[i][j]!=-1) cout<<p[i][j]<<" ";
            else{
                if(ans[i]>=k) cout<<k<<" ";
                else cout<<ans[i]<<" ";
                ans[i]=max(ans[i]-k,0ll);
            }
        }
        cout<<endl;
    }
    //cout<<endl;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(nullptr);
    int _;cin>>_;while(_--)__();    
    return 0;
}