#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=510,M=1e5+10; 
int n,m,k;
int c[510][510],r[510][510];
struct kkk{
    int x,len,pr,f;
    bool operator<(kkk k1)const{
        return len>k1.len;
    }
};
struct SSP {
    int cnt = 1, hd[N], nxt[M << 1], to[M << 1], limit[M << 1], cst[M << 1];
    void init(int nn){
        for(int i=0;i<=nn;i++)hd[i]=0;
        cnt=1;
    }
    // w limit c cost
    void add(int u, int v, int f, int c) {// limit cost 
        nxt[++cnt] = hd[u], hd[u] = cnt, to[cnt] = v, limit[cnt] = f, cst[cnt] = c;
        nxt[++cnt] = hd[v], hd[v] = cnt, to[cnt] = u, limit[cnt] = 0, cst[cnt] = -c;
    }
    void just_add(int u,int v,int f){
        nxt[++cnt]=hd[u],hd[u]=cnt,to[cnt]=v,limit[cnt]=f,cst[cnt]=0;
    }
    int fr[N], fl[N], in[N], dis[N];
    void calans(int x,int y,int w,int i){
        auto in = [&](int id){
            return id>=1&&id<=(n-1)*(m-1);
        };
        if(x==0&&in(y)){
            r[1][y]+=w;
        }
        else if(in(x)&&y==(n-1)*(m-1)+1){
            r[n][(x-1)%(m-1)+1]+=w;
        }
        else if(in(x)&&in(y)){
            if(x+m-1==y){
                r[(x-1)/(m-1)+2][(x-1)%(m-1)+1]+=w;
            }
            else if(x-(m-1)==y){
                r[(y-1)/(m-1)+2][(y-1)%(m-1)+1]+=w;
            }
            else if(x+1==y){
                c[(x-1)/(m-1)+1][(x-1)%(m-1)+1+1]+=w;
            }
            else if(x-1==y){
                c[(y-1)/(m-1)+1][(y-1)%(m-1)+1+1]+=w;
            }
        }
    };
    pair<int, int> min_cost(int s, int t) {
        int flow = 0;
        ll cost = 0;
        while (true) { // SPFA
            priority_queue<kkk,vector<kkk>> q;
            memset(dis, 0x3f, sizeof(dis));
            q.push({s,0,0,(int)1e9});
            while (!q.empty()) {
                auto [cur,dis_now,pr,f] = q.top();
                q.pop();
                if(dis_now>=dis[cur])continue;
                fr[cur]=pr;
                fl[cur]=f;
                dis[cur]=dis_now;
                for (int i = hd[cur]; i; i = nxt[i]) {
                    int it = to[i], d = dis[cur] + cst[i];
                    if (limit[i] && d < dis[it]) {
                        q.push({it,d,i,min(limit[i], fl[cur])});
                    }
                }
            }
            if (dis[t] > 1e9) return {flow, cost};//??>0?????
            flow += fl[t], cost += (ll)dis[t] * fl[t];
            for (int u = t; u != s; u = to[fr[u] ^ 1]) {
                calans(to[fr[u]^1],u,fl[t]*cst[fr[u]],fr[u]);
                limit[fr[u]] -= fl[t], limit[fr[u] ^ 1] += fl[t];
            }
        }
    }
} sol2;
class Maxflow{
private:
	int nedge=1,p[2*M],nex[2*M],head[N],c[2*M],cur[2*M];
    int dist[2*N];
    int S,T;
	void Addedge(int a,int b,int v){
		p[++nedge]=b;nex[nedge]=head[a];head[a]=nedge;
		c[nedge]=v;
	}
    bool bfs(){
		queue<int>q;
		for(int i=S;i<=T;i++)dist[i]=-1;
		dist[S]=0;q.push(S);
		while(!q.empty()){
			int now=q.front();q.pop();
			for(int k=head[now];k;k=nex[k])if(dist[p[k]]==-1&&c[k]>0){
				dist[p[k]]=dist[now]+1;
				q.push(p[k]);
			}
		}
		return dist[T]>-1;
	}
	int dfs(int x,int low){
		if(x==T)return low;
		if(low==0)return 0;
		int used=0;
		for(int &k=cur[x];k;k=nex[k])if(dist[p[k]]==dist[x]+1&&c[k]>0){
			int a=dfs(p[k],min(c[k],low-used));
			c[k]-=a;c[k^1]+=a;used+=a;
			if(low==used)break;
		}
		if(used==0)dist[x]=-1;
		return used;
	}
public:
	void init(int s,int t){
		for(int i=S;i<=T;i++)head[i]=0;
		S=s,T=t;
		nedge=1;
	}
    void addedge(int a,int b,int v){
        Addedge(a,b,v);
        Addedge(b,a,0);
	}
	int dinic(SSP &sol2){
		int flow=0;
		while(bfs()){
			for(int i=S;i<=T;i++)cur[i]=head[i];
			flow+=dfs(S,1e9);
		}
        for(int i=S;i<=T;i++){
			for(int k=head[i];k;k=nex[k])if(k%2==0){
                sol2.just_add(i,p[k],c[k]);
                sol2.just_add(p[k],i,c[k^1]);
            }
        }
		return flow;
	}
}sol1;

void solve()
{
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<m;j++)cin>>r[i][j];
    }
    for(int i=1;i<n;i++){
        for(int j=1;j<=m;j++)cin>>c[i][j];
    }
    auto id = [&](int x,int y){
        return (x-1)*(m-1)+y;
    };
    int s=0,t=(n-1)*(m-1)+1;
    sol1.init(s,t);
    auto addedge1 =[&](int x,int y,int w){
        sol1.addedge(x,y,w);
        sol1.addedge(y,x,w);
    };
    auto addedge2 =[&](int x,int y,int w=(int)1e9){
        sol2.add(x,y,w,1);
        sol2.add(y,x,w,1);
    };
    for(int j=1;j<m;j++){
        addedge1(s,id(1,j),r[1][j]);
        addedge1(id(n-1,j),t,r[n][j]);
    }
    for(int i=1;i+1<n;i++){
        for(int j=1;j<m;j++){
            addedge1(id(i,j),id(i+1,j),r[i+1][j]);
        }
    }
    for(int i=1;i<n;i++){
        for(int j=1;j+1<m;j++){
            addedge1(id(i,j),id(i,j+1),c[i][j+1]);
        }
    }
    sol2.init(t+1);
    sol1.dinic(sol2);
    for(int j=1;j<m;j++){
        addedge2(s,id(1,j));
        addedge2(id(n-1,j),t);
    }
    for(int i=1;i+1<n;i++){
        for(int j=1;j<m;j++){
            addedge2(id(i,j),id(i+1,j));
        }
    }
    for(int i=1;i<n;i++){
        for(int j=1;j+1<m;j++){
            addedge2(id(i,j),id(i,j+1));
        }
    }
    int t2=t+1;
    sol2.add(t,t2,k,0);
    auto [flow,cost]=sol2.min_cost(s,t2);
    cout<<cost<<"\n";
    for(int i=1;i<=n;i++){
        for(int j=1;j<m;j++)cout<<r[i][j]<<" \n"[j==m-1];
    }
    for(int i=1;i<n;i++){
        for(int j=1;j<=m;j++)cout<<c[i][j]<<" \n"[j==m];
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--)solve();
    return 0;
}