#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector<vector<int>> g(N);
	vector<int> indeg(N);
	REP(i, M) {
		int a, r;
		scanf("%d %d", &a, &r);
		--a;
		indeg[a] = r;
		REP(j, r) {
			int h;
			scanf("%d", &h);
			g[h - 1].emplace_back(a);
		}
	}
	
	int ans = 0;
	queue<int> que;
	REP(i, N) if (indeg[i] == 0) que.emplace(i);
	while (!que.empty()) {
		int u = que.front(); que.pop();
		++ans;
		for (int v : g[u]) if (--indeg[v] == 0) que.emplace(v);
	}
	cout << ans << endl;
}