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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}


int nextInt() { int x; scanf("%d", &x); return x;}

const int MAX_N = 510;
vector<int> graph[MAX_N];

int main2() {
  REP(i, MAX_N) graph[i].clear();

  int N = nextInt();
  int M = nextInt();
  vector<int> size(N);
    REP(mmm, M) {
    int gi = nextInt() - 1;
    int R = nextInt();
    REP(i, R) {
      int oi = nextInt() - 1;
      graph[oi].push_back(gi);
      size[gi]++;
    }
  }
  int ans = 0;
  for (;;) {
    bool change = false;
    REP(i, N) if (size[i] == 0) {
      size[i] = -1;
      ans++;
      for (int v : graph[i]) size[v]--;
      change = true;
    }
    if (!change) break;
  }
  cout << ans << endl;
  return 0;
}

int main() {
  for (;!cin.eof();cin>>ws)
    main2();
  return 0;
}