#include <bits/stdc++.h>
#define int long long

using namespace std;
using i64 = long long;

void solve() {
	int n, m, k;
	cin >> n >> m >> k;

	vector<int> s(n);
	vector p(n, vector<int>(m));
	for (int i = 0; i < n; i++) {
		cin >> s[i];
		for (int j = 0; j < m; j++) {
			cin >> p[i][j];
		}
	}

	vector<i64> l(n), r(n);
	for (int i = 0; i < n; i++) {
		int x = 0;
		for (int j = 0; j < m; j++) {
			if (p[i][j] != -1) {
				l[i] += p[i][j];
			} else {
				x += 1;
			}
		}
		r[i] = l[i] + 1LL * x * k;
	}

	vector<int> o(n);
	iota(o.begin(), o.end(), 0);
	sort(o.begin(), o.end(), [&](int i, int j) {
		if (s[i] != s[j]) {
			return s[i] < s[j];
		}
		return r[i] < r[j];
	});

	auto setToZero = [&](int i) {
		for (int j = 0; j < m; j++) {
			if (p[i][j] == -1) {
				p[i][j] = 0;
			}
		}
	};

	i64 lst = l[o[0]];
	int i = 0;
	for ( ; i < n && s[o[i]] == s[o[0]]; i++) {
		setToZero(o[i]);
	}

	i64 mxv = lst;
	int prev = i - 1;
	for (; i < n; i++) {
		if (s[o[i]] != s[o[prev + 1]]) {
			lst = mxv;
			prev = i - 1;
		}
		int t = o[i];
		if (r[t] <= lst) {
			cout << "No\n";
			return;
		}
		if (l[t] > lst) {
			mxv = max(l[t], mxv);
			setToZero(t);
		} else {
			i64 need = lst - l[t] + 1;
			for (int j = 0; j < m; j++) {
				if (p[t][j] == -1) {
					i64 val = min(need, k);
					need -= val;
					p[t][j] = val;
				}
			}
			mxv = max(mxv, lst + 1);
		}
	}

	cout << "Yes\n";
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << p[i][j] << " \n"[j == m - 1];
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t;
	cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}