#include <bits/stdc++.h>

#define int long long
#define Task "data"

using namespace std;

const int N = 4e5 + 9;

struct Element{
    int val;
    int idx;
};


int t, n, m , k;
Element s[N];
int sum[N];
int p[N];
int maxArr[N];

bool cmp(Element &a, Element &b)
{
    return a.val < b.val;
}

signed main()
{
    cin.tie(NULL)->sync_with_stdio(false);

    //freopen(Task".inp", "r", stdin);
    //freopen(Task".out", "w", stdout);

    cin >> t;
    while (t--)
    {
        cin >> n >> m >> k;
        for (int i = 0; i < n; i++)
        {
            int tmp;
            cin >> tmp;
            s[i] = {tmp, i};
            sum[i] = 0;
            for (int j = 0; j < m; j++)
            {
                cin >> p[m*i + j];
                sum[i] += (p[m*i + j] != -1 ? p[m*i + j] : 0);
            }
        }
        sort (s, s + n, cmp);

        int maxPrevSum = -1;
        int prevStar = -1;
        bool canComplete = 1;

        for (int e = 0; e < n; e++)
        {
            int i = s[e].idx;
            if (prevStar != s[e].val && e != 0)
            {
                maxPrevSum = maxArr[e - 1];
            }
            int add = (maxPrevSum >= sum[i] ? maxPrevSum - sum[i] + 1 : 0);

            for (int j = 0; j < m; j++)
            {
                if (p[m*i + j] == -1)
                {
                    int tmp = min(k, add);
                    p[m*i + j] = tmp;
                    sum[i] += tmp;
                    add -= tmp;
                }
            }

            if (sum[i] <= maxPrevSum)
            {
                cout << "No\n";
                canComplete = 0;
                break;
            }


            prevStar = s[e].val;
            maxArr[e] = (e == 0 ? sum[i] : max(sum[i], maxArr[e - 1]));
        }

        if (canComplete)
        {
            cout << "Yes\n";
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < m; j++)
                {
                    cout << p[m*i + j] << ' ';
                }
                cout << '\n';
            }
        }
    }

    return 0;
}