#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

const double PI = 3.1415926535897932384626433832795;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n, m;
	cin >> n >> m;

	vector<vector<int>> graph(n);
	vector<int> indegree(n);
	for (int i = 0; i < m; i++) {
		int g, r;
		cin >> g >> r;
		g--;

		for (int j = 0; j < r; j++) {
			int h;
			cin >> h;
			h--;

			graph[h].push_back(g);
			indegree[g]++;
		}
	}

	queue<int> que;
	for (int i = 0; i < (int)indegree.size(); i++) {
		if (indegree[i] == 0) {
			que.push(i);
		}
	}

	int ans = 0;
	while (!que.empty()) {
		int now = que.front(); que.pop();
		ans++;

		for (auto idx : graph[now]) {
			indegree[idx]--;
			if (indegree[idx] == 0) {
				que.push(idx);
			}
		}
	}

	cout << ans << endl;
	return 0;
}