#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <cmath>
#define LL long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
#define BitCount(x) __builtin_popcount(x)
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const int MAXN = 200 + 10;
const int MOD = 1e9 + 7;
const int dir[][2] = { {-1, 0}, {1, 0}, {0, -1}, {0, 1} };
 
typedef pair<int, int> pii;
typedef vector<int>::iterator viti;
typedef vector<pii>::iterator vitii;
 
struct EDGE
{
    int from, to;
};
 
int nu, nv, vis[MAXN], link[MAXN], head[MAXN], next[MAXN * MAXN];
vector<EDGE> edges;
 
void AddEdge(int from, int to)
{
    edges.PB((EDGE){from, to});
    int m = SZ(edges);
    next[m - 1] = head[from];
    head[from] = m - 1;
}
 
bool DFS(int u)
{
    for (int i = head[u]; i != -1; i = next[i])
    {
        int &v = edges[i].to;
        if (!vis[v])
        {
            vis[v] = 1;
            if (link[v] == -1 || DFS(link[v]))  //找增广路，反向
            {
                link[v] = edges[i].from;
                return true;
            }
        }
    }
    return false;
}
 
int Hungary()
{
    int res = 0;
    int u;
    MS(link, -1);
    for (u = 1; u <= nu; u++)
    {
        MS(vis, 0);
        if (DFS(u)) res++;
    }
    return res;
}
 
int main()
{
    //ROP;
    int i, j;
    while (~scanf("%d%d", ν, &nv))
    {
        edges.clear();
        MS(head, -1);
        for (i = 1; i <= nu; i++)
        {
            int n;
            scanf("%d", &n);
            while (n--)
            {
                int k;
                scanf("%d", &k);
                AddEdge(i, k);
            }
        }
        printf("%d\n", Hungary());
    }
    return 0;
}