#include <bits/stdc++.h>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

struct PrimalDual {
	int n, s, t;
	struct graph {
		int tot, hd[605];
		int nxt[100005], to[100005], cst[100005];
		long long flw[100005];

		void clear(int n) {tot = 1; memset(hd, 0, sizeof(int) * n); return;}
		void add(int u, int v, long long f, int c) {
			nxt[++tot] = hd[u];
			hd[u] = tot;
			to[tot] = v;
			flw[tot] = f;
			cst[tot] = c;
			return;
		}
	} g;
	long long h[605], dis[605];
	int f[605], pre[605];
	struct node {
		int id;
		long long val;

		node() = default;
		node(int _id, long long _val): id(_id), val(_val) {}
		bool operator<(const node &b) const {return val > b.val;}
	};

	void clear(int n) {g.clear(n); return;}
	void add_edge(int u, int v, long long f, int c) {g.add(u, v, f, c), g.add(v, u, 0, -c); return;}
	void spfa() {
		queue<int> q;
		memset(h, 0x3f, sizeof(h));
		h[s] = 0;
		q.push(s);
		while (!q.empty()) {
			int now = q.front();
			q.pop();
			f[now] = 0;
			for (int i = g.hd[now]; i; i = g.nxt[i])
				if (g.flw[i] && h[g.to[i]] > h[now] + g.cst[i]) {
					h[g.to[i]] = h[now] + g.cst[i];
					if (!f[g.to[i]]) q.push(g.to[i]), f[g.to[i]] = 1;
				}
		}
		return;
	}
	int dijkstra() {
		priority_queue<node> q;
		memset(dis, 0x3f, sizeof(dis));
		memset(pre, 0, sizeof(pre));
		q.emplace(s, dis[s] = 0);
		while (!q.empty()) {
			int now = q.top().id;
			long long tmp = q.top(). val;
			q.pop();
			if (dis[now] != tmp) continue;
			for (int i = g.hd[now]; i; i = g.nxt[i])
				if (g.flw[i] && dis[g.to[i]] > dis[now] + g.cst[i] + h[now] - h[g.to[i]]) {
					q.emplace(g.to[i], dis[g.to[i]] = dis[now] + g.cst[i] + h[now] - h[g.to[i]]);
					pre[g.to[i]] = i ^ 1;
				}
		}
		return pre[t];
	}
	long long solve(long long lim) {
		long long ans = 0;
		long long flow = 0;
		spfa();
		while (flow < lim && dijkstra()) {
			for (int i = 1; i <= n; i++)
				if (dis[i] < 0x3f3f3f3f3f3f3f3f) h[i] += dis[i];
			long long mnflow = 0x3f3f3f3f3f3f3f3f;
			for (int i = t; i != s; i = g.to[pre[i]]) mnflow = min(mnflow, g.flw[pre[i] ^ 1]);
			mnflow = min(mnflow, lim - flow);
			for (int i = t; i != s; i = g.to[pre[i]]) g.flw[pre[i] ^ 1] -= mnflow, g.flw[pre[i]] += mnflow;
			// eprintf("%d %lld\n", mnflow, h[t]);
			ans += mnflow * h[t];
			flow += mnflow;
		}
		return ans;
	}
} F;

int T, n, m, k;
long long r[505][505], c[505][505];
int idr1[505][505], idr2[505][505], idc1[505][505], idc2[505][505];
struct graph {
	int tot, hd[605];
	int nxt[100005], to[100005], dt[100005];

	void clear(int n) {tot = 0; memset(hd, 0, sizeof(int) * n); return;}
	void add(int u, int v, int w) {
		nxt[++tot] = hd[u];
		hd[u] = tot;
		to[tot] = v;
		dt[tot] = w;
		return;
	}
} g;
long long dis[605];
struct node {
	int id;
	long long val;

	node() = default;
	node(int _id, long long _val): id(_id), val(_val) {}
	bool operator<(const node &b) const {return val > b.val;}
};

int getid(int x, int y) {return (x - 1) * m + y;}

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d%d", &n, &m, &k);
		F.clear(n * m + 7);
		F.s = n * m + 1, F.t = n * m + 2, F.n = n * m + 2;
		int S = F.s, T = F.t;
		g.clear(n * m + 7);
		for (int i = 1; i <= n; i++)
			for (int j = 1; j < m; j++) {
				scanf("%lld", &r[i][j]);
				int u = i == 1 ? F.s : getid(i - 1, j), v = i == n ? F.t : getid(i, j);
				g.add(getid(i, j), getid(i, j + 1), r[i][j]);
				g.add(getid(i, j + 1), getid(i, j), r[i][j]);
				F.add_edge(u, v, r[i][j], 0);
				F.add_edge(v, u, r[i][j], 0);
				idr1[i][j] = F.g.tot + 1;
				F.add_edge(u, v, 0x3f3f3f3f3f3f3f3f, 1);
				idr2[i][j] = F.g.tot + 1;
				F.add_edge(v, u, 0x3f3f3f3f3f3f3f3f, 1);
			}
		for (int i = 1; i < n; i++)
			for (int j = 1; j <= m; j++) {
				scanf("%lld", &c[i][j]);
				if (j == 1 || j == m) continue;
				int u = getid(i, j - 1), v = getid(i, j);
				g.add(getid(i, j), getid(i + 1, j), c[i][j]);
				g.add(getid(i + 1, j), getid(i, j), c[i][j]);
				F.add_edge(u, v, c[i][j], 0);
				F.add_edge(v, u, c[i][j], 0);
				idc1[i][j] = F.g.tot + 1;
				F.add_edge(u, v, 0x3f3f3f3f3f3f3f3f, 1);
				idc2[i][j] = F.g.tot + 1;
				F.add_edge(v, u, 0x3f3f3f3f3f3f3f3f, 1);
			}
		for (int i = 1; i <= n; i++) g.add(S, getid(i, 1), 0), g.add(getid(i, m), T, 0);
		priority_queue<node> q;
		memset(dis, 0x3f, sizeof(dis));
		q.emplace(S, dis[S] = 0);
		while (!q.empty()) {
			int now = q.top().id;
			long long tmp = q.top(). val;
			q.pop();
			if (dis[now] != tmp) continue;
			for (int i = g.hd[now]; i; i = g.nxt[i])
				if (dis[g.to[i]] > dis[now] + g.dt[i])
					q.emplace(g.to[i], dis[g.to[i]] = dis[now] + g.dt[i]);
		}
		eprintf("shortest path: %lld\n", dis[T]);
		long long ans = F.solve(dis[T] + k);
		for (int i = 1; i <= n; i++)
			for (int j = 1; j < m; j++) r[i][j] += F.g.flw[idr1[i][j] ^ 1] + F.g.flw[idr2[i][j] ^ 1];
		for (int i = 1; i < n; i++)
			for (int j = 2; j < m; j++) c[i][j] += F.g.flw[idc1[i][j] ^ 1] + F.g.flw[idc2[i][j] ^ 1];
		printf("%lld\n", ans);
		for (int i = 1; i <= n; i++, puts(""))
			for (int j = 1; j < m; j++) printf("%lld ", r[i][j]);
		for (int i = 1; i < n; i++, puts(""))
			for (int j = 1; j <= m; j++) printf("%lld ", c[i][j]);
	}
	return 0;
}
/*
2
3 4 6
4 2 15 
7 1 11 
13 4 5 
3 6 1 2 
5 2 15 3 
3 3 3
2 3 
2 3 
3 3 
1 1 1 
2 2 2 

*/