/*1274 Accepted 424K 16MS G++ 946B 2010-07-29 15:33:19 */
#include<stdio.h>
#include<string.h>
#define arr 201
int N,M,pre[arr];
bool map[arr][arr],used[arr];
bool find(int x)
{
     int i;
     for(i=1;i<=M;i++)
     {
         if(!used[i]&&map[x][i])
         {
             used[i]=1;
             if(pre[i]==-1||find(pre[i]))
             {
                pre[i]=x;
                return 1;
             }
         }
     }
     return 0;
}
int MMG()
{
    int i,count=0;
    memset(pre,-1,sizeof(pre));
    for(i=1;i<=N;i++)
    {
        memset(used,0,sizeof(used));
        if(find(i))
        count++;
    }
    return count;
}
int main()
{
    int i,j,t,num;
    while(scanf("%d%d",&N,&M)!=EOF)
    {
        memset(map,0,sizeof(map));
        for(i=1;i<=N;i++)
        {
            scanf("%d",&num);
            for(j=1;j<=num;j++)
            scanf("%d",&t),map[i][t]=1;
        }
        int ans=MMG();
        printf("%d\n",ans);
    }
}