#include <iostream>
#include  <cstdlib>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define inf 30005
#define maxn 505
int n,i;
int father[inf];
int rank[inf];
int a[inf];
using namespace std;
void start()
{
    for(i=0;i<=n-1;i++)
    {
        father[i]=i;
        rank[i]=1;
    }
}
int find(int x)
{
    int r=x;
    while(father[r]!=r)
    {
        r=father[r];
    }
    return r;
}
void join(int x,int y)
{
    int fx=find(x);
    int fy=find(y);
    if(fx==fy) return ;
    if(rank[fx]>=rank[fy])
    {
        father[fy]=fx;
        rank[fx]+=rank[fy];
    }
    else
    {
        father[fx]=fy;
        rank[fy]+=rank[fx];
    }
}
int main()
{
    void join(int x,int y);
    int find(int x);
    void start();
    int m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0&&m==0) break;
        start();
        while(m--)
        {
            int t;
            scanf("%d",&t);
           // memset(a,0,sizeof(a));
            for(i=0; i<t; i++ )
            {
                scanf("%d",&a[i]);
                if(i!=0) join(a[i-1],a[i]);
            }
        }
        printf("%d\n",rank[find(0)]);
    }
    return 0;
}