#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
//#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define TEXT freopen("azerah.in","r",stdin); freopen("azerah.out","w",stdout);
#define testcase int TT; cin >> TT; for (int tc = 1; tc <= TT; tc++)
#define POL(i,n) for (int i = 0 ; i < n ; ++i)
#define pb push_back
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define F first
#define S second
//#define endl "\n"
typedef pair<int,int>PL;



void solve()
{
    ll n,m,k;
    cin >> n >> m >> k;
    vector<pair<pair<ll,vector<ll>>,ll>>v;

    for(ll i=1; i<=n; i++)
    {
        ll s;
        cin >> s;
        vector<ll>vk;
        for(ll j=1; j<=m; j++)
        {
            ll ij;
            cin >> ij;
            vk.pb(ij);
        }
        v.pb({{s,vk},i});
    }

    sort(v.begin(),v.end());
    vector<pair<ll,vector<ll>>>ans;

    ll mx=0;

    for(ll i=0; i<n; i++)
    {
        vector<ll>vt=v[i].first.second;
        vector<ll>res;
        ll sm=0;

        if(i==0)
        {
            for(auto it:vt)
            {
               if(it==-1)
               {
                   res.pb(0);
               }
               else
               {
                   res.pb(it);
                   sm+=it;
               }
            }
        }
        else
        {
            for(auto it:vt)
            {
                if(it!=-1)
                {
                    sm+=it;
                }
            }
            for(auto it:vt)
            {
                if(it==-1)
                {
                    if(sm>mx)
                    {
                        res.pb(0);
                    }
                    else
                    {
                        ll mn=min(k,mx-sm+1);
                        res.pb(mn);
                        sm+=mn;
                    }
                }
                else
                {
                    res.pb(it);
                }
            }
        }
        ans.pb({v[i].second,res});
        if(i!=0 && v[i].first.first>v[i-1].first.first && sm<=mx)
        {
            cout << "No" << endl;
            return;
        }
        mx=max(mx,sm);
    }
    cout << "Yes" << endl;

    sort(ans.begin(),ans.end());

    for(auto it:ans)
    {
        vector<ll>dk=it.second;

        for(auto ik:dk)
        {
            cout << ik << " ";
        }
        cout << endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    testcase
    {
        solve();
    }

    return 0;
}