#include<bits/stdc++.h>
using namespace std;
#define int long long
constexpr int N=505,maxn=1805,maxm=1e4+5;
int n,m,k,tot=1,s,t,fir[maxn],nxt[maxm],firr[maxn],val[maxm],cst[maxm],to[maxm];
inline void addedge(int u,int v,int w,int c){
    nxt[++tot]=firr[u],firr[u]=tot,val[tot]=w,to[tot]=v,cst[tot]=c;
}
inline void add(int u,int v,int w,int c){addedge(u,v,w,c),addedge(v,u,0,-c);}
typedef long long ll;
int dis[maxn];bool vis[maxn];
namespace dinic{
    bool bfs(){
        memset(dis,0,sizeof dis);
        memcpy(fir,firr,sizeof fir);
        dis[s]=1;
        queue<int> q;
        q.push(s);
        while(!q.empty()){
            int p=q.front();q.pop();
            if(p==t) return 1;
            for(int i=fir[p];i;i=nxt[i])if(!dis[to[i]]&&val[i]) dis[to[i]]=dis[p]+1,q.push(to[i]); 
        }
        return 0;
    }
    int dinic(int p,int fl){
        if(p==t) return fl;
        int res=0;
        for(int &i=fir[p];i;i=nxt[i])if(val[i]&&dis[to[i]]==dis[p]+1){
            int z=dinic(to[i],min(fl,val[i]));
            val[i]-=z,val[i^1]+=z,res+=z,fl-=z;
        }
        if(!res) dis[p]=0;
        return res;
    }
}
namespace MCMF{
    bool bfs(){
        memset(dis,0x3f,sizeof dis);
        memcpy(fir,firr,sizeof fir);
        dis[s]=0;
        queue<int> q;int z=dis[1];
        q.push(s);vis[s]=1;
        while(!q.empty()){
            int p=q.front();q.pop();vis[p]=0;
            for(int i=fir[p];i;i=nxt[i])if(dis[to[i]]>dis[p]+cst[i]&&val[i]){
                dis[to[i]]=dis[p]+cst[i];
                if(!vis[to[i]])q.push(to[i]),vis[to[i]]=1; 
            }
        }
        return dis[t]<z;
    }
    int cost=0;
    int dinic(int p,int fl){
        if(p==t) return fl;
        vis[p]=1;
        int res=0;
        for(int &i=fir[p];i;i=nxt[i])if(!vis[to[i]]&&val[i]&&dis[to[i]]==dis[p]+cst[i]){
            int z=dinic(to[i],min(fl,val[i]));cost+=cst[i]*1ll*z;
            val[i]-=z,val[i^1]+=z,res+=z,fl-=z;
        }
        if(!res) dis[p]=1e9;vis[p]=0;
        return res;
    }
}
constexpr int inf=2e9;
int rs[N][N],cs[N][N];
int ori[N][N],oci[N][N];
inline void solve(){
    cin>>n>>m>>k;n++,m--;
    s=0,t=n*m+1;
    for(int i=0;i<=n*m+2;i++) firr[i]=0;tot=1;
    auto f=[&](int x,int y){return (x-1)*m+y;};
    int S=t+1;add(s,S,inf,0);add(S,s,0,0);
    for(int i=1;i<=m;i++) add(S,f(1,i),inf,0),add(f(n,i),t,inf,0);
    for(int i=1;i<n;i++)
    for(int j=1;j<=m;j++){
        int x;cin>>x;oci[i][j]=x;
        add(f(i,j),f(i+1,j),x,0);
        add(f(i+1,j),f(i,j),x,0);
    }
    for(int i=2;i<n;i++)
    for(int j=0;j<=m;j++){
        int x;cin>>x;
        ori[i][j]=x;
        if(j==0||j==m) continue;
        add(f(i,j),f(i,j+1),x,0);
        add(f(i,j+1),f(i,j),x,0);
    }
    int cur=0;
    while(dinic::bfs()) cur+=dinic::dinic(s,inf);
    val[2]=k;
    for(int i=2;i<n;i++)
    for(int j=1;j<m;j++) add(f(i,j),f(i,j+1),inf,1),add(f(i,j+1),f(i,j),inf,1),rs[i][j]=tot;
    for(int i=1;i<n;i++)
    for(int j=1;j<=m;j++) add(f(i,j),f(i+1,j),inf,1), add(f(i+1,j),f(i,j),inf,1),cs[i][j]=tot;
    cur=0;
    while(MCMF::bfs()) cur+=MCMF::dinic(s,1e9);
    assert(cur==k);
    cout<<MCMF::cost<<'\n';MCMF::cost=0;
    for(int i=1;i<n;i++,cout<<'\n')
    for(int j=1;j<=m;j++) cout<<max(val[cs[i][j]],val[cs[i][j]-2])+oci[i][j]<<' ';
    for(int i=2;i<n;i++,cout<<'\n')
    for(int j=0;j<=m;j++){
        if(!j||j==m) cout<<ori[i][j]<<' ';
        else cout<<ori[i][j]+max(val[rs[i][j]],val[rs[i][j]-2])<<' ';
    }
}
main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--) solve();
}