#include <cstdio>

#include <iostream>

#include <queue>

using namespace std;

#define sf scanf

#define pf printf

#define debug printf("!\n")

#define blank printf("\n")

#define mem(a,b) memset(a,b,sizeof(a))

const int MaxN = ;

const int INF = <<;

int p[MaxN],a[MaxN];

int m,n;

int find(int x){return p[x]==x?x:p[x]=find(p[x]);}

void Union(int x,int y)

{

          int rx = find(x);

          int ry = find(y);

          p[rx] = ry;

}

int main()

{

    int i,j,k;

    while(~scanf("%d%d",&n,&m),n+m)

    {

        i = ;

        mem(p,);

        mem(a,);

        for(j=;j<n;j++)

                              p[j] = j;

        while(m--)

        {

                  sf("%d",&k);

                  for(i=;i<k;i++)

                  {

                                        sf("%d",&a[i]);

                  }

                  for(i=;i<k;i++)

                  {

                                        Union(a[i-],a[i]);

                  }

        }

        int cnt = ;

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

                    {

                              if(find(i)==find())

                                        cnt++;

                    }

                    pf("%d\n",cnt);

    }

    return ;

}