uva 10779

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int INF = 0x3f3f3f3f;
struct node{
	int to,next,flow;
}e[1000010];
int a[100010],b[100010],d[10010];
int S,T;
int head[10010],cnt,cur[100010],num[1010][1010];
void add_edge(int from,int to,int flow){
	e[cnt].to = to;
	e[cnt].flow = flow;
	e[cnt].next = head[from];
	head[from] = cnt++;
	
	e[cnt].to = from;
	e[cnt].flow = 0;
	e[cnt].next = head[to];
	head[to] = cnt++; 
}
int bfs(){
	memset(d,0,sizeof(d));
	queue<int>q;
	q.push(S);
	d[S] = 1;
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int i = head[u]; i != -1; i = e[i].next){
			int v = e[i].to;
			if(!d[v] && e[i].flow){
				d[v] = d[u] + 1;
				if(v == T) return 1;
				q.push(v);
			}
		}
	}
	return 0;
}
int dfs(int u,int flow){
	int cost = 0;
	if(u == T) return flow;
	for(int &i = cur[u]; i != -1; i = e[i].next){
		int v = e[i].to;
		if(d[v] == d[u] + 1 && e[i].flow){
			int t =dfs(v,min(flow - cost,e[i].flow));
			if(t){
				e[i].flow -= t;
				e[i^1].flow += t;
				cost += t;
				if(flow == cost) break;
			}
		}
	}
	return cost;
}
int Dinic(){
	int res = 0;
	while(bfs()){
		for(int i = 0; i <= T; i++) cur[i] = head[i];
		res += dfs(S,INF);
	}
	return res;
}
int main(){
	int t,tt=1,n,m,a,b;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		memset(head,-1,sizeof(head));
		memset(num,0,sizeof(num));
		cnt = 0;
		S = 0; T = n + m;
		for(int i = 1; i <= n; i++){
			scanf("%d",&a);
			for(int j = 1; j <= a; j++){
				scanf("%d",&b);
				num[i][b]++;
			}
		}
		for(int i = 1; i <= m; i++){
			add_edge(S,i,num[1][i]);
			add_edge(i,T,1);
		}
		for(int i = 2; i <= n; i++){
			for(int j = 1; j <= m; j++){
				if(num[i][j] > 1) add_edge(m + i - 1,j, num[i][j] - 1);
				if(!num[i][j]) add_edge(j, m + i - 1,1);
			}
		}
		printf("Case #%d: %d\n",tt++,Dinic()); 
	}
    return 0; 
}