#include<bits/stdc++.h>
#define int long long
#define id(x,y) ((x-1)*(m-1)+y)
#define rx(x) ((x-1)/(m-1)+1)
#define ry(x) ((x-1)%(m-1)+1)
using namespace std;
const int N=521,inf=0x3f3f3f3f3f3f3f3f;
struct edge{
	int y,nxt,v,w,i;
	edge(int y1,int n1,int v1,int w1,int i1):y(y1),nxt(n1),v(v1),w(w1),i(i1){}
	edge(){}
}e[N*N];
int st,ed,cnt,ver;
int d[N],vis[N];
int head[N],cur[N];
void add(int x,int y,int v,int w,int i){
	e[++cnt]=edge(y,head[x],v,w,i);
	head[x]=cnt;
}
void build(int x,int y,int v,int w){
	add(x,y,v,w,cnt+2);
	add(y,x,v,0,cnt);
	add(y,x,v,w,cnt+2);
	add(x,y,v,0,cnt);
}
int dinic(int x,int flow){
	if(x==ed||!flow) return flow;
	int res=0;
	vis[x]=1;
	for(int i=cur[x];~i;i=e[i].nxt,cur[x]=i){
		int y=e[i].y,v=e[i].v,w=e[i].w;
		if(!w||(ver&&v)||vis[y]) continue;
		if(ver&&d[y]!=d[x]+1) continue;
		if(!ver&&d[y]!=d[x]+v) continue;
		int tmp=dinic(y,min(flow,w));
		e[i].w-=tmp,e[e[i].i].w+=tmp;
		flow-=tmp,res+=tmp;
		if(!flow) break;
	}
	vis[x]=0;
	return res;
}
bool bfs(){
	memset(d,0x3f,sizeof(d));
	for(int i=st;i<=ed;i++) cur[i]=head[i];
	queue<int> q;
	d[st]=0,q.push(st);
	while(!q.empty()){
		int x=q.front();q.pop();
		for(int i=head[x];~i;i=e[i].nxt){
			int y=e[i].y;
			if(!e[i].w||e[i].v) continue;
			if(d[y]==inf){
				d[y]=d[x]+1;
				q.push(y);
			}
		}
	}
	return d[ed]<inf;
}
bool spfa(){
	memset(d,0x3f,sizeof(d));
	memset(vis,0,sizeof(vis));
	for(int i=st;i<=ed;i++) cur[i]=head[i];
	queue<int> q;
	d[st]=0,q.push(st);
	while(!q.empty()){
		int x=q.front();q.pop();
		vis[x]=0;
		for(int i=head[x];~i;i=e[i].nxt){
			int y=e[i].y,v=e[i].v;
			if(!e[i].w) continue;
			if(d[x]+v<d[y]){
				d[y]=d[x]+v;
				if(!vis[y]) vis[y]=1,q.push(y); 
			} 
		}
	}
	return d[ed]<inf;
}

int n,m,k,ans;
int fl[2][N][N];
signed main(){
	int T;
	cin>>T;
	while(T--){
		memset(head,-1,sizeof(head));
		cnt=ans=0;
		cin>>n>>m>>k;
		st=0,ed=(n-1)*(m-1)+1;
		for(int i=1;i<=n;i++){
			for(int j=1,w;j<m;j++){
				scanf("%lld",&w);
				fl[0][i][j]=w;
				if(i==1) build(st,id(i,j),0,w),build(st,id(i,j),1,inf);
				if(i==n) build(id(i-1,j),ed,0,w),build(id(i-1,j),ed,1,inf);
				if(i!=1&&i!=n) build(id(i,j),id(i-1,j),0,w),build(id(i,j),id(i-1,j),1,inf);
			}
		}
		for(int i=1;i<n;i++){
			for(int j=1,w;j<=m;j++){
				scanf("%lld",&w);
				fl[1][i][j]=w;
				if(j==1||j==m) continue;
				build(id(i,j-1),id(i,j),0,w);
				build(id(i,j-1),id(i,j),1,inf);
			}
		}
		ver=1;
		while(bfs()){
			dinic(st,inf);
		}
		ver=0;
		while(k>0&&spfa()){
			memset(vis,0,sizeof(vis));
			k-=dinic(st,k);
		}
		for(int i=head[ed];~i;i=e[i].nxt){
			if(!e[i].v||e[i].i>i) continue;
			int y=e[i].y,i1=rx(y),j1=ry(y),w=e[i].w;
		//	ans+=w;
			fl[0][n][j1]+=w;
		}
		for(int i=1;i<n;i++){
			for(int j=1;j<m;j++){
				int x=id(i,j);
				for(int t=head[x];~t;t=e[t].nxt){
					if(!e[t].v||!e[t].w||e[t].i>t) continue;
					int y=e[t].y,i1=rx(y),j1=ry(y),w=e[t].w;
					if(y==ed) fl[0][n][j]+=w;
					else if(y==st) fl[0][1][j]+=w;
					else if(i1==i-1) fl[0][i][j]+=w;
					else if(i1==i+1) fl[0][i+1][j]+=w;
					else if(j1==j-1) fl[1][i][j]+=w;
					else if(j1==j+1) fl[1][i][j+1]+=w;
				//	ans+=w;
				}
			}
		}
		for(int i=1;i<=cnt;i++){
			if(!e[i].v||e[i].i>i) continue;
			ans+=e[i].w;
		}
		printf("%lld\n",ans);
		for(int i=1;i<=n;i++){
			for(int j=1;j<m;j++){
				printf("%lld",fl[0][i][j]);
				if(j!=m-1) printf(" ");
			}
			printf("\n");
		}
		for(int i=1;i<n;i++){
			for(int j=1;j<=m;j++){
				printf("%lld",fl[1][i][j]);
				if(j!=m) printf(" ");
			}
			printf("\n");
		}
	}
	
}
/*
2
3 4 6
2 1 15
7 1 9
13 3 2
3 6 1 2
5 2 15 3
3 3 3
1 1
2 2
3 3
1 1 1
2 2 2
*/