//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define i128 __int128
#define db long double
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
//const int N=;
//const int M=;
//const int inf=(int)1e9;
//const ll INF=(ll)1e18;
int T, n;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    return x*f;
}
void solve() {
	int n, m ,k;
	cin >> n >> m >> k;
	vector<vector<int>> a(n + 1, vector<int>(m + 1));
	vector<pair<int, int>> s(n + 1);
	for(int i = 1; i <= n; i++){
		cin >> s[i].first;
		s[i].second = i;
		for(int j = 1; j <= m; j++) cin >> a[i][j];
	}
	sort(s.begin() + 1, s.end());
	int last = -1, same = 0;
	for(int p = 1; p <= n; p++) {
		int i = s[p].second;
		if(p > 1 && s[p].second != s[p - 1].second) {
			assert(same > last);
			last = same;
			same = 0;
		}
		int sum = 0;
		for(int j = 1; j <= m; j++) {
			if(a[i][j] == -1) continue;
			sum += a[i][j];
		}
		int need = last + 1;
		for(int j= 1; j <= m; j++) {
			if(a[i][j] == -1){
				a[i][j] = min(k, max(0LL, need - sum));
				sum += a[i][j];
			} 
		}
		if(sum < need) {
			cout << "No\n";
			return;			
		}
		same = max(same, sum);
//		last = {max(sum, lastsum), s[p].first};
	}
	cout << "Yes\n";
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) cout << a[i][j] << ' ';
		cout << '\n';
	}
}
signed main()
{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	int T;
	cin >> T;
	while(T--) solve(); 
	return 0;
}