1 #include<stdio.h>
  2 #include<algorithm>
  3 #include<string.h>
  4 #include<queue>
  5 using namespace std;
  6 struct Dinic
  7 {
  8     static const int MAXN = 1025 + 7; ///改网络流的点
  9     static const int MAXM = MAXN * MAXN; ///改网络流的边
 10     static const int INF = 0x3f3f3f3f; ///看情况改
 11 
 12     int n, m, s, t;
 13     int first[MAXN], cur[MAXN], dist[MAXN], sign;
 14 
 15     struct Node
 16     {
 17         int to, flow, next;
 18     } edge[MAXM * 4];
 19 
 20     inline void init(int start, int vertex, int ss, int tt)
 21     {
 22         n = vertex, s = ss, t = tt;
 23         for(int i = start; i <= n; i++ )
 24         {
 25             first[i] = -1;
 26         }
 27         sign = 0;
 28     }
 29     inline void add_edge(int u, int v, int flow)
 30     {
 31         edge[sign].to = v, edge[sign].flow = flow, edge[sign].next = first[u];
 32         first[u] = sign++;
 33         edge[sign].to = u, edge[sign].flow = 0, edge[sign].next = first[v];
 34         first[v] = sign++;
 35     }
 36 
 37     inline int dinic()
 38     {
 39         int max_flow = 0;
 40         while(bfs(s, t))
 41         {
 42             for(int i = 0; i <= n; i++ )
 43             {
 44                 cur[i] = first[i];
 45             }
 46             max_flow += dfs(s, INF);
 47         }
 48         return max_flow;
 49     }
 50     bool bfs(int s, int t)
 51     {
 52         memset(dist, -1, sizeof(dist));
 53         queue<int>que;
 54         que.push(s), dist[s] = 0;
 55         while(!que.empty())
 56         {
 57             int now = que.front();
 58             que.pop();
 59             if(now == t)
 60             {
 61                 return 1;
 62             }
 63             for(int i = first[now]; ~i; i = edge[i].next)
 64             {
 65                 int to = edge[i].to, flow = edge[i].flow;
 66                 if(dist[to] == -1 && flow > 0)
 67                 {
 68                     dist[to] = dist[now] + 1;
 69                     que.push(to);
 70                 }
 71             }
 72         }
 73         return 0;
 74     }
 75     int dfs(int now, int max_flow)
 76     {
 77         if(now == t)
 78         {
 79             return max_flow;
 80         }
 81         int ans = 0, next_flow = 0;
 82         for(int &i = cur[now]; ~i; i = edge[i].next)
 83         {
 84             int to = edge[i].to, flow = edge[i].flow;
 85             if(dist[to] == dist[now] + 1 && flow > 0)
 86             {
 87                 next_flow = dfs(to, min(max_flow - ans, flow));
 88                 ans += next_flow;
 89                 edge[i].flow -= next_flow;
 90                 edge[i ^ 1].flow += next_flow;
 91                 if(ans == max_flow)
 92                 {
 93                     return max_flow;
 94                 }
 95             }
 96         }
 97         if(ans == 0)
 98         {
 99             return dist[now] = 0;
100         }
101         return ans;
102     }
103 
104 } dinic;
105 
106 /**
107 .init(点编号起点, 点编号终点, 源点, 汇点)
108 .add_edge(u, v, w) 加边
109 .dinic() 输出最大流
110 */
111 
112 int a[1200],b[2000];
113 int main()
114 {
115     int t,p,f,c;
116     scanf("%d",&t);
117     while(t--)
118     {
119         int s=0,t=1000;
120         dinic.init(s,t,s,t);
121 
122         scanf("%d%d%d",&p,&f,&c);
123         for(int i=1; i<=f; i++) ///s->车
124             dinic.add_edge(s,i,1);
125             for(int i=1;i<=p;i++)
126                 dinic.add_edge(i+200,i+400,1);
127         for(int i=1; i<=c; i++)
128             dinic.add_edge(i+600,t,1); ///枪->t
129         for(int i=1; i<=p; i++)
130         {
131             int x,y;
132             scanf("%d%d",&x,&y);
133             for(int j=1; j<=x; j++) ///车
134             {
135                 int z;
136                 scanf("%d",&z);
137                 dinic.add_edge(z,i+200,1);
138             }
139             for(int j=1; j<=y; j++)
140             {
141                  int z;
142                 scanf("%d",&z);
143                 dinic.add_edge(i+400,z+600,1);
144             }
145         }
146         printf("%d\n",dinic.dinic());
147     }
148     return 0;
149 }