#include <bits/stdc++.h>
using namespace std;
#define int long long

struct contest {
	int id, star, sum, blank;
	vector<int> prop;
};


void solve()
{
	int n, m, bound;
	cin >> n >> m >> bound;
	vector<contest> a(n);
	for(int i = 0; i < n; ++i) {
		a[i].id = i;
		cin >> a[i].star;
		for(int j = 0; j < m; ++j) {
			int p;
			cin >> p;
			a[i].prop.emplace_back(p);
			if(p != -1) {
				a[i].sum += p;
			} else {
				++a[i].blank;
			}
		}
	}
	sort(a.begin(), a.end(), [](const contest &x, const contest &y) {
		return x.star < y.star;
	});
	int last = -1, cur = -1;
	for(int i = 0; i < n; ++i) {
		int add = max(0ll, last + 1 - a[i].sum);
		if(add > bound * a[i].blank) {
			cout << "No\n";
			return ;
		}
		a[i].sum += add;

		for(int j = 0; j < m; ++j) {
			if(a[i].prop[j] == -1) {
				a[i].prop[j] = min(bound, add);
				add = max(0ll, add - bound);
			}
		}

		//cur = max(cur, a[i].sum);
		if(i + 1 < n && a[i + 1].star != a[i].star) {
			last = cur;
			//cur = -1;
		}
	}
	cout << "Yes\n";
	sort(a.begin(), a.end(), [](const contest &x, const contest &y) {
		return x.id < y.id;
	});
	for(int i = 0; i < n; ++i)
		for(int j = 0; j < m; ++j)
			cout << a[i].prop[j] << " \n"[j == m - 1];

}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin >> T;
	while(T--) solve();
	return 0;
}