#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N = 510, s = N - 3, T = N - 1, M = 6010;
const ll INF = 1e16;

int head[N], ver[M], Next[M], w[M], tot = 1, n, m, k, S, l[N], r[N];
ll edge[M];

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

void add(int x, int y, ll z1, ll z2, int a)
{
    ver[++tot] = y, edge[tot] = z1, w[tot] = a, Next[tot] = head[x], head[x] = tot;
    ver[++tot] = x, edge[tot] = z2, w[tot] = a, Next[tot] = head[y], head[y] = tot;
}

namespace Dinic{
    int d[N], cur[N];

    int bfs()
    {
        queue <int> q;
        q.push(S);
        memset(d, -1, sizeof(d));
        cur[S] = head[S], d[S] = 0;
        while(!q.empty())
        {
            int x = q.front(); q.pop();
            for(int i = head[x]; i; i = Next[i])
            {
                int y = ver[i]; ll z = edge[i];
                if(d[y] == -1 && z && !w[i])
                {
                    //cout << x << " " << y << " " << z << endl;
                    d[y] = d[x] + 1;
                    cur[y] = head[y];
                    q.push(y);
                    if(y == T) return 1;
                }
            }
        }
        return 0;
    }

    ll find(int x, ll limit)
    {
        if(x == T) return limit;
        ll flow = 0;
        for(int i = cur[x]; i && flow < limit; i = Next[i])
        {
            cur[x] = i;
            int y = ver[i]; ll z = edge[i];
            if(d[y] == d[x] + 1 && z && !w[i])
            {
                ll t = find(y, min(limit - flow, z));
                if(!t) d[y] = -1;
                edge[i] -= t, edge[i ^ 1] += t, flow += t;
            }
        }
        return flow;
    }

    ll dinic()
    {
        ll r = 0, flow;
        while(bfs())
        {
            while(flow = find(S, INF))
            {
                r += flow;
            }
        }
        return r;
    }
}

namespace EK{
    int pre[N], d[N], v[N];
    ll incf[N];

    int spfa()
    {
        queue <int> q;
        memset(incf, 0, sizeof(incf));
        memset(d, 0x3f, sizeof(d));
        q.push(S);
        incf[S] = INF, v[S] = 1, d[S] = 0;

        while(!q.empty())
        {
            int x = q.front(); q.pop();
            v[x] = 0;

            for(int i = head[x]; i; i = Next[i])
            {
                int y = ver[i]; ll z = edge[i];
                if(d[x] + w[i] < d[y] && z)
                {
                    d[y] = d[x] + w[i];
                    incf[y] = min(incf[x], z);
                    pre[y] = i;
                    if(!v[y]) q.push(y), v[y] = 1;
                }
            }
        }

        return incf[T] > 0;
    }

    int EK()
    {
        ll flow = 0; int cost = 0;
        while(spfa())
        {
            ll t = incf[T];
            flow += t, cost += t * d[T];
            for(int i = T; i != S; i = ver[pre[i] ^ 1])
            {
                edge[pre[i]] -= t, edge[pre[i] ^ 1] += t;
            }
        }
        return cost;
    }
}

int main()
{
    int TT;
	scanf("%d",&TT);
    while(TT--)
    {
        memset(head, 0, sizeof(head)); tot = 1;
        scanf("%d%d%d", &n, &m, &k);
        S = s;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j < m; j++)
            {
                ll z; scanf("%lld", &z);
                if(i == 1)
                {
                    add(S, id(i, j), z, z, 0);
                    add(S, id(i, j), INF, INF, 1);
                }
                else if(i < n)
                {
                    add(id(i - 1, j), id(i, j), z, z, 0);
                    add(id(i - 1, j), id(i, j), INF, INF, 1);
                }
                else
                {
                    add(id(i - 1, j), T, z, z, 0);
                    add(id(i - 1, j), T, INF, INF, 1);
                }
            }
        }
        for(int i = 1; i < n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                ll z; scanf("%lld", &z);
                if(j > 1 && j < m)
                {
                    add(id(i, j - 1), id(i, j), z, z, 0);
                    add(id(i, j - 1), id(i, j), INF, INF, 1);
                }
                else if(j == 1) l[i] = z;
                else r[i] = z;
            }
        }
        ll dis = Dinic::dinic();
        S = N - 2;
        add(S, s, k, k, 0);
        printf("%d\n", EK::EK());
        int idx = 0;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j < m; j++)
            {
                ll z = 0ll;
                idx += 2;
                z += (edge[idx] + edge[idx ^ 1]) / 2ll;
                idx += 2;
                z += abs(edge[idx] - INF);
                printf("%lld ", z);
            }
            puts("");
        }
        for(int i = 1; i < n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                if(j > 1 && j < m)
                {
                    ll z = 0ll;
                    idx += 2;
                    z += (edge[idx] + edge[idx ^ 1]) / 2ll;
                    idx += 2;
                    z += abs(edge[idx] - INF);
                    printf("%lld ", z);
                }
                else if(j == 1) printf("%d ", l[i]);
                else printf("%d\n", r[i]);
            }
        }
    }
    return 0;
}