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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, m;
vector<int> v[500];

int memo[500];

int dfs2(int p) {
	if(memo[p]) { return memo[p]; }
	memo[p] = -1;
	inc(i, v[p].size()) {
		memo[v[p][i]] = dfs2(v[p][i]);
		if(memo[v[p][i]] == -1) { return memo[v[p][i]]; }
	}
	memo[p] = +1;
	return memo[p];
}

int dfs1(int p) {
	inc(i, n) { memo[i] = 0; }
	return dfs2(p);
}

int main() {
	cin >> n >> m;
	inc(i, m) {
		int g, r;
		cin >> g >> r;
		g--;
		inc(j, r) {
			int h;
			cin >> h;
			h--;
			v[g].PB(h);
		}
	}
	
	int ans = n;
	inc(i, n) {
		if(dfs1(i) == -1) { ans--; }
	}
	
	cout << ans << endl;
	
	return 0;
}