#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=500+5,M=N*N+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,m,k;
struct yyy{int to,w,g,z;};struct ljb{int head,h[N];yyy f[N*20];void add(int x,int y,int w,int g){f[++head]=(yyy){y,w,g,h[x]};h[x]=head;}}s;
void con(int x,int y,int w,int g){s.add(x,y,w,g);s.add(y,x,-w,0);}
int S,T;
namespace Dicnic{
	int d[N];
	int bfs(){
		queue<int> q;fill(d+S,d+T+1,INF);d[S]=0;q.emplace(S);
		while(!q.empty()){
			int x=q.front();q.pop();yyy tmp;
			for(int i=s.h[x];i;i=tmp.z){
				tmp=s.f[i];if(!tmp.g||d[tmp.to]<=d[x]+tmp.w) continue;
				d[tmp.to]=d[x]+tmp.w;q.emplace(tmp.to);
			}
		}
		return d[T]<INF;
	}
	int vis[N];
	ll dfs(int x,ll sum){//gdb(x,sum);
		if(x==T) return sum;ll tot=0;yyy tmp;vis[x]=1;
		for(int i=s.h[x];i;i=tmp.z){
			tmp=s.f[i];if(!tmp.g||d[tmp.to]!=d[x]+tmp.w||vis[tmp.to]) continue;
			ll k=dfs(tmp.to,min(sum,1ll*tmp.g));if(!k) d[tmp.to]=INF;s.f[i].g-=k;s.f[i^1].g+=k;sum-=k;tot+=k;if(!sum) break;
		}
		vis[x]=0;
		return tot;
	}
	ll calc(){
		ll ans=0;int ti=k;
		while(bfs()&&ti){
			if(!d[T]) dfs(S,1e18);
			else{
				int g=dfs(S,ti);
				ti-=g;ans+=g*d[T];
			}
		}
		return ans;
	}
}
int getid(int x,int y){
	if(!x) return 0;if(x==n) return T;
	return (x-1)*(m-1)+y;
}
int a1[N][N],a2[N][N];
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&k);
	fill(s.h,s.h+n*m+3,0);s.head=1;
	S=0;T=(n-1)*(m-1)+1;
	for(i=1;i<=n;i++) for(j=1;j<m;j++){
		int x;scanf("%d",&x);a1[i][j]=x;
		int ix=getid(i-1,j),iy=getid(i,j);
		con(ix,iy,0,x);con(iy,ix,0,x);
		con(ix,iy,1,k);con(iy,ix,1,k);
	}
	for(i=1;i<n;i++) for(j=1;j<=m;j++){
		int x;scanf("%d",&x);a2[i][j]=x;
		if(j==1||j==m) continue;
		int ix=getid(i,j-1),iy=getid(i,j);
		con(ix,iy,0,x);con(iy,ix,0,x);
		con(ix,iy,1,k);con(iy,ix,1,k);
	}
	printf("%lld\n",Dicnic::calc());
	for(i=1;i<n;i++) for(j=1;j<m;j++){
		int id=getid(i,j);yyy tmp;
		for(int p=s.h[id];p;p=tmp.z){
			tmp=s.f[p];if(tmp.w<=0) continue;
			if(tmp.to==getid(i,j-1)&&j^1) a2[i][j]+=k-tmp.g;
			if(tmp.to==getid(i,j+1)&&j^m-1) a2[i][j+1]+=k-tmp.g;
			if(tmp.to==getid(i-1,j)) a1[i][j]+=k-tmp.g;
			if(tmp.to==getid(i+1,j)) a1[i+1][j]+=k-tmp.g;
		}
	}
	yyy tmp;for(int p=s.h[0];p;p=tmp.z){
		tmp=s.f[p];if(tmp.w<=0) continue;
		for(int i=1;i<m;i++) if(tmp.to==getid(1,i)) a1[1][i]+=k-tmp.g;
	}
	for(i=1;i<=n;i++) for(j=1;j<m;j++) printf("%d%c",a1[i][j]," \n"[j==m-1]);
	for(i=1;i<n;i++) for(j=1;j<=m;j++) printf("%d%c",a2[i][j]," \n"[j==m]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}