#include <bits/stdc++.h>
#define int long long
using namespace std;
const double eps = 1e-8;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<pair<int, int>> a(n + 1);
    vector<vector<int>> g(n + 1 , vector<int>(m + 1));
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].first;
        a[i].second = i;
        for (int j = 1; j <= m; ++j)  cin >> g[i][j];
    }
    sort(a.begin() + 1, a.end(), greater<pair<int, int>>());
    map<int, int> minx;
    minx[0] = 1e16;
    for (int i = 1; i <= n; ++i) {
        int ti = a[i].second;
        int sum = 0, lst = minx[a[i - 1].first];
        for (int j = 1; j <= m; ++j) {
            if(g[ti][j] != -1)  sum += g[ti][j];
        }
        if(sum >= lst) {
            cout << "No\n";
            return ;
        }
        for (int j = 1; j <= m; ++j) {
            if(g[ti][j] == -1) {
                int tmp = min(k, lst - 1 - sum);
                g[ti][j] = tmp;
                sum += tmp;
            }
        }
        if(!minx.count(a[i].first))  minx[a[i].first] = sum;
        else  minx[a[i].first] = min(minx[a[i].first], sum);
    }
    cout << "Yes\n";
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cout << g[i][j] << " \n"[j == m];
        }
    }
}

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