#include<bits/stdc++.h>
#define int long long 
#define endl '\n'
using namespace std;
void solve()
{
    int n,m,k;
    cin>>n>>m>>k;
    vector<pair<int,vector<int>>> a(n+1);
    vector<pair<int,int>> b(n+1);
    vector<int> X;
    for(int i=1;i<=n;i++)
    {
        vector<int> tmp;
        int rk;cin>>rk;
        X.push_back(rk);
        a[i].first=rk;
        for(int j=1;j<=m;j++)
        {
            int x;cin>>x;
            tmp.push_back(x);
        }
        a[i].second=tmp;
    }
    sort(X.begin(),X.end());
    X.erase(unique(X.begin(),X.end()),X.end());
    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(),greater<>());
    sort(b.begin()+1,b.end(),greater<>());
    vector<pair<int,int>> s(n+1,{0,1e18});
    for(int i=1;i<=n;i++)
    {
        int sum=0,num=0;
        for(auto x:a[i].second)
        {
            if(x==-1) num++;
            else sum+=x; 
        }
        s[a[i].first].first=max(s[a[i].first].first,sum);
        s[a[i].first].second=min(s[a[i].first].second,sum+num*k);
    }
    // for(int i=1;i<=n;i++) cout<<s[i].first<<' '<<s[i].second<<endl;
    int len=X.size();
    for(int i=len-1;i>=1;i--)
    {
        if(s[i].first>s[i+1].second-1){cout<<"No\n";return;}
        s[i].second=min(s[i].second,s[i+1].second-1);
    }
    
    // for(int i=1;i<=n;i++) cout<<s[i].first<<' '<<s[i].second<<endl;
    for(int i=1;i<=n;i++)
    {
        int num=s[a[i].first].second;
        for(auto x:a[i].second)
            if(x!=-1) num-=x;
        for(auto &x:a[i].second)
        {
            if(x==-1)
            {
                if(num>=k)
                {
                    num-=k;
                    x=k;
                }
                else
                {
                    x=num;
                    num=0;
                }
            }
        }
    }
    cout<<"Yes\n";
    vector<vector<int>> ans(n+1);
    for(int i=1;i<=n;i++)
    {
        vector<int> tmp=a[i].second;
        ans[b[i].second]=tmp;
    }
    for(int i=1;i<=n;i++)
    {
        for(auto x:ans[i]) cout<<x<<' ';
        cout<<endl;
    }
}
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t=1;cin>>t;
    while(t--) solve();
    return 0;
}