#include <iostream> #include <cstring> #include <vector> #include <cmath> #include <unordered_map> using namespace std; int father[100005]; int n, m; int find(int a) { if (father[a] == a) return a; else return father[a] = find(father[a]); } void join(int a, int b) { int s = find(a); int f = find(b); if (s == f) return; father[s] = f; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) father[i] = i; for (int i = 0; i < m; i++) { int q; cin >> q; int first; for (int j = 0; j < q; j++) { int te; cin >> te; if (j == 0) first = te; join(te, first); } } unordered_map<int, int> map; int ans = 0; for (int i = 1; i <= n; i++) { int x = find(i); if (map[x] == 0) { ans++; map[x]++; } } cout << ans; }