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

//  The 2024 ICPC Kunming Invitational Contest

void sol(){
    int n, m, k; 
    std::cin>>n>>m>>k;

    std::vector V(n + 1, std::vector<int>(m + 1));
    std::vector info(n + 1, std::array<int, 4>{0, 0, 0, 0});

    for(int i = 1; i <= n;i++){
        std::cin>>info[i][0];
        info[i][3] = i;
        for(int j = 1;j <= m;j++){
            std::cin>>V[i][j];
            if(V[i][j] == -1) {
                info[i][2] += 1;
            }else{
                info[i][1] += V[i][j];
            }
        }
    }

    std::sort(info.begin(), info.end());
    std::vector<int>vi(n + 1, -1);
    for(int i = 1;i <= n;i++){
        int j = i, cV = -1, Mn = 0;
        while(j <= n && info[j][0] == info[i][0]){
            Mn = std::max(Mn, info[i][1]);
            if(info[i][2] == 0){
                if(cV == -1){
                    cV = info[i][1];
                    if(cV <= vi[i - 1]) {
                        std::cout<<"NO\n";
                        return ;
                    }
                }else{
                    if(cV != info[i][1]){
                        std::cout<<"NO\n";
                        return ;
                    }
                }
            }
            j++;
        }

        Mn = std::max(Mn, vi[i - 1] + 1);
        //  确保cV > vi[i - 1]
        if(cV == -1){
            //  取Mn为s[i]的最小值.
            for(int u = i;u < j;u++){
                vi[u] = Mn;
                if(info[u][1] + info[u][2] * k < Mn){
                    std::cout<<"NO\n";
                    return ;
                }
                int cur = info[u][1], ii = info[u][3];
                for(int v = 1;v <= m;v++){
                    if(V[ii][v] == -1){
                        if(Mn - cur >= k){
                            cur = cur + k;
                            V[ii][v] = k;
                        }else{
                            V[ii][v] = Mn - cur;
                            cur = Mn;
                        }
                    }
                }
            }
        }else{
            if(Mn > cV){
                std::cout<<"NO\n";
                return ;
            }
            for(int u = i;u < j;u++){
                vi[u] = cV;
                if(info[u][1] + info[u][2] * k < cV){
                    std::cout<<"NO\n";
                    return ;
                }
                int cur = info[u][1], ii = info[u][3];
                for(int v = 1;v <= m;v++){
                    if(V[ii][v] == -1){
                        if(cV - cur >= k){
                            V[ii][v] = k;
                            cur = cur + k;
                        }else{
                            V[ii][v] = cV - cur;
                            cur = cV;
                        }
                    }
                }
            }
        }
        i = j - 1;
    }

    std::cout<<"Yes\n";
    for(int i = 1;i<=n;i++){
        for(int j = 1;j <= m;j++){
            std::cout<<V[i][j]<<" \n"[j == m];
        }
    }
}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1; std::cin>>t;
    while(t--) sol();  
    return 0;
}