/*By DennyQi*/
#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
#define  r  read()
#define  Max(a,b)  (((a)>(b)) ? (a) : (b))
#define  Min(a,b)  (((a)<(b)) ? (a) : (b))
using namespace std;
typedef long long ll;
const int MAXN = 2010;
const int MAXM = 100010;
const int INF = 1061109567;
inline int read(){int x = 0; int w = 1; register int c = getchar();while(c ^ '-' && (c < '0' || c > '9')) c = getchar();if(c == '-') w = -1, c = getchar();while(c >= '0' && c <= '9') x = (x << 3) +(x << 1) + c - '0', c = getchar(); return x * w;
}
int N,P,Q,S,T,x;
int first[MAXM*2],nxt[MAXM*2],to[MAXM*2],cap[MAXM*2],flow[MAXM*2],num_edge=-1;
int level[MAXN],cur[MAXN];
queue <int> q;
inline void add(int u, int v, int c, int f){to[++num_edge] = v;cap[num_edge] = c;flow[num_edge] = f;nxt[num_edge] = first[u];first[u] = num_edge;
}
inline bool BFS(){memset(level, 0, sizeof(level));while(!q.empty()) q.pop();q.push(S);level[S] = 1;int u,v;while(!q.empty()){u = q.front(); q.pop();for(int i = first[u]; i != -1; i = nxt[i]){v = to[i];if(!level[v] && cap[i]-flow[i] > 0){level[v] = level[u] + 1;q.push(v);}}}return level[T]!=0;
}
int DFS(int u, int a){if(u == T || a == 0) return a;int ans = 0,v,_f;for(int& i = cur[u]; i != -1; i = nxt[i]){v = to[i];if(level[u]+1==level[v] && cap[i]-flow[i] > 0){_f = DFS(v, Min(a, cap[i]-flow[i]));ans += _f, a -= _f;flow[i] += _f, flow[i^1] -= _f;if(a == 0) break;}}return ans;
}
inline void Dinic(){int ans = 0;while(BFS()){for(int i = S; i <= T; ++i) cur[i] = first[i];ans += DFS(S, INF);}printf("%d", ans);
}
int main(){N=r,P=r,Q=r;S=0, T = 2*N+P+Q+2;memset(first, -1, sizeof(first));for(int i = 1; i <= P; ++i){add(S, i+2*N, 1, 0);add(i+2*N, S, 0, 0);}for(int i = 1; i <= N; ++i){for(int j = 1; j <= P; ++j){x=r;if(x){add(j+2*N, i, 1, 0);add(i, j+2*N, 0, 0);}}}for(int i = 1; i <= N; ++i){add(i, i+N, 1, 0);add(i+N, i, 0, 0);}for(int i = 1; i <= N; ++i){for(int j = 1; j <= Q; ++j){x=r;if(x){add(i+N, j+P+2*N, 1, 0);add(j+P+2*N, i+N, 0, 0);}}}for(int i = 1; i <= Q; ++i){add(P+2*N+i, T, 1, 0);add(T, P+2*N+i, 0, 0);}Dinic();return 0;
}