#include<iostream>
#include<vector>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<numeric>//iota -- iota(all(a), x) a从头到尾从x开始递增
#include<cstring>
#include<ctime>
#include<array>
#include<list> 
#include<random>
#include<tuple>
#include<deque>
#include<map>
#include<stack>
#include<set>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define lowbit(x) (x & (-x))
const int xy[][2] = { 0,1, 0, -1, 1, 0, -1, 0 };
#define mem(a, x) memset(a, x, sizeof a)
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<char, char> PCC;
typedef pair<int, char> PIC;
typedef pair<char, int> PCI;
#define x first
#define y second
#define NO cout << "NO\n"
#define YES cout << "YES\n"
#define Yes cout << "Yes\n"
#define No cout << "No\n"
inline int read();
const int INF = 1e9, N = 1e4 + 10, MOD = 998244353, M = 1e4 + 10, K = 1331;
const double PI = acos(-1.0);
struct Node {
    vector<int>a, vis;
};
void solve() {
    int n, m, k; cin >> n >> m >> k;
    vector<Node>g(n + 2);
    vector<int>s(n + 2);
    for (int i = 1; i <= n; i++) {
        int sum = 0;
        for (int j = 0; j <= m; j++) {
            int x; cin >> x;
            g[i].a.pb(x);
            if (j)sum += max(0ll, x);
            if (j && x == -1)g[i].vis.pb(j);
        }
        g[i].a.pb(sum);
        s[i] = i;
    }
    auto cmp = [&](int x, int y) -> bool {
        return g[x].a[0] > g[y].a[0];
        };
    sort(s.begin() + 1, s.begin() + 1 + n, cmp);
    for (int t = 1; t <= n; t++) {
        int i = s[t];
        if (t == 1) {
            for (auto j : g[i].vis)g[i].a[j] = k, g[i].a[m + 1] += k;
            continue;
        }
        if (g[i].a[m + 1] >= g[s[t - 1]].a[m + 1])return No, void();
        for (auto j : g[i].vis) {
            if (g[i].a[m + 1] + k < g[s[t - 1]].a[m + 1]) {
                g[i].a[m + 1] += k, g[i].a[j] = k;
            }
            else {
                int p = g[s[t - 1]].a[m + 1] - g[i].a[m + 1] - 1;
                g[i].a[m + 1] += p, g[i].a[j] = p;
                break;
            }
        }
    }
    Yes;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)cout << max(g[i].a[j], 0ll) << " \n"[j == m];
}
signed main() {
    IOS;
    int _ = 1;
    cin >> _;
    while (_--)solve();
    return 0;
}
inline int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9') { if (ch == '-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = x * 10 + ch - 48; ch = getchar(); }
    return x * f;
}
/*   /\_/\
*   (= ._.)
*   / >  \>
*/