1
//二分图最大匹配
2
#include<bits/stdc++.h>
3

4
using namespace std;
5

6
const int N = 510;
7
int head[N], nxt[50010], to[50010], cnt = 1;
8
int n, m, e;
9

10
void add(int x, int y)
11
{
12
  to[++cnt] = y;
13
  nxt[cnt] = head[x];
14
  head[x] = cnt;
15
}
16

17
int vistime[N], match[N];
18

19
bool dfs(int u, int vist)
20
{
21
  if(vistime[u] == vist) return 0;//成环了就不能匹配了
22
  vistime[u] = vist;
23

24
  for(int i = head[u]; i; i = nxt[i])
25
  {
26
    int v = to[i];
27
    if(match[v] == 0 || dfs(match[v], vist))
28
    {
29
      match[v] = u;
30
      return true;
31
    }
32
  }
33
  return 0;
34
}
35

36
int main()
37
{
38
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
39

40
  cin >> n >> m;
41
  for(int i = 1, v, s;i <= n;i++)
42
  {
43
    cin >> s;
44
    for(int j = 1;j <= s;j++)
45
    {
46
      cin >> v;
47
      add(i, v);
48
    }
49
  }
50
  int ans = 0;
51
  for(int i = 1;i <= n;i++)
52
  {
53
    if(dfs(i, i))
54
    {
55
      ans ++;
56
    }
57
  }
58
  cout << ans;
59
  return 0;
60
}