#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Node{
	ll star;
	ll id;
	vector<ll> p;
	ll sum;
	bool operator<(const Node&a)const{
		return star < a.star;
	}
};

bool cmp(Node a, Node b){
	return a.id < b.id;
}
void slove(){
	ll n, m, k; cin >> n >> m >> k;
	Node a[n + 10];
	for(int i = 1; i <= n; i++){
		a[i].p.push_back(-2);
		cin >> a[i].star;
		for(int j = 1; j <= m; j++){
			ll x; cin >> x;
			a[i].p.push_back(x);
			a[i].id = i;
		}
	}
	sort(a + 1, a + 1 + n);
	//ll sum0 = 0;
	a[1].sum = 0;
	for(int j = 1; j <= m; j++){
		if(a[1].p[j] == -1){
			a[1].p[j] = 0;
		}
		a[1].sum += a[1].p[j];
	}
	bool ans = true;
	for(int i = 2; i <= n; i++){
		a[i].sum = 0;
		for(int j = 1; j <= m; j++){
			if(a[i].p[j] != -1){
				a[i].sum += a[i].p[j];
			}
		}
		ll dsum = a[i - 1].sum - a[i].sum;
		for(int j = 1; j <= m; j++){
			if(a[i].p[j] == -1 && dsum == 0){
				a[i].p[j] = 1;
				a[i].sum += 1;
				break;
			}
			if(a[i].p[j] == -1 && dsum > 0){
				if(dsum < k){
					a[i].p[j] = dsum + 1;
					a[i].sum += dsum + 1; 
					dsum = 0;
					break;
				}
				else{
					a[i].p[j] = k;
					a[i].sum += k;
					dsum -= k;
				}
			}
		}
		if(a[i].sum <= a[i - 1].sum){
			ans = false;
		}
	}
	if(ans == false){
		cout << "No\n";
		return;
	}
	else{
		cout << "Yes\n";
	}
	sort(a + 1, a + 1 + n, cmp);
	for(int i = 1; i <= n; i ++){
		for(auto x : a[i].p){
			if(x == -2){
				continue;
			}
			else if(x != -1){
				cout << x << " ";
			}
			else{
				cout << "0 ";
			}
		}
		cout << "\n";
	}
}
int main(){
	 int t; cin >> t;
	 while(t--){
	 	slove();
	 }
}