/* -*- coding: utf-8 -*-
 *
 * 679.cc: No.679 不思議マーケット - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 500;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;

/* global variables */

vi deps[MAX_N];
int rs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    int gi, ri;
    scanf("%d%d", &gi, &ri);
    gi--;
    rs[gi] = ri;

    for (int j = 0; j < ri; j++) {
      int hj;
      scanf("%d", &hj);
      hj--;
      deps[hj].push_back(gi);
    }
  }

  qi q;
  for (int i = 0; i < n; i++)
    if (rs[i] == 0) q.push(i);
  int cnt = 0;

  while (! q.empty()) {
    int u = q.front(); q.pop();
    cnt++;

    vi &depu = deps[u];
    for (vi::iterator vit = depu.begin(); vit != depu.end(); vit++) {
      int &v = *vit;
      if (--rs[v] == 0) q.push(v);
    }
  }

  printf("%d\n", cnt);
  return 0;
}