#include <bits/stdc++.h>

using LL = long long;

constexpr int N = 1000006;
constexpr int inf32 = (int)(1e9) + 9;
constexpr LL inf64 = (LL)(1e18) + 18;

struct Edge { int x, y, nxt; LL w, cost; };
Edge edge[N];
int src, dst;
int tot, cnt = 1;
int head[N], _head[N], level[N];
void add_edge(int x, int y, LL w, LL cost) {
    edge[++cnt] = {x, y, head[x], w, cost};
    head[x] = cnt;
    edge[++cnt] = {y, x, head[y], 0, -cost};
    head[y] = cnt;
}
bool bfs() {
    for (int i = 1; i <= tot; i++) level[i] = -1;
    std::queue<int> que;
    level[src] = 0;
    que.push(src);
    while (que.size()) {
        int u = que.front();
        que.pop();
        if (u == dst) return 1;
        for (int e = head[u]; e; e = edge[e].nxt) {
            if (!edge[e].w) continue;
            int v = edge[e].y;
            if (level[v] != -1) continue;
            level[v] = level[u] + 1;
            que.push(v);
        }
    }
    return 0;
}
LL dfs(int u, LL flow) {
    if (u == dst) return flow;
    LL rest = flow;
    for (int &e = _head[u]; e; e = edge[e].nxt) {
        int v = edge[e].y, w = edge[e].w;
        if (level[v] != level[u] + 1) continue;
        int t = dfs(v, std::min<LL>(rest, w));
        edge[e].w -= t;
        edge[e ^ 1].w += t;
        rest -= t;
        if (!rest) break;
    }
    return flow - rest;
}
int dinic() {
    LL flow = 0;
    while (bfs()) {
        for (int i = 1; i <= tot; i++) _head[i] = head[i];
        LL t = dfs(src, inf64);
        if (!t) break;
        flow += t;
    }
    return flow;
}

LL dis[N];
int from[N];
bool inque[N];
std::pair<int, LL> spfa() {
    for (int i = 1; i <= tot; i++) {
        dis[i] = inf64;
        inque[i] = 0;
    }
    std::queue<int> que;
    dis[src] = 0;
    que.push(src);
    inque[src] = 1;
    while (que.size()) {
        int u = que.front();
        que.pop();
        inque[u] = 0;
        for (int e = head[u]; e; e = edge[e].nxt) {
            if (!edge[e].w) continue;
            int v = edge[e].y, w = edge[e].cost;
            if (dis[v] > dis[u] + w) {
                from[v] = e;
                dis[v] = dis[u] + w;
                if (!inque[v]) {
                    que.push(v);
                    inque[v] = 1;
                }
            }
        }
    }
    if (dis[dst] >= inf64) return {0, 0};
    LL flow = inf64;
    for (int u = dst; u != src; u = edge[from[u]].x) flow = std::min(flow, edge[from[u]].w);
    for (int u = dst; u != src; u = edge[from[u]].x) {
        edge[from[u]].w -= flow;
        edge[from[u] ^ 1].w -= flow;
    }
    return {flow, flow * dis[dst]};
}
auto ek() {
    LL flow = 0, cost = 0;
    while (true) {
        auto [x, y] = spfa();
        if (!x) break;
        flow += x;
        cost += y;
    }
    return std::pair{flow, cost};
}

int n, m, k;
int idr[502][502][2], idd[502][502][2];
int down[502][502], right[502][502];

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

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &n, &m, &k);
        for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++)
            idr[i][j][0] = idr[i][j][1] = idd[i][j][0] = idd[i][j][1] = 0;
        for (int i = 1; i <= n; i++) for (int j = 1; j < m; j++) scanf("%d", &right[i][j]);
        for (int i = 1; i < n; i++) for (int j = 1; j <= m; j++) scanf("%d", &down[i][j]);
        cnt = 1;
        tot = (n - 1) * (m - 1) + 2;
        src = tot - 1, dst = tot;
        for (int i = 1; i < n; i++) for (int j = 1; j < m; j++) {
            if (i == 1) add_edge(src, id(i, j), right[1][j], 0);
            if (i == n - 1) add_edge(id(i, j), dst, right[n][j], 0);
            if (i + 1 < n) {
                add_edge(id(i, j), id(i + 1, j), right[i + 1][j], 0);
                add_edge(id(i + 1, j), id(i, j), right[i + 1][j], 0);
            }
            if (j + 1 < m) {
                add_edge(id(i, j), id(i, j + 1), down[i][j + 1], 0);
                add_edge(id(i, j + 1), id(i, j), down[i][j + 1], 0);
            }
        }
        LL flow = dinic();
        int pre = dst;
        dst = ++tot;
        for (int i = 1; i < n; i++) for (int j = 1; j < m; j++) {
            if (i == 1) {
                idr[1][j][0] = cnt + 1;
                add_edge(src, id(i, j), inf64, 1);
            }
            if (i == n - 1) {
                idr[n][j][0] = cnt + 1;
                add_edge(id(i, j), pre, inf64, 1);
            }
            if (i + 1 < n) {
                idr[i + 1][j][0] = cnt + 1;
                add_edge(id(i, j), id(i + 1, j), inf64, 1);
                idr[i + 1][j][1] = cnt + 1;
                add_edge(id(i + 1, j), id(i, j), inf64, 1);
            }
            if (j + 1 < m) {
                idd[i][j + 1][0] = cnt + 1;
                add_edge(id(i, j), id(i, j + 1), inf64, 1);
                idd[i][j + 1][1] = cnt + 1;
                add_edge(id(i, j + 1), id(i, j), inf64, 1);
            }
        }
        add_edge(pre, dst, k, 0);
        auto [x, y] = ek();
        assert(x == k);
        printf("%lld\n", y);
        for (int i = 1; i <= tot; i++) head[i] = 0;
        for (int i = 1; i <= n; i++) for (int j = 1; j < m; j++) for (int e : idr[i][j]) if (e)
            right[i][j] += inf64 - edge[e].w;
        for (int i = 1; i < n; i++) for (int j = 1; j <= m; j++) for (int e : idd[i][j]) if (e)
            down[i][j] += inf64 - edge[e].w;
        for (int i = 1; i <= n; i++) for (int j = 1; j < m; j++) printf("%d%c", right[i][j], " \n"[j + 1 == m]);
        for (int i = 1; i < n; i++) for (int j = 1; j <= m; j++) printf("%d%c", down[i][j], " \n"[j == m]);
    }
    return 0;
}