#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;

int testCase;

struct star {
	int val, pos;
	ll sum = 0;
};
bool cmp(const star &a, const star &b) {
	if (a.val == b.val) return a.sum < b.sum;
	return a.val < b.val;
}

void process() {
	int n, m;
	ll k;
	ll preSum = 0;
	cin >> n >> m;
	cin >> k;
	vector<star> s(n);
	vector<vector<ll> > p(n, vector<ll>(m));
	for (int i = 0; i < n; i++) {
		cin >> s[i].val;
		s[i].pos = i;
		for (int j = 0; j < m; j++) {
			cin >> p[i][j];
			if (p[i][j] != -1) s[i].sum += p[i][j];
		}
	}
	sort(s.begin(), s.end(), cmp);
	for (int e = 0; e < n; e++) {
		int i = s[e].pos;
		// cout << s[e].val << " " << s[e].pos << " \n";
		if (e == 0) {
			for (int j = 0; j < m; j++) {
				if (p[i][j] == -1) p[i][j] = 0;
			}
			preSum = s[e].sum;
			// cout << preSum << " \n";
			continue;
		}
		ll needingSum = max(preSum + 1 - s[e].sum, 0LL);
		// cout<<needingSum<<" ";
		for (int j = 0; j < m; j++) {
			if (p[i][j] == -1) {
				p[i][j] = min(k, needingSum);
				needingSum -= k;
				s[e].sum += p[i][j];
			}
			needingSum = max(needingSum, 0LL);
		}
		if (needingSum > 0) {
			cout << "No\n"; return;
		}
		preSum = s[e].sum;
		// cout << preSum << " ";
	}
	cout << "Yes\n";
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) cout << p[i][j] << " ";
		cout << "\n";
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
	freopen("a.inp", "r", stdin);
	freopen("a.out", "w", stdout);
#endif
	cin >> testCase;
	while (testCase--) process();
	return 0;
}