3
rjnflsbpxqivrcdjptj
vpojopbwbwbswdu
rydkiwnugwddcgcrng
 1
z
 30
b
u
p
n
f
m
t
i
j
k
p
h
a
c
w
z
z
p
t
d
o
w
u
q
l
y
i
o
a
u
 5
splt
ohqykk
xqpz
knojbur
pmfm
 2
hk
obsp
 5
zzxpfk
abcdefghijklmnopqrst
uvwxz
srgkjaskldfkln
vgnsdfdgfh
 2
rxscdzkkezud
wjehahqgouqvjienq
 5
ojdfhi
abcdefghijklmnopqrst
uvwxyz
ddfhdfhlasjt
qqq
 1
epkotfpkkrhhmuipmtdk
 10
kpmwcdoysw
gtpr
kuzoxmiixxbl
crgqtuo
jhbplhpklrgwnaugdf
zuxdaat
aycv
qwghrkqwkobrgevsjrk
tdxgc
lxyzgcmbzulcst
 5
dfijdfhi
abcdefghijklmnopqrst
uvwxy
kopsdfgiopjipw
jty
 2
xlaxwpjabtpwddc
txwdjmohrrszorrnomc
 1
a
 30
waiphwcqrrinr
o
qiqehzmgsjdoqd
kjexeesevrlowxhghq
judikhzkj
z
xo
lsdzypkfqro
sshgcxsky
gecntpcmoojfwp
svmytmcfhc
jrsrvsvbaiumlmkptn
s
wpcsovfjlyspviflk
ktvyzvddgllht
szahigtmklglrcocbo
znligfxkgxzkcfeu
liryvzmqwhr
xgrxkgiehxztv
etrjxdczppafly
jrdgajschhwsci
doxnxbjwptnimjmsuijx
zciwkbvrhgsjhrr
ehh
bzlnmd
xpbtbpftimnn
khbknqbvdkdd
mldj
skrvnyz
avptgpjmenfzfxwckmt
 30
e
x
itaubd
xcn
v
x
i
ci
aqs
zbi
q
cvdu
a
jos
qy
fjf
nayke
ge
s
q
qwad
gvz
o
ubn
nzoc
h
wnjwjrf
t
bq
bw
 1
b

a
 a
 e
 a
 a
 y
 b
 aa
 a
 ab
 z
 e
 b
 aa
 l
 a

#include <bits/stdc++.h>
using namespace std;
struct graph {
  bool mark;
  vector<int> neighbours;
};
graph node[105];
int N, E, temp, len;
void DFS(int i) {
  if (node[i].mark) return;
  node[i].mark = true;
  for (int count = 0; count < node[i].neighbours.size(); count++)
    DFS(node[i].neighbours[count]);
}
int main() {
  map<int, vector<int>> mlan;
  cin >> E >> N;
  for (int i = 0; i < E; i++) {
    cin >> len;
    for (int j = 0; j < len; j++) {
      cin >> temp;
      mlan[temp].push_back(i);
    }
  }
  map<int, vector<int>>::iterator it, end = mlan.end();
  for (it = mlan.begin(); it != end; it++) {
    for (int i = 0; i < it->second.size(); i++) {
      for (int j = i + 1; j < it->second.size(); j++) {
        node[it->second[i]].neighbours.push_back(it->second[j]);
        node[it->second[j]].neighbours.push_back(it->second[i]);
      }
    }
  }
  int nDFS = 0;
  for (int i = 0; i < E; i++) {
    if (node[i].mark) continue;
    nDFS++;
    DFS(i);
  }
  cout << nDFS - 1;
}
