#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e5 + 10;
struct node
{
    int lev;
    int sum;
    int num;
    vector<int> vct;
    int ind;
} a[N];
bool cmp1(node a, node b)
{
    if (a.lev == b.lev)
        return a.sum < b.sum;
    return a.lev < b.lev;
}
bool cmp2(node a, node b)
{
    return a.ind < b.ind;
}
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++)
    {
        a[i].vct.clear();
        a[i].num = 0;
        a[i].sum = 0;
        cin >> a[i].lev;
        a[i].ind = i;
        int t = 0;
        for (int j = 1; j <= m; j++)
        {
            cin >> t;
            a[i].sum += t;
            if (t == -1)
                a[i].num++;
            a[i].vct.push_back(t);
        }
        a[i].sum += a[i].num;
    }
    sort(a + 1, a + 1 + n, cmp1);
    a[0].lev = a[1].lev;
    int last = 0;
    for (int i = 1; i <= n; i++)
    {
        if (a[i].lev != a[i - 1].lev)
        {
            last++;
        }
        if (a[i].sum < last)
        {
            int temp = last - a[i].sum;
            for (auto it : a[i].vct)
            {
                if (it == -1)
                {
                    it = min(k, temp);
                    temp -= it;
                }
            }
            if (temp)
            {
                cout << "No" << endl;
                return;
            }
        }
        else
        {
            last = max(a[i].sum, last);
        }
    }
    sort(a + 1, a + 1 + n, cmp2);
    cout << "Yes" << endl;
    for (int i = 1; i <= n; i++)
    {
        for (auto it : a[i].vct)
            cout << (it == -1 ? 0 : it) << " ";
        cout << endl;
    }
}

signed main()
{
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
}