#include <bits/stdc++.h>
using namespace std;

struct edge {
  int to;
  int label;
};

vector<pair<int, int>> gabow_edmonds(const vector<vector<int>> &gra){
  // E0 - 初期化
  int N=gra.size();
  vector<vector<edge>> g(N+1);
  vector<pair<int,int>> edges;{
    int cnt=N+1;
    for(int i=0;i<N;i++){
      for(auto to:gra[i]){
        if(i<to){
          g[to+1].push_back({i+1,cnt});
          g[i+1].push_back({to+1,cnt++});
          edges.push_back({i+1,to+1});
        }
      }
    }
  }
  vector<int> mate(N+1,0);
  vector<int> label(N+1,-1);
  vector<int> first(N+1,0);
  queue<int> que;

  // firstの遅延評価
  function<int(int)> eval_first = [&](int x){
    if(label[first[x]] < 0) return first[x];
    first[x] = eval_first(first[x]);
    return first[x];
  };

  // サブルーチンR
  function<void(int, int)> rematch = [&](int v, int w){
    // R1
    int t = mate[v];
    mate[v] = w;
    if(mate[t] != v) return;
    // R2
    if(label[v] <= N){
      mate[t] = label[v];
      rematch(label[v] , t);
    }
    // R3
    else{
      int x = edges[label[v] - N - 1].first;
      int y = edges[label[v] - N - 1].second;
      rematch(x , y);
      rematch(y , x);
    }
  };

  function<void(int, int, int)> assignLabel = [&](int x, int y, int num){
    // L0
    int r = eval_first(x);
    int s = eval_first(y);
    int join = 0;
    if(r == s) return;
    // -numがフラグ
    label[r] = -num;
    label[s] = -num;
    while(true){
      // L1
      if(s != 0) swap(r , s);
      // L2
      r = eval_first(label[mate[r]]);
      if(label[r] == -num){
        join = r;
        break;
      }
      label[r] = -num;
    }
    // L3
    int v = first[x];
    // L4
    while(v != join){
      que.push(v);
      label[v] = num;
      first[v] = join;
      v = first[label[mate[v]]];
    }
    // L3
    v = first[y];
    // L4
    while(v != join){
      que.push(v);
      label[v] = num;
      first[v] = join;
      v = first[label[mate[v]]];
    }
    // L5は遅延評価しているため不要
    // L6
    return;
  };

  function<bool(int)> augment_check = [&](int u){
    // E1 後半
    first[u] = 0;
    label[u] = 0;
    que.push(u);
    while(!que.empty()){
      // E2
      int x = que.front();
      que.pop();
      for(auto e : g[x]){
        int y = e.to;
        // E3
        if(mate[y] == 0 && y != u){
          mate[y] = x;
          rematch(x , y);
          return true;
        }
        // E4
        else if(label[y] >= 0){
          assignLabel(x , y , e.label);
        }
        // E5
        else if(label[mate[y]] < 0){
          label[mate[y]] = x;
          first[mate[y]] = y;
          que.push(mate[y]);
        }
        // E6
      }
    }
    return false;
  };

  for(int i = 1;i <= N;i++){
    // E1
    que = queue<int>();
    if(mate[i] != 0) continue;
    if(augment_check(i)){
      // E7
      fill(label.begin(), label.end(), -1);
    }
  }

  vector<pair<int, int>> ans;
  for(int i = 1;i <= N;i++){
    if(i < mate[i]){
      ans.push_back({i , mate[i]});
    }
  }
  return ans;
}

signed main(){
  int N,M;cin>>N>>M;
  vector<vector<int>> w(N),g(M*2);
  for(int i=0;i<M;i++){
    int K;cin>>K;
    while(K--){
      int a;cin>>a;a--;
      w[a].push_back(i);
    }
  }
  int res=0;
  typedef pair<int,int> P;
  set<P> s;
  for(int i=0;i<N;i++){
    int S=w[i].size();
    if(S==0)res++;
    if(S==1)s.insert(P(w[i][0],w[i][0]));
    if(S==2)s.insert(P(w[i][0],w[i][1]));
  }
  int cnt=0;
  for(auto p:s){
    int u=p.first,v=p.second;
    if(u!=v){
      g[u].push_back(v);
      g[v].push_back(u);
    }
    else{
      g[u].push_back(M+cnt);
      g[M+cnt].push_back(u);
      cnt++;
    }
  }
  cout<<res+gabow_edmonds(g).size()<<endl;
}



Measured memory_bytes: 8480