#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
#define N 5050
#define INF 0x3ffffffstruct node
{int to,next,w,c;
}edge[N*100];int n,m,k;
int s,t;
int sn[N][N],sm[N][N];
int cnt,pre[N];
int que[N*1000];
int point[N],pedge[N];
int mxf;void add_edge(int u,int v,int w,int c)
{edge[cnt].to=v;edge[cnt].w=w;edge[cnt].c=c;edge[cnt].next = pre[u];pre[u]=cnt++;
}int spfa()
{int qd=0,qf=1;int dis[N];int mark[N];memset(point,-1,sizeof(point));memset(pedge,-1,sizeof(pedge));for(int i=0;i<=t;i++){dis[i]=INF;mark[i]=0;}dis[s]=0;que[0]=s;mark[s]=1;while(qf>qd){int cur=que[qd++];mark[cur]=0;for(int p=pre[cur];p!=-1;p = edge[p].next){int v=edge[p].to;int c=edge[p].c;int w=edge[p].w;if(w==0) continue;if( dis[v]>dis[cur]+c ){dis[v]=dis[cur]+c;point[v]=cur;pedge[v]=p;if(mark[v]==0){mark[v]=1;que[qf++]=v;}}}}if( dis[t] == INF ) return 0;else return 1;
}int fuc()
{int sum=0;int mi=INF;int tmp=t;while(tmp!=s){int p=pedge[tmp];if(edge[p].w<mi) mi=edge[p].w;tmp=point[tmp];}tmp=t;mxf += mi;while(tmp!=s){int p=pedge[tmp];edge[p].w -= mi;edge[p^1].w += mi;sum += mi*edge[p].c;tmp=point[tmp];}return sum;
}int main()
{int ans;while(scanf("%d%d%d",&n,&m,&k)&&(n+m+k)){int sum=0;mxf=0;ans=0;for(int i=1;i<=n;i++)for(int j=1;j<=k;j++){scanf("%d",&sn[i][j]);ans += sn[i][j];}for(int i=1;i<=m;i++)for(int j=1;j<=k;j++)scanf("%d",&sm[i][j]);for(int i=1;i<=k;i++){cnt=0;memset(pre,-1,sizeof(pre));s=0;t=n+m+1;for(int j=1;j<=n;j++){add_edge(s,j,sn[j][i],0);add_edge(j,s,0,0);}for(int j=1;j<=m;j++){add_edge(n+j,t,sm[j][i],0);add_edge(t,n+j,0,0);}for(int j=1;j<=n;j++)for(int i1=1;i1<=m;i1++){int tmp;scanf("%d",&tmp);add_edge(j,n+i1,INF,tmp);add_edge(n+i1,j,0,-tmp);}while(spfa()){sum += fuc();}}if( mxf != ans ) printf("-1\n");else printf("%d\n",sum);}return 0;
}