#include <cstdio>
 #include <cstring>
 #include <queue>
 #include <algorithm>
 using namespace std;

 #define INF 0x3f3f3f3f
 ;
 const int maxm = 1e5; 

 int depth[maxn], vis[maxn],cur[maxn], head[maxn];
 int N, F, D;
 int sect,cnt;    //sect为汇点
 struct Edge {
     int v, cap, flow, next;
 }edge[maxm];

 void init(){
     cnt = ;
     memset(head, -, sizeof(head));
 }

 void add(int u, int v, int w){
     edge[cnt].v = v, edge[cnt].cap = w, edge[cnt].flow = ,edge[cnt].next = head[u]; //正向弧(容量为w)
     head[u] = cnt++;
     edge[cnt].v = u, edge[cnt].cap = , edge[cnt].flow = ,edge[cnt].next = head[v]; //反向弧(容量为0)
     head[v] = cnt++;
 }

 void getmap(){
     int tmp1, tmp2;
     ; i <= N; ++i){
         scanf("%d%d", &tmp1, &tmp2);
         while(tmp1--){
             int num;
             scanf("%d", &num);
             add( * N + num, i, );//食物和左牛连接
         }
         while(tmp2--){
             int num;
             scanf("%d", &num);
             add(N + i,  * N + F + num, );//右牛和饮料连接
         }
         add(i, i + N, );//左牛和右牛连接
     }
     sect =  * N + F + D + ;
     ; i <= F; ++i)
         add(,  * N + i, );//源点和食物连接
     ; i <= D; ++i)
         add( * N + F + i,  * N + F + D + , );//饮料和超级汇点连接
 }

 bool BFS(int st, int ed){    //构建分层图，并且判断增广路径是否存在
     queue<int>q;
     memset(depth, -, sizeof(depth));    //将所有点分层，初始化深度为-1
     memset(vis,  ,sizeof(vis));
     q.push(st);
     depth[st] = ;   //源点深度为0
     vis[st] = ;
     while(!q.empty()){
         int u = q.front();
         q.pop();
         ; i = edge[i].next){
             Edge &E = edge[i];
             if(!vis[E.v] && E.cap > E.flow){
                 vis[E.v] = ;
                 depth[E.v] = depth[u] + ;    //下一个点是当前点的深度+1
                 if(E.v == ed) return true;    //找到汇点则直接返回
                 q.push(E.v);
             }
         }
     }
     return false;    //没有找到通向汇点的增广路径
 }

 int DFS(int x, int ed, int val){
     )
         return val;
     , f;
     ; i = edge[i].next){  //注意这里的&符号，这样i增加的同时也能改变cur[u]的值，达到更新当前弧的目的
         Edge E=edge[i];
          && (f = DFS(E.v, ed, min(val, E.cap - E.flow))) > ){  //f为残余网络中增广路径的最小残量
             edge[i].flow += f;    //进行增广
             edge[i ^ ].flow -= f;   //正向流量+f，相当于反向流量-f
             flow += f;
             val -= f;
             ) break;
         }
     }
     return flow;
 }

 int Dinic(int st, int ed){
     ;  //最大流
     while(BFS(st, ed)){     //判断是否存在增广路
         memcpy(cur, head, sizeof(head));    //当前弧优化
         sumflow += DFS(st, ed, INF);
     }
     return sumflow;
 }

 int main (){
     while(scanf("%d%d%d", &N, &F, &D) != EOF){
         init();
         getmap();    //建图
         printf(, sect));
     }
     ;
 }