#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << x << '\n';

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;

template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
	for (T& x : v) {
		is >> x;
	}
	return is;
}

template <typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
	for (int i = 0; i < (int)v.size(); i++) {
		os << v[i] << (i + 1 != v.size() ? " " : "");
	}
	return os;
}


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

	sort(all(a));
	int last = -1;
	int pos = n;
	int mn = a[0].first;
	for (int u = 0; u < n; u++) {
		auto [s, i] = a[u];
		if (s != mn) {
			pos = u;
			break;
		}
		int sum = 0;
		for (int j = 0; j < m; j++) {
			if (p[i][j] == -1) p[i][j] = 0;
			sum += p[i][j];
		}
		last = max(last, sum);
	}

	// debug(last);
	// debug(pos);

	int cur = last;
	int last_s = 0;
	if (pos >= 0 && pos < n) {
		last_s = a[pos].first;
	}
	for (int u = pos; u < n; u++) {
		auto [s, i] = a[u];
		if (s != last_s) {
			last = cur;
			last_s = s;
			cur = last + 1;
		}
		int sum = 0, cnt = 0;
 		for (int j = 0; j < m; j++) {
			sum += (p[i][j] == -1 ? 0 : p[i][j]);
			cnt += (p[i][j] == -1);
		}
		if (sum > last) {
			cur = max(cur, sum);
			for (int j = 0; j < m; j++) {
				if (p[i][j] == -1) p[i][j] = 0;
			}
		} else {
			cur = last + 1;
			int diff = last + 1 - sum;
			// debug(last);
			// debug(diff);
			if (cnt * k < diff) {
				cout << "No\n";
				return;
			}

			for (int j = 0; j < m; j++) {
				if (p[i][j] == -1) {
					if (diff >= k) p[i][j] = k;
					else p[i][j] = max(diff, 0LL);
					diff -= k;
				}
			}
		}
	}

	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() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	//std::cout << std::fixed << std::setprecision(10);

	int T = 1;
	std::cin >> T;
	while (T--) {
		solve();
	}

	return 0;
}