#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k,m;
struct com{
    int r;
    ll low,high;int id;
    com(){r=low=high=id=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 q,com qq){
    if(q.r!=qq.r) return q.r<qq.r;
    else{
        return q.low<qq.low;
    }
}
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;
            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);
    ans[a[1].id]=a[1].low;
    for(int i=2;i<=n;i++){
        if(a[i].high <= ans[a[i-1].id]){
            cout<<"No"<<endl;
            return;
        }
        else{
            if(a[i].r!=a[i-1].r) ans[a[i].id]=max(a[i].low , ans[a[i-1].id]+1);
            else ans[a[i].id]=max(a[i].low,ans[a[i-1].id]);
        }
    }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++){
        ans[i]-=sum[i];
        for(int j=0;j<m;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;
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(nullptr);
    int _;cin>>_;while(_--)__();    
    return 0;
}