#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 1e6 + 10, M = 5010, MOD = 998244353;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m, k;

struct p
{
    LL s, cnt, sum, num;
    vector<int> t;
    bool operator< (const p &p) const
    {
        return s < p.s;
    }
};

void solve() 
{
    cin >> n >> m >> k;
    vector<p> a(n);
    for(int i = 0; i < n; i ++)
    {
        cin >> a[i].s;
        a[i].num = i;
        vector<int> t;
        for(int j = 0; j < m; j ++)
        {
            int x;
            cin >> x;
            t.pb(x);
            if(~x) a[i].sum += x;
            else a[i].cnt ++;
        }
        a[i].t = t;
    }

    sort(a.begin(), a.end());
    // for(int i = 0; i < n; i ++) cout << a[i].num << " ";
    // cout << endl;
    LL pre = 0, mx1 = 0, mx2 = 0;
    vector<vector<int>> res(n);
    for(int i = 0; i < n; i ++)
    {
        auto [s, cnt, sum, num, g] = a[i];
        // cout << s << " " << endl;
        if(s == pre)
        {
            if(sum > mx2)
            {
                while(cnt -- ) res[i].pb(0);
                mx1 = max(mx1, sum);
            }
            else 
            {
                if(cnt * k + sum <= mx2)
                {
                    cout << "No" << endl;
                    return;
                }
                for(int j = 0; j < (mx2 - sum) / k; j ++) res[i].pb(k), cnt --;
                res[i].pb((mx2 - sum) % k + 1), cnt --;
                while(cnt --) res[i].pb(0);
                mx1 = max(mx1, mx2 + 1);
            }
        }
        else 
        {
            if(sum > mx1)
            {
                while(cnt --) res[i].pb(0);
                mx2 = mx1, mx1 = sum;
            }
            else
            {
                if(cnt * k + sum <= mx1)
                {
                    cout << "No" << endl;
                    return;
                }
                for(int j = 0; j < (mx1 - sum) / k; j ++) res[i].pb(k), cnt --;
                res[i].pb((mx1 - sum) % k + 1), cnt --;
                while(cnt --) res[i].pb(0);
                mx2 = mx1, mx1 ++;
            }
        }
        // cout << pre << " " << mx1 << " " << mx2 << endl;
        pre = s;
    }

    map<int, int> mp;
    for(int i = 0; i < n; i ++) mp[a[i].num] = i;

    cout << "Yes" << endl;
    for(int t = 0; t < n; t ++)
    {
        int i = mp[t];
        int idx = 0;
        for(int j = 0; j < m; j ++) 
        {
            if(a[i].t[j]  != -1) cout << a[i].t[j]  << " ";
            else
            {
                cout << res[i][idx ++] << " ";
            }
        }
        cout << endl;
    }
}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}