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

struct EV {
    vector <int> sco;
    int id;
    int star;
    LL tot;
    bool operator < (EV &a) {
        return star < a.star;
    }
};

void solve()
{
    LL n, m, k;
    cin >> n >> m >> k;
    vector <EV> p(n + 1);
    map <int, LL> mxst; 

    for(int i = 1; i <= n; i++) {
        p[i].id = i;
        cin >> p[i].star;
        p[i].sco.resize(m);
        for(int j = 0; j < m; j++) {
            cin >> p[i].sco[j];
            if(p[i].sco[j] > 0) p[i].tot += p[i].sco[j];
        }
        mxst[p[i].star] = max(mxst[p[i].star], p[i].tot);
    }

    sort(p.begin() + 1, p.end());

    LL up = 0;
    mxst[0] = 0;
    for(int i = 1; i <= n; i++) 
    {
        auto it = mxst.lower_bound(p[i].star);
        LL mx, mn;
        mx = (*it).second;
        --it;
        mn = (*it).second + 1;
        if(p[i].tot >= mn) {
            for(auto& c: p[i].sco) {
                if(c == -1) c = 0;
            }
        }
        else {
            LL D = mn - p[i].tot;
            for(auto& c: p[i].sco) {
                if(c == -1) {
                    c = min(D, k);
                    D -= c;
                }
            }
            if(D > 0) {
                cout << "No\n";
                return;
            }
        }
        LL sum = 0;
        for(auto c: p[i].sco) sum += c;
        mxst[p[i].star] = max(mxst[p[i].star], sum);
    }

    auto cmp = [](EV& a, EV& b) -> bool {
        return a.id < b.id;
    };
    sort(p.begin() + 1, p.end(), cmp);
    cout << "Yes\n";
    for(int i = 1; i <= n; i++) {
        for(auto c: p[i].sco) {
            cout << c << ' ';
        }
        cout << '\n';
    }
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) solve();

    return 0;
}