#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
using namespace std;
const int maxn = 400010;
int id[maxn], s[maxn];
bool cmp(int x, int y) { return s[x] < s[y]; }
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector < vector < int > > p(n + 5, vector < int > (m + 5));
    rep(i, 1, n) {
        cin >> s[i];
        rep(j, 1, m) cin >> p[i][j];
        id[i] = i;
    }
    id[n + 1] = 0;
    sort(id + 1, id + 1 + n, cmp);
    vector < pair < int, int > > lines;
    int l = 1, r = 1;
    rep(i, 2, n + 1) {
        if(s[id[i]] == s[id[i - 1]]) r ++;
        else {
            lines.emplace_back(l, r);
            l = r + 1, r ++;
        }
    }
    ll mx = 0;
    // rep(i, 1, n) cout << id[i] << " \n";
    for(auto [x, y] : lines) {
        // cerr << "x : " << x << " y : " << y << " mx : " << mx << endl;
        rep(i, x, y) {
            ll sum = 0;
            rep(j, 1, m) {
                if(p[id[i]][j] != -1) sum += p[id[i]][j];
            }
            if(sum <= mx) {
                ll needs = mx - sum + 1;
                rep(j, 1, m) {
                    if(p[id[i]][j] == -1) {
                        p[id[i]][j] = min(1ll * k, needs);
                        needs -= min(1ll * k, needs);
                    }
                }
                if(needs > 0) {
                    cout << "No\n";
                    return;
                }
            } else {
                rep(j, 1, m) if(p[id[i]][j] == -1) p[id[i]][j] = 0;
            }
        }
        rep(i, x, y) {
            ll sum = 0;
            rep(j, 1, m) sum += p[id[i]][j];
            mx = max(mx, sum);
        }
    }
    cout << "Yes\n";
    rep(i, 1, n) rep(j, 1, m) cout << p[i][j] << " \n"[j == m];
}
int main() {
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T --) solve();
    return 0;
}