#include <iostream>

#include <memory.h>

#include <string>

#include <istream>

#include <sstream>

#include <vector>

#include <stack>

#include <algorithm>

#include <map>

#include <queue>

#include <math.h>

#include <cstdio>

#include <set>

#include <iterator>

#include <cstring>

using namespace std;

typedef long long LL;

const int MAXN = 2000+10;

vector<int> G[MAXN];

int Link[MAXN], Vis[MAXN];

int n, m;

void Init()

{

    for (int i = 1;i <= n;i++)

        G[i].clear();

}

bool Dfs(int x)

{

    for (int i = 0;i < G[x].size();i++)

    {

        int node = G[x][i];

        if (Vis[node])

            continue;

        Vis[node] = 1;

        if (Link[node] == -1 || Dfs(Link[node]))

        {

            Link[node] = x;

            return true;

        }

    }

    return false;

}

int Solve()

{

    memset(Link, -1, sizeof(Link));

    int cnt = 0;

    for (int i = 1;i <= n;i++)

    {

        memset(Vis, 0, sizeof(Vis));

        if (Dfs(i))

            cnt++;

    }

    return cnt;

}

int main()

{

    while (cin >> n && n)

    {

        Init();

        cin >> m;

        int num, r;

        for (int i = 1;i <= m;i++)

        {

            cin >> num;

            while (num--)

            {

                cin >> r;

                G[r].push_back(i);

            }

        }

        int cnt = Solve();

        cout << cnt << endl;

    }

    return 0;

}