#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cstdio>

using namespace std;
const int maxn = 200 + 18;
const int inf = 1 << 29;
int c[maxn*2][maxn*2],f[maxn*2][maxn*2],n,m,p[maxn*2],pre[maxn*2];
queue<int>q;


int ek(int s,int t)
{
   int flow = 0;
   while(1)
    {
        memset(p,0,sizeof(p));
        pre[s] = 0;
        p[s] = inf;
        q.push(s);
        while(!q.empty())
         {
             int x = q.front();q.pop();
             for(int i = 1 ; i <= n + m + 2; ++ i)
              if (!p[i] && f[x][i] < c[x][i])
               {
                  p[i] = min(p[x],c[x][i] - f[x][i]);
                 pre[i] = x;
                 q.push(i);
              }
         }
        if (!p[t])
         break;
        flow += p[t];
        int k = t;
        while(k)
         {
             f[pre[k]][k] += p[t];
             f[k][pre[k]] -= p[t];
             k = pre[k];
         }    
    }
   return flow;
}

int main(int argc,char *argv[])
{
  scanf("%d%d",&n,&m);
  memset(c,0,sizeof(c));
  memset(f,0,sizeof(f));
  for(int i = 1 ; i <= n ; ++ i)
   {
         int s,v;
         scanf("%d",&s);
         while(s--)
          {
             scanf("%d",&v);
          c[i][v+n] = 1;
       }        
   }
  for(int i = 1 ; i <= n ; ++ i)
   c[n+m+1][i] = 1;
  for(int i = 1 ; i <= m ; ++ i)
   c[i+n][n+m+2] = 1;
  printf("%d\n",ek(n+m+1,n+m+2));
  return 0;
}