gaz_N5

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

int n, k;
vector <vector <int> > G;


bool in_it(vector <int> a, vector <int> b) {//a inside b
    if (a.size() > b.size()) {
        return 0;
    }
    for (int i = 0; i < a.size(); ++i) {
        if (a[i] != b[i]) {
            return 0;
        }
    }
    return 1;
}

vector <bool> in, out;

void dfs(int v) {
    in[v] = 1;
    for (int u: G[v]) {
        if (in[u]) {
            continue;
        }
        out[v] = 1;
        dfs(u);
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    G.resize(n);
    vector <vector <int> > ing(n);
    for (int i = 0; i < n; ++i) {
        int m; cin >> m;
        for (int j = 0; j < m; ++j) {
            int x; cin >> x;
            ing[i].pb(x);
        }
        sort(ing[i].begin(), ing[i].end());
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n && j != n; ++j) {
            if (in_it(ing[i], ing[j])) {
                G[i].pb(j);
            }
            if (in_it(ing[j], ing[i])) {
                G[j].pb(i);
            }
        }
    }
    in.resize(n, 0);
    out.resize(n, 0);
    for (int i = 0; i < n; ++i) {
        if (in[i]) {
            continue;
        }
        dfs(i);
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (!out[i]) {
            ans++;
        }
    }
    cout << ans;
}