#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int N = 1e6 + 10,M=210;
const int inf=0x3f3f3f3f,mod=998244353;
bool cmp(pair<int,vector<int>>x,pair<int,vector<int>>y)
{
    return x.first<y.first;
}
bool cmp1(pair<int,int>x,pair<int,int>y)
{
    return x.first<y.first;
}
void solve()
{
    int n,m,k;
    cin>>n>>m>>k;
    vector<pair<int,vector<int>>>a(n+1);
    vector<int>X;
    for(int i=1;i<=n;i++)
    {
        int rk;cin>>rk;
        X.push_back(rk);
        a[i].first=rk;
        vector<int>temp;
        for(int j=1;j<=m;j++)
        {
            int x;cin>>x;
            temp.push_back(x);
        }
        a[i].second=temp;
    }
    sort(X.begin(),X.end());
    X.erase(unique(X.begin(),X.end()),X.end());
    vector<pair<int,int>>b(n+1);
    for(int i=1;i<=n;i++)
    {
        a[i].first=lower_bound(X.begin(),X.end(),a[i].first)-X.begin()+1;
        b[i].first=a[i].first;
        b[i].second=i;
    }
    sort(a.begin()+1,a.end(),cmp);
    sort(b.begin()+1,b.end(),cmp1);
    vector<pair<int,int>>s(n+1,{1e18,0});
    for(int i=1;i<=n;i++)
    {
        int sum=0,num=0;
        for(auto x:a[i].second)
        {
            if(x!=-1)sum+=x;
            else num++;
        }
        s[a[i].first].first=min(s[a[i].first].first,sum+num*k);
        s[a[i].first].second=max(a[i].first,sum);
        // cout<<s[i].first<<" "<<s[i].second<<endl;
    }

    int len=X.size();
    // for(int i=1;i<=len;i++)cout<<s[i].first<<" "<<s[i].second<<endl;
    for(int i=len-1;i>=1;i--)
    {
        // cout<<s[i].first<<" "<<s[i].second<<endl;
        if(s[i].second>s[i+1].first-1)
        {
            cout<<"No"<<endl;
            return;
        }
        s[i].first=min(s[i].first,s[i+1].first-1);
    }
    for(int i=1;i<=n;i++)
    {
        int sum=s[a[i].first].first;
        for(auto x:a[i].second)
        {
            if(x!=-1)sum-=x;
        }
        sum=max(0ll,sum);
        for(auto &x:a[i].second)
        {
            if(x!=-1)continue;
            if(sum>=k)
            {
                x=k;
                sum-=k;
            }
            else
            {
                x=sum;
                sum=0;
            }
        }
    }
    vector<pair<int,vector<int>>>ans(n+1);
    for(int i=1;i<=n;i++)
    {
        ans[b[i].second].second=a[b[i].first].second;
    }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++)
    {
        for(auto x:ans[i].second)cout<<x<<" ";
        cout<<endl;
    }

}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}