#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

template<int MAX_V>
class SCC {
  vector<int> G[MAX_V];
  vector<int> rG[MAX_V];
  vector<int> vs;
  bool used[MAX_V];

  int V;
  vector<int> cmp;

  void dfs(int v){
    used[v] = true;
    for(int i=0; i<G[v].size(); i++)
      if(!used[G[v][i]]) dfs(G[v][i]);
    vs.push_back(v);
  }
  
  void rdfs(int v, int k){
    used[v] = true;
    cmp[v] = k;
    for(int i=0; i<rG[v].size(); i++)
      if(!used[rG[v][i]]) rdfs(rG[v][i], k);
  }
public:
  SCC(int V):V(V),cmp(V){}

  int size(){ return V; }

  vector<int> get_edge(int from){ return G[from]; }
  vector<int> get_cmp(){ return cmp; }
  
  void add_edge(int from, int to){
    G[from].push_back(to);
    rG[to].push_back(from);
  }
  
  int calc(){
    for(int i=0; i<MAX_V; i++) used[i] = 0;
    vs.clear();
    for(int v=0; v<V; v++)
      if(!used[v]) dfs(v);
    for(int i=0; i<MAX_V; i++) used[i] = 0;
    int k = 0;
    for(int i=vs.size()-1; i>=0; i--)
      if(!used[vs[i]]) rdfs(vs[i], k++);
    return k;
  }
};


int main(){
  int n, m;
  cin >> n >> m;

  vector<vector<int>> memo(n);
  
  SCC<505> scc(n);
  rep(i,m){
    int g, r;
    cin >> g >> r;
    g--;
    vector<int> h(r);
    rep(j,r){
      cin >> h[j];
      h[j]--;
      scc.add_edge(h[j],g);
    }
    memo[g] = h;
  }

  scc.calc();
  vector<int> ret = scc.get_cmp();
  vector<pair<int,int>> v;
  rep(i,ret.size()){
    v.emplace_back(ret[i],i);
  }
  sort(ALLOF(v));

  map<int,int> get;
  rep(i,v.size()){
    int x = v[i].second;
    if(memo[x].size() == 0) get[x] = 1;
    else{
      bool flg = true;
      rep(j,memo[x].size()){
        if(get.count(memo[x][j])==0) flg = false;
      }
      if(flg) get[x] = 1;
    }
  }

  cout << get.size() << endl;
  
  return 0;
}