1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=3000+5;
 4 const int inf=2147483647;
 5
 6 int s, t;
 7 int n, room, meal;
 8 int cnt = 1;
 9 int last[N];
10 int lev[N];
11 int ans = 0;
12
13 struct edge{
14     int to, next, cap;
15 }e[1000005];
16
17 void add(int x,int y,int z){
18     e[++cnt].to = y;
19     e[cnt].cap = z;
20     e[cnt].next = last[x];
21     last[x] = cnt;
22 }
23
24 bool bfs(){
25     queue <int> q;
26     memset(lev,-1,sizeof(lev));
27     lev[s] = 0 , q.push(s);
28     while(!q.empty()){
29     int x = q.front(); q.pop();
30     for(int i=last[x];i;i=e[i].next){
31         int to = e[i].to;
32         if(lev[to] == -1 && e[i].cap)
33         lev[to] = lev[x]+1 , q.push(to);
34     }
35     }
36     return lev[t] != -1;
37 }
38
39 int dfs(int x,int flow){
40     int rest = 0;
41     if(x == t) return flow;
42     for(int i=last[x];i;i=e[i].next){
43     int to = e[i].to;
44     if(lev[to] == lev[x]+1 && e[i].cap){
45         int f = dfs(to,min(flow-rest , e[i].cap));
46         if(f){
47         rest += f;
48         e[i].cap -= f;
49         e[i^1].cap += f;
50         }
51     }
52     }
53     return rest;
54 }
55
56 int main(){
57     int x; cin >> n >> room >> meal;
58     s = 0; t = n*2+room+meal+1;
59     for(int i=n*2+1;i<=n*2+room;i++) add(s,i,1) , add(i,s,0);
60     for(int i=1;i<=n;i++) add(i,i+n,1) , add(i+n,i,0);
61     for(int i=n*2+room+1;i<t;i++) add(i,t,1) , add(t,i,0);
62     for(int i=1;i<=n;i++)
63     for(int j=n*2+1;j<=n*2+room;j++)
64         cin >> x , add(j,i,x) , add(i,j,0);
65     for(int i=n+1;i<=n*2;i++)
66     for(int j=n*2+room+1;j<t;j++)
67         cin >> x , add(i,j,x) , add(j,i,0);
68     while(bfs()) ans += dfs(s,inf);
69     printf("%d\n",ans);
70     return 0;
71 }