#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#include<set>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef pair<int,set<int> > PP;
bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}

bool contain(set<int> a,set<int> b){
  for(auto itr = b.begin();itr!=b.end();++itr){
    if(!a.count(*itr))
      return false;
  }
  return true;
}

int main()
{
  int n,m,gi,ri,h,res=0,f;
  set<int> shohin;
  cin >> n >> m;
  res += n-m;
  vector<PP>g(0);
  REP(i,m){
    cin >> gi >> ri;
    set<int> e;
    REP(j,ri){
      cin >> h;
      e.insert(h);
    }
    g.push_back(PP(gi,e));
  }
  REP(i,n){
    shohin.insert(i+1);
  }
  REP(i,m){
    shohin.erase(g[i].first);
  }
  REP(i,m){
    REP(j,g.size()){
      if(contain(shohin,g[j].second)){
        shohin.insert(g[j].first);
        g.erase(g.begin()+j);
        res++;
        break;
      }
    }
  }
  cout << res << endl;
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}