#include<cstdio>

 #include<algorithm>

 #define N 1010

 #define rg register

 using namespace std;

 int n,m,E,ans,T,tot,last[N],v[N],from[N];

 struct edge{

     int to,pre;

 }e[N*N];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 int dfs(int x){

     for(rg int i=last[x],to;i;i=e[i].pre) if(v[to=e[i].to]!=T){

         v[to]=T;

         if(!from[to]||dfs(from[to])){

             from[to]=x;

             return ;

         }

     }

     return ;

 }

 int main(){

     n=read(); m=read();

     for(rg int i=;i<=n;i++){

         int num=read();

         for(rg int j=;j<=num;j++){

             int v=read();

             e[++tot]=(edge){v,last[i]};last[i]=tot;

         }

     }

     for(rg int i=;i<=n;i++) ++T,ans+=dfs(i);

     printf("%d\n",ans);

     return ;

 }