1 #include<cstdio>
  2 #include<cstring>
  3 #include<queue>
  4 using namespace std;
  5 #define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);
  6 #define LL long long
  7 #define ULL unsigned LL
  8 #define fi first
  9 #define se second
 10 #define pb push_back
 11 #define lson l,m,rt<<1
 12 #define rson m+1,r,rt<<1|1
 13 #define lch(x) tr[x].son[0]
 14 #define rch(x) tr[x].son[1]
 15 #define max3(a,b,c) max(a,max(b,c))
 16 #define min3(a,b,c) min(a,min(b,c))
 17 typedef pair<int,int> pll;
 18 const int inf = 0x3f3f3f3f;
 19 const LL INF = 0x3f3f3f3f3f3f3f3f;
 20 const LL mod =  (int)1e9+7;
 21 const int N = 500;
 22 const int M = N * N;///edge
 23 int head[N], deep[N], cur[N];
 24 int w[M], to[M], nx[M];
 25 int tot;
 26 void add(int u, int v, int val){
 27     w[tot]  = val; to[tot] = v;
 28     nx[tot] = head[u]; head[u] = tot++;
 29
 30     w[tot]  = 0; to[tot] = u;
 31     nx[tot] = head[v]; head[v] = tot++;
 32 }
 33 int bfs(int s, int t){
 34     queue<int> q;
 35     memset(deep, 0, sizeof(deep));
 36     q.push(s);
 37     deep[s] = 1;
 38     while(!q.empty()){
 39         int u = q.front();
 40         q.pop();
 41         for(int i = head[u]; ~i; i = nx[i]){
 42             if(w[i] > 0 && deep[to[i]] == 0){
 43                 deep[to[i]] = deep[u] + 1;
 44                 q.push(to[i]);
 45             }
 46         }
 47     }
 48     return deep[t] > 0;
 49 }
 50 int Dfs(int u, int t, int flow){
 51     if(u == t) return flow;
 52     for(int &i = cur[u]; ~i; i = nx[i]){
 53         if(deep[u]+1 == deep[to[i]] && w[i] > 0){
 54             int di = Dfs(to[i], t, min(w[i], flow));
 55             if(di > 0){
 56                 w[i] -= di, w[i^1] += di;
 57                 return di;
 58             }
 59         }
 60     }
 61     return 0;
 62 }
 63
 64 int Dinic(int s, int t){
 65     int ans = 0, tmp;
 66     while(bfs(s, t)){
 67         for(int i = s; i <= t; i++) cur[i] = head[i];
 68         while(tmp = Dfs(s, t, inf)) ans += tmp;
 69     }
 70     return ans;
 71 }
 72 void init(){
 73     memset(head, -1, sizeof(head));
 74     tot = 0;
 75 }
 76 int main(){
 77     int n, f, d;
 78     init();
 79     scanf("%d%d%d", &n, &f, &d);
 80     int s = 0, t = f + d + 2 * n + 1;
 81     for(int i = 1; i <= f; i++)
 82         add(s, 2*n+i, 1);
 83     for(int i = 1; i <= d; i++)
 84         add(2*n+i+f, t, 1);
 85     int F, D, tmp;
 86     for(int i = 1; i <= n; i++){
 87         add(i, i+n, 1);
 88         scanf("%d%d", &F, &D);
 89         while(F--){
 90             scanf("%d", &tmp);
 91             add(tmp+2*n, i, 1);
 92         }
 93         while(D--){
 94             scanf("%d", &tmp);
 95             add(n+i,tmp+2*n+f,1);
 96         }
 97     }
 98     printf("%d\n", Dinic(s,t));
 99     return 0;
100 }