#include <stdio.h>
#include <string.h>
#include <assert.h>

#include <vector>
#include <numeric>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long LL;
constexpr int N = 1000005;

void solve() {
	int n, m, K;
	scanf("%d%d%d", &n, &m, &K);
	vector<vector<int>> a(n, vector<int>(m));
	vector<int> ord(n), b(n);
	for (int i = 0; i < n; ++i) {
		scanf("%d", &b[i]);
		for (int j = 0; j < m; ++j) {
			scanf("%d", &a[i][j]);
		}
	}
	iota(ord.begin(), ord.end(), 0);
	sort(ord.begin(), ord.end(), [&](int x, int y) {
		return b[x] < b[y];
	});
	LL last = -1;
	for (int i = 0; i < n; ++i) {
		if (i == 0 || b[ord[i]] != b[ord[i - 1]]) {
			last += 1;
		}
		auto &v = a[ord[i]];
		LL sum = 0;
		for (int i = 0; i < m; ++i) {
			if (~v[i]) {
				sum += v[i];
			}
		}
		for (int i = 0; i < m; ++i) {
			if (~v[i]) {
				continue;
			}
			LL t = last - sum;
			if (t < 0) {
				t = 0;
			}
			if (t > K) {
				t = K;
			}
			sum += t;
			v[i] = t;
		}
		if (sum < last) {
			puts("No");
			return;
		}
		last = sum;
	}
	puts("Yes");
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			printf("%d ", a[i][j]);
		}
		puts("");
	}
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		solve();
	}
	return 0;
}