#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define maxn 400005
#define inf 2000000000
vector<ll>vt[maxn], ans[maxn];
struct P {
    ll x, i;
    bool operator < (P b) {
        return x > b.x;
    }
}p[maxn];
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        vt[i].clear();
        ans[i].resize(m);
    }
    for (int i = 1; i <= n; i++) {
        cin >> p[i].x;
        p[i].i = i;
        for (int j = 1; j <= m; j++) {
            int x;
            cin >> x;
            vt[i].push_back(x);
        }
    }
    sort(p + 1, p + 1 + n);
    ll minv = 1e18;
    bool f = 0;
    for (int i = 1; i <= n; i++) {
        bool flag = 0;
        if (i > 1 && p[i].x == p[i - 1].x) {
            flag = 1;
        }
        if (!flag) {
            ll sum = 0;
            for (int j = 0; j < m; j++) {
                if (vt[p[i].i][j] == -1) {
                    continue;
                }
                else {
                    ans[p[i].i][j] = vt[p[i].i][j];
                    sum += vt[p[i].i][j];
                }
            }
            if (sum >= minv) {
                f = 1;
            }
            for (int j = 0; j < m; j++) {
                if (vt[p[i].i][j] == -1) {
                    if (sum + k < minv) {
                        sum += k;
                        ans[p[i].i][j] = k;
                    }
                    else {
                        ans[p[i].i][j] = minv - sum - 1;
                        sum = minv - 1;
                    }
                }
            }
            minv = sum;
        }
        else {
            ll sum = 0;
            for (int j = 0; j < m; j++) {
                if (vt[p[i].i][j] == -1) {
                    continue;
                }
                else {
                    ans[p[i].i][j] = vt[p[i].i][j];
                    sum += vt[p[i].i][j];
                }
            }
            for (int j = 0; j < m; j++) {
                if (vt[p[i].i][j] == -1) {
                    if (sum + k <= minv) {
                        sum += k;
                        ans[p[i].i][j] = k;
                    }
                    else {
                        ans[p[i].i][j] =max(0ll, minv - sum);
                        sum = minv;
                    }
                }
            }
            minv = sum;
        }
    }
    if (f) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < m; j++) {
            cout << ans[i][j] << " ";
        }
        cout << endl;
    }
}

signed main()
{
    int t;
    cin.tie(0)->sync_with_stdio(false);
    cin >> t;
    while (t--)
        solve();
    return 0;
}