#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll , int> pr;
namespace FLOW
{
	const int N = 250050 , M = N * 4;
	const ll INF = 0x3f3f3f3f3f3f3f3fll;
	int s , t , tot = 1 , now[N] , head[N]; ll minc , dis[N];
	bool vis[N]; struct Edge{int to , nxt; ll f , w;}e[M * 2];
	void Add(int u , int v , ll f , ll w){e[++tot] = {v , head[u] , f , w} , head[u] = tot;}
	void AddEdge(int u , int v , ll f , ll w = INF)
	{
		Add(u , v , f , w == INF ? 1 : w);
		Add(v , u , 0 , w == INF ? 1 : -w);
	}
	bool BFS()
	{
		queue<int>q;
		memset(dis , 0x3f , sizeof(ll) * (t + 1));
		memset(vis , 0 , sizeof(bool) * (t + 1));
		memcpy(now , head , sizeof(int) * (t + 1));
		dis[s] = 0 , q.push(s);
		while(!q.empty())
		{
			int u = q.front(); q.pop(); vis[u] = 0;
			for(int i = head[u] ; i ; i = e[i].nxt)
			{
				ll v = e[i].to , f = e[i].f , w = e[i].w;
				if(f && dis[u] + w < dis[v])
				{
					dis[v] = dis[u] + w;
					if(!vis[v])q.push(v) , vis[v] = 1;
				}
			}
		}
		return dis[t] != INF;
	}
	ll Dinic(int u , ll flow)
	{
		if(u == t)return flow;
		ll rest = flow;
		vis[u] = 1;
		for(int i = now[u] ; i && rest ; now[u] = i , i = e[i].nxt)
		{
			ll v = e[i].to , f = e[i].f , w = e[i].w;
			if(f && !vis[v] && dis[u] + w == dis[v])
			{
				ll k = Dinic(v , min(f , rest));
				if(!k)dis[v] = -INF;
				e[i].f -= k , e[i ^ 1].f += k;
				rest -= k , minc += k * w;
			}
		}
		vis[u] = 0;
		return flow - rest;
	}
	void Clear()
	{
		memset(head , 0 , sizeof(int) * (t + 1));
		memset(vis , 0 , sizeof(bool) * (t + 1));
		memset(e , 0 , sizeof(Edge) * (tot + 1));
		tot = 1;
	}
}
using FLOW::AddEdge , FLOW::Dinic , FLOW::BFS , FLOW::INF , FLOW::s , FLOW::t , FLOW::e , FLOW::tot , FLOW::minc;
const int N = 505;
int n , m , a[N][N] , b[N][N] , ia[N][N] , ib[N][N]; 
ll dis[N * N] , k; bool vis[N * N];
vector<pair<int , int> >g[N * N];
priority_queue<pr , vector<pr> , greater<pr> >pq;
ll Dijkstra()
{
	int tot = n * m;
	memset(dis , 0x3f , sizeof(ll) * (tot + 1));
	memset(vis , 0 , sizeof(bool) * (tot + 1));
	for(int i = 1 ; i <= n ; i++)
	{
		int u = (i - 1) * m + 1;
		dis[u] = 0 , pq.push({0 , u});
	}
	while(!pq.empty())
	{
		auto [d , u] = pq.top(); pq.pop();
		if(vis[u])continue ;
		vis[u] = 1;
		for(auto [v , w] : g[u])
		{
			if(dis[u] + w < dis[v])
			{
				dis[v] = dis[u] + w;
				pq.push({dis[v] , v});
			}
		}
	}
	ll ans = INF;
	for(int i = 1 ; i <= n ; i++)
	{
		int u = (i - 1) * m + m;
		ans = min(ans , dis[u]);
	}
	return ans;
}
int Solve()
{
	cin >> n >> m >> k;
	auto id = [&](int i , int j){return (i - 1) * m + j;};
	auto adde = [&](int u , int v , int w)
	{
		g[u].push_back({v , w});
		g[v].push_back({u , w});
	};
	s = (n - 1) * (m - 1) + 1 , t = s + 1;
	auto id2 = [&](int i , int j)
	{
		if(i <= 0)return s;
		if(i >= n)return t;
		return (i - 1) * (m - 1) + j;
	};
	auto adde2 = [&](int u , int v , int f)
	{
		AddEdge(u , v , f , 0);
		AddEdge(v , u , f , 0);
		AddEdge(u , v , INF , 1);
		AddEdge(v , u , INF , 1);
		// cerr << u << ' ' << v << " " << f << "\n";
	};
	for(int i = 1 ; i <= n ; i++)
		for(int j = 1 ; j < m ; j++)
		{
			cin >> a[i][j];
			adde(id(i , j) , id(i , j + 1) , a[i][j]);
			adde2(id2(i - 1 , j) , id2(i , j) , a[i][j]);
			ia[i][j] = tot - 3;
		}
	for(int i = 1 ; i < n ; i++)
		for(int j = 1 ; j <= m ; j++)
		{
			cin >> b[i][j];
			adde(id(i , j) , id(i + 1 , j) , b[i][j]);
			if(j > 1 && j < m)
			{
				adde2(id2(i , j - 1) , id2(i , j) , b[i][j]);
				ib[i][j] = tot - 3;
			}
			else ib[i][j] = 0;
		}
	k += Dijkstra();
	// cerr << k << "\n";
	ll flow = 0; minc = 0;
	while(BFS())
	{
		flow += Dinic(s , k - flow);
		// cerr << flow << ',' << minc << "\n";
		if(flow == k)break ;
	}
	cout << minc << "\n";
	for(int i = 1 ; i <= n ; i++)
		for(int j = 1 ; j < m ; j++)
		{
			int id = ia[i][j];
			cout << a[i][j] + e[id + 1].f + e[id + 3].f << " \n"[j == m - 1];
		}
	for(int i = 1 ; i < n ; i++)
		for(int j = 1 ; j <= m ; j++)
		{
			int id = ib[i][j];
			cout << b[i][j] + (id ? e[id + 1].f + e[id + 3].f : 0) << " \n"[j == m];
		}
	FLOW::Clear();
	for(int i = 1 ; i <= n * m ; i++)g[i].clear();
	return 0;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0) , cout.tie(0);
	int T; cin >> T;
	while(T--)Solve();
	return 0;
}