#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct node
{
    ll s;
    ll sum;
    ll index;
    ll cnt;
};
bool cmp(struct node a, struct node b)
{
    if (a.s == b.s)
        return a.sum < b.sum;
    else
        return a.s < b.s;
}
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t;
    cin >> t;
    while (t--)
    {
        ll f = 1;
        ll n, m, k;
        cin >> n >> m >> k;
        struct node a[n + 3];
        ll g[n + 3][m + 3];
        for (ll i = 1; i <= n; i++)
        {
            cin >> a[i].s;
            ll sum = 0;
            ll cnt = 0;
            for (ll j = 1; j <= m; j++)
            {
                cin >> g[i][j];
                if (g[i][j] == -1)
                    cnt++;
                else
                    sum += g[i][j];
            }
            a[i].sum = sum;
            a[i].index = i;
            a[i].cnt = cnt;
        }
        sort(a + 1, a + n + 1, cmp);
        ll maxx = a[1].sum;
        ll pre = -1;
        for (ll i = 1; i <= m; i++)
        {
            if (g[a[1].index][i] == -1)
                g[a[1].index][i] = 0;
        }
        for (ll i = 2; i <= n; i++)
        {
            if (a[i].s == a[i - 1].s)
            {
                maxx = max(maxx, a[i].sum);
                if (a[i].sum > pre)
                {
                    for (ll j = 1; j <= m; j++)
                    {
                        if (g[a[i].index][j] == -1)
                            g[a[i].index][j] = 0;
                    }
                }
                else
                {
                    ll need = pre - a[i].sum + 1;
                    if (a[i].cnt * k < need)
                    {
                        f = 0;
                        break;
                    }
                    else
                    {
                        ll flag = 1;
                        for (ll j = 1; j <= m; j++)
                        {
                            if (g[a[i].index][j] == -1)
                            {
                                if (!flag)
                                {
                                    g[a[i].index][j] = 0;
                                }
                                else
                                {
                                    if (need >= k)
                                    {
                                        need -= k;
                                        g[a[i].index][j] = k;
                                    }
                                    else
                                    {
                                        g[a[i].index][j] = need;
                                        need = 0;
                                    }
                                    if (!need)
                                        flag = 0;
                                }
                            }
                        }
                    }
                }
                for (ll j = 1; j <= m; j++)
                {
                    if (g[a[i].index][j] == -1)
                        g[a[i].index][j] = 0;
                }
            }
            else
            {
                pre=maxx;
                if (a[i].sum > maxx)
                {
                    maxx = a[i].sum;
                    for (ll j = 1; j <= m; j++)
                    {
                        if (g[a[i].index][j] == -1)
                            g[a[i].index][j] = 0;
                    }
                }
                else
                {
                    ll need = maxx - a[i].sum + 1;
                    if (a[i].cnt * k < need)
                    {
                        f = 0;
                        break;
                    }
                    else
                    {
                        ll flag = 1;
                        for (ll j = 1; j <= m; j++)
                        {
                            if (g[a[i].index][j] == -1)
                            {
                                if (!flag)
                                {
                                    g[a[i].index][j] = 0;
                                }
                                else
                                {
                                    if (need >= k)
                                    {
                                        need -= k;
                                        g[a[i].index][j] = k;
                                    }
                                    else
                                    {
                                        g[a[i].index][j] = need;
                                        need = 0;
                                    }
                                    if (!need)
                                        flag = 0;
                                }
                            }
                        }
                        maxx = maxx + 1;
                    }
                }
            }
        }
        if (!f)
            cout << "No\n";
        else
        {
            cout << "Yes\n";
            for (ll i = 1; i <= n; i++)
            {
                for (ll j = 1; j <= m; j++)
                    cout << g[i][j] << ' ';
                cout << '\n';
            }
        }
    }
}