#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int MAX_V = 500;

int V;
vector<int> G[MAX_V];
vector<int> rG[MAX_V];
vector<int> vs;
bool used[MAX_V];
int cmp[MAX_V];

void add_edge(int from, int to) {
    G[from].push_back(to);
    rG[to].push_back(from);
}

void dfs(int v) {
    used[v] = true;
    for (int i = 0; i < G[v].size(); i++) {
        if (!used[G[v][i]]) dfs(G[v][i]);
    }
    vs.push_back(v);
}

void rdfs(int v, int k) {
    used[v] = true;
    cmp[v] = k;
    for (int i = 0; i < rG[v].size(); i++) {
        if (!used[rG[v][i]]) rdfs(rG[v][i], k);
    }
}

int scc() {
    memset(used, 0, sizeof(used));
    vs.clear();
    for (int v = 0; v < V; v++) {
        if (!used[v]) dfs(v);
    }
    memset(used, 0, sizeof(used));
    int k = 0;
    for (int i = (int)vs.size() - 1; i >= 0; i--) {
        if (!used[vs[i]]) rdfs(vs[i], k++);
    }
    return k;
}

void dfs2(int cur, vector<int>& cnt, vector<int>& used2, int& ans) {
    ans++;
    used2[cur] = true;
    for (int i : G[cur]) {
        if (used2[i] || cnt[i] != 1) continue;
        dfs2(i, cnt, used2, ans);
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    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--;
            add_edge(h, g);
        }
    }

    V = n;
    int num = scc();
    vector<int> cnt(num, 0);
    for (int i = 0; i < n; i++) {
        cnt[cmp[i]]++;
    }
    int ans = 0;

    vector<int> used2(n, false);
    for (int i = (int)vs.size() - 1; i >= 0; i--) {
        if (used2[vs[i]] || cnt[vs[i]] != 1) continue;
        dfs2(vs[i], cnt, used2, ans);
    }
    cout << ans << endl;
    return 0;
}