#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return 1ll * a * b / gcd(a, b); }
ll divCeil(ll x, ll y) { return x / y + (x % y != 0); }
const int MAXN = 2e5 + 5;
const double pi = 3.14159265358979323846;
const ll inf = 1e18;
double eps = 1e-9;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
#define endl "\n"
#define int long long
void solve1() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<pair<int, int>>s(n + 5);
    vector<vector<int>>p(n + 5, vector<int>(m + 5));
    for (int i = 1; i <= n; i++) {
        int st;
        cin >> st;
        s[i] = { st,i };
        for (int j = 1; j <= m; j++)cin >> p[i][j];
    }
    sort(s.begin() + 1, s.begin() + 1 + n);
    int lst = 0;
    int vs = 0;
    p[0][m + 1] = -1;
    for (int i = 1; i <= n; i++) {
        auto X = s[i];
        auto x = s[i].first;
        int id = s[i].second;
        int f = (vs != x);
        int mn = 0;
        int mx = 0;
        int cnt = 0;
        int sum = 0;
        for (int j = 1; j <= m; j++) {
            cnt += (p[id][j] == -1);
            sum += (p[id][j] == -1 ? 0 : p[id][j]);
        }
        mx = sum + cnt * k;
        mn = sum;
        if (vs != x && mx <= p[lst][m + 1]) {
            cout << "No" << endl;
            return;
        }
        int d = 0;
        if (mn < p[lst][m + 1] + 1) {
            d = p[lst][m + 1] - mn + 1;
        }
        p[id][m + 1] = sum + d;
        for (int j = 1; j <= m; j++) {
            if (p[id][j] == -1) {
                p[id][j] = min({ d,k });
                d -= min({ d,k });
            }
        }
        if (vs == x) {
            if (p[id][m + 1] > p[lst][m + 1])
                lst = id;
        }
        else lst = id;
        vs = x;

    }
    cout << "Yes" << endl;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++)cout << p[i][j] << " ";
        cout << endl;
    }
    return;
}
void solve(int t) {
    int n, m, k;
    int f = 0;
    if (t == 11)f = 1;
    cin >> n >> m >> k;
    if (f) {
        cout << n << " " << m << " " << k << endl;
    }
    vector<pair<int, int>>s(n + 5);
    vector<vector<int>>p(n + 5, vector<int>(m + 5));
    for (int i = 1; i <= n; i++) {
        int st;
        cin >> st;
        if (f)cout << st << " ";
        s[i] = { st,i };
        for (int j = 1; j <= m; j++) {
            cin >> p[i][j];
            if (f)cout << p[i][j] << " ";
        }
        if (f)cout << endl;
    }

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