/*
､・・ｭ｡ｭ､・ﾀ､ﾛｩ`､､､ﾃ｡・
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<18,stdin),p1==p2)?EOF:*p1++)
LL read()
{
	LL x=0;
	char c=getchar();
	while(c<'0' || c>'9')	c=getchar();
	while(c>='0' && c<='9')	x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
	return x;
}
void write(LL x)
{
	if(x>9)	write(x/10);
	putchar(x%10+'0');
}
typedef pair<LL,LL> P;
typedef vector<LL> Poly;
typedef vector<P> PolyP;
#define mp make_pair
#define spc putchar(' ')
#define etr putchar('\n')
#define inlp(x,y) putchar(x==y?'\n':' ')
const LL inf=1e12;
LL cnt;
LL head[605],cur[605];
LL nxt[10000005],to[10000005],val[10000005],cst[1000005];
inline void AddEdge(LL u,LL v,LL w,LL c){++cnt,nxt[cnt]=head[u],to[cnt]=v,val[cnt]=w,cst[cnt]=c,head[u]=cnt;}
inline void addEdge(LL u,LL v,LL w1,LL w2,LL c){AddEdge(u,v,w1,c),AddEdge(v,u,w2,-c);}
void init()
{
	memset(head,0,sizeof head);
	cnt=1;
}
LL n,m,K;
inline LL trans(LL x,LL y){return (x-1)*(m-1)+y;}
LL s,t;
LL dep[605];
bool bfs()
{
	queue<LL> Q;
	Q.push(s);
	memset(dep,0,sizeof dep);
	dep[s]=1;
	while(!Q.empty())
	{
		LL u=Q.front();
		Q.pop();
		cur[u]=head[u];
		for(LL i=head[u];i;i=nxt[i])
		{
			LL v=to[i],w=val[i],c=cst[i];
			if(c)	continue;
			if(w && !dep[v])	Q.push(v),dep[v]=dep[u]+1;
		}
	}
	return dep[t];
}
LL Dinic(LL u,LL flow)
{
	if(u==t)	return flow;
	LL ret=0;
	for(LL &i=cur[u];i;i=nxt[i])
	{
		LL v=to[i],w=val[i],c=cst[i];
		if(c)	continue;
		if(dep[v]!=dep[u]+1)	continue;
		if(!w)	continue;
		LL res=Dinic(v,min(flow,w));
		ret+=res,flow-=res;
		val[i]-=res,val[i^1]+=res;
	}
	if(!ret)	dep[u]=-1;
	return ret;
}
LL dis[605],ntw[605],pre[605],lid[605];
bool vis[605];
bool BFS()
{
	memset(dis,63,sizeof dis);
	memset(ntw,63,sizeof ntw);
	pre[t]=-1;
	dis[s]=0;
	ntw[s]=1;
	queue<LL> Q;
	Q.push(s);
	while(!Q.empty())
	{
		LL u=Q.front();
		Q.pop();
		vis[u]=false;
		for(LL i=head[u];i;i=nxt[i])
		{
			LL v=to[i],w=val[i],c=cst[i];
			if(w && dis[v]>dis[u]+c)
			{
				ntw[v]=min(ntw[u],w);
				dis[v]=dis[u]+c;
				lid[v]=i;
				pre[v]=u;
				if(!vis[v])	vis[v]=true,Q.push(v);
			}
		}
	}
	return ~pre[t];
}
LL costFlow()
{
	BFS();
	LL u=t,w=ntw[t];
	while(u^s)
	{
		val[lid[u]]-=w;
		val[lid[u]^1]-=w;
		u=pre[u];
	}
	return dis[t];
}
LL f[505][505],g[505][505];
void Solve()
{
	init();
	n=read(),m=read(),K=read();
	s=(n-1)*(m-1)+1,t=s+1;
	for(LL i=1;i<=n;++i)
	{
		for(LL j=1;j<m;++j)
		{
			LL w=read();
			f[i][j]=w;
			LL u,v;
			if(i==1)	u=s;
			else	u=trans(i-1,j);
			if(i==n)	v=t;
			else	v=trans(i,j);
			addEdge(u,v,w,w,0);
			addEdge(u,v,inf,0,1);
			addEdge(v,u,inf,0,1);
		}
	}
	for(LL i=1;i<n;++i)
	{
		for(LL j=1;j<=m;++j)
		{
			LL w=read();
			g[i][j]=w;
			LL u,v;
			if(j==1 || j==m)	continue;
			u=trans(i,j-1),v=trans(i,j);
			addEdge(u,v,w,w,0);
			addEdge(u,v,inf,0,1);
			addEdge(v,u,inf,0,1);
		}
	}
	while(bfs())	Dinic(s,inf);
	LL ans=0;
	for(LL i=1;i<=K;++i)	ans+=costFlow();
	write(ans),etr;
	LL pcnt=1;
	for(LL i=1;i<=n;++i)
	{
		for(LL j=1;j<m;++j)
		{
			pcnt+=2;
			f[i][j]+=inf-val[pcnt+1];
			pcnt+=2;
			f[i][j]+=inf-val[pcnt+1];
			pcnt+=2;
		}
	}
	for(LL i=1;i<n;++i)
	{
		for(LL j=1;j<=m;++j)
		{
			if(j==1 || j==m)	continue;
			pcnt+=2;
			g[i][j]+=inf-val[pcnt+1];
			pcnt+=2;
			g[i][j]+=inf-val[pcnt+1];
			pcnt+=2;
		}
	}
	for(LL i=1;i<=n;++i)	for(LL j=1;j<m;++j)	write(f[i][j]),inlp(j,m-1);
	for(LL i=1;i<n;++i)	for(LL j=1;j<=m;++j)	write(g[i][j]),inlp(j,m);
}
int main(){
	LL T=read();
	while(T-->0)	Solve();
	return 0;
}