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

const int N = 1e5+5;

struct NODE
{
	int s;
	vector<int> a;
	int sum = 0;
	int cnt = 0;
	int index;
}node[N];

bool cmp(NODE aa,NODE bb){return aa.s<bb.s;}
bool cmp1(NODE aa,NODE bb){return aa.index<bb.index;}

bool check(int n,int k)
{
	int begin = 1;
	for(int i = 1;i<=n;i++)
	{
		if(node[i].cnt == 0)
		{
			if(node[i].sum < i-begin+node[begin].sum)
			{
				return false;
			}
			else
			{
				begin = i;
			}
		}
		if((node[i].sum + node[i].cnt*k )<(i-begin+node[begin].sum))
		{
			return false;
		}
	}
	return true;
}

void solve()
{
	int n,m,k;cin>>n>>m>>k;
	for(int i = 1;i<=n;i++)
	{
		cin>>node[i].s;
		node[i].index = i;
		for(int j = 1;j<=m;j++)
		{
			int tmp;cin>>tmp;
			if(tmp == -1)
			{
				node[i].cnt ++;
			}
			else
			{
				node[i].sum += tmp;
			}
            node[i].a.push_back(tmp);
		}
	}
	
	sort(node+1,node+1+n,cmp);

	if(check(n,k) == false)
	{
		cout<<"No"<<endl;
		return ;
	}
	else
	{
		for(int i = 1;i<=n;i++)
		{
			if(node[i].cnt == 0) continue;
			if(i == 1)
			{
				for(int j = 0;j<m;j++)
				{
					if(node[i].a[j] == -1)
					{
						node[i].a[j] = 0;
					}
				}
			}
			else
			{
				int cha = node[1].sum+i-1-node[i].sum;
				if(cha % node[i].cnt == 0)
				{
					for(int j = 0;j<m;j++)
					{
						if(node[i].a[j] == -1)
						{
							node[i].a[j] = cha/node[i].cnt;
						}
					}
				}
				else
				{
					int count = 0;
					int tmp = cha/node[i].cnt;
					for(int j = 0;j<m;j++)
					{
						if(node[i].a[j] == -1)
						{
							node[i].a[j] = tmp;
							count ++;
							if(count == node[i].cnt-1)
							{
								tmp += cha%node[i].cnt;
							}
						}
					}
				}
			}
		}
		
		sort(node+1,node+1+n,cmp1);
        cout<<"Yes"<<endl;
		for(int i = 1;i<=n;i++)
		{
			for(int j = 0;j<m;j++)
			{
				cout<<node[i].a[j]<<" ";
			}
			cout<<endl;
		}

        for(int i = 1;i<=n;i++) {node[i].a.clear();node[i].cnt = 0;node[i].sum = 0;}
		return;
		
	}
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--) solve();
}