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

typedef long long ll;
const int maxn = 505;
const int maxm = 4005;
const ll inf = 1e18;

struct edge
{
    int v, next;
    ll w, flow;
}e[maxm << 2];
int head[maxn], tot;

int s, t;
inline void addedge(int u, int v, ll c, ll w)
{
    e[++tot] = (edge){v, head[u], w, c}; head[u] = tot;
    e[++tot] = (edge){u, head[v], -w, 0}; head[v] = tot;
}

int n, m, k, dt, rval[505][505], cval[505][505];
inline int ind(int x, int y) { return (x - 1) * (m - 1) + y; }

int d[maxn], cur[maxn];

bool bfs_dinic()
{
    for (int i = 0; i <= t; i++) d[i] = 0, cur[i] = head[i];
    queue<int> q; q.push(s), d[s] = 1;
    while (q.size())
    {
        int u = q.front(); q.pop();
        for (int i = head[u]; ~i; i = e[i].next)
        {
            int v = e[i].v;
            if (!d[v] && e[i].flow)
            {
                d[v] = d[u] + 1;
                if (v == t) return true;
                q.push(v);
            }
        }
    }
    return false;
}

ll dfs(int u, ll flow)
{
    if (u == t || !flow) return flow;
    ll rest = flow;
    for (int i = cur[u]; ~i; i = e[i].next)
    {
        int v = e[i].v;
        if (d[v] == d[u] + 1 && e[i].flow)
        {
            ll k = dfs(v, min(rest, e[i].flow));
            if (!k) d[v] = 0;
            e[i].flow -= k, e[i ^ 1].flow += k, rest -= k;
            if (!rest) break;
        }
        cur[u] = i;
    }
    return flow - rest;
}

ll Dinic()
{
    ll maxflow = 0;
    while (bfs_dinic())
    {
        ll flow = 0;
        while (flow = dfs(s, inf)) maxflow += flow;
    }
    return maxflow;
}

int pre[maxn];
bool vis[maxn];
ll dis[maxn], mincost, maxflow;

bool bfs_EK()
{
    for (int i = 0; i <= t; i++) pre[i] = -1, vis[i] = 0, dis[i] = inf;
    queue<int> q; q.push(s), vis[s] = 1, dis[s] = 0;
    while (q.size())
    {
        int u = q.front(); q.pop(); vis[u] = 0;
        for (int i = head[u]; ~i; i = e[i].next)
        {
            int v = e[i].v;
            if (dis[v] > dis[u] + e[i].w && e[i].flow)
            {
                dis[v] = dis[u] + e[i].w; pre[v] = i;
                if (!vis[v])
                {
                    vis[v] = 1;
                    q.push(v);
                }
            }
        }
    }
    return pre[t] != -1;
}

void MCMF()
{
    maxflow = mincost = 0;
    while (bfs_EK())
    {
        ll d = inf;
        for (int i = pre[t]; ~i; i = pre[e[i ^ 1].v]) d = min(d, e[i].flow);
        maxflow += d, mincost += d * dis[t];
        for (int i = pre[t]; ~i; i = pre[e[i ^ 1].v]) e[i].flow -= d, e[i ^ 1].flow += d;
    }
}

void work()
{
    cin >> n >> m >> k; dt = (n - 1) * (m - 1);
    s = 0, t = dt + 2;
    for (int i = 0; i <= t; i++) head[i] = -1; tot = -1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j < m; j++)
        {
            int c; cin >> c, rval[i][j] = c;
            if (i == 1) addedge(s, ind(1, j), c, 0), addedge(ind(1, j), s, c, 0);
            else if (i == n) addedge(ind(n - 1, j), t, c, 0), addedge(t, ind(n - 1, j), c, 0);
            else addedge(ind(i - 1, j), ind(i, j), c, 0), addedge(ind(i, j), ind(i - 1, j), c, 0);
        }
    for (int i= 1; i < n; i++)
        for (int j = 1; j <= m; j++)
        {
            int c; cin >> c, cval[i][j] = c;
            if (j > 1 && j < m)
            {
                addedge(ind(i, j - 1), ind(i, j), c, 0);
                addedge(ind(i, j), ind(i, j - 1), c, 0);
            }
        }
    Dinic();
    
    int nwtot = tot;
    addedge(dt + 1, s, k, 0), s = dt + 1;
    int anstot = tot + 1;
    for (int i = 0; i <= nwtot; i += 2) addedge(e[i ^ 1].v, e[i].v, inf, 1);
    MCMF(); cout << mincost << "\n";

    for (int i = 1; i <= n; i++, cout << "\n")
        for (int j = 1; j < m; j++)
        {
            rval[i][j] += max(e[anstot ^ 1].flow, e[(anstot + 2) ^ 1].flow); anstot += 4;
            cout << rval[i][j] << " ";
        }
    for (int i= 1; i < n; i++, cout << "\n")
        for (int j = 1; j <= m; j++)
            if (j > 1 && j < m)
            {
                cval[i][j] += max(e[anstot ^ 1].flow, e[(anstot + 2) ^ 1].flow); anstot += 4;
                cout << cval[i][j] << " ";
            }
            else cout << cval[i][j] << " ";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T; cin >> T;
    while (T--) work();
    return 0;
}