#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

const int N = 1 << 17;
VI g[N];

void addEdge(int a, int b)
{
	g[a].PB(b);
	g[b].PB(a);
}

bool used[N];
int ans = 0;
void dfs(int v)
{
	used[v] = true;
	for(int to : g[v])
		if(!used[to])
		{
			ans++;
			dfs(to);
		}
}



int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	
	VI ids(m, -1);
	
	FOR(i, 0, n)
	{
		int sz;
		cin >> sz;
		FOR(j, 0, sz)
		{
			int col;
			cin >> col;
			col--;
			
			if(ids[col] != -1)
			{
				addEdge(ids[col], i);
				ids[col] = -1;
			}
			else
				ids[col] = i;
		}
	}
	FOR(i, 0, n)
		if(!used[i])
			dfs(i);
	cout << ans << "\n";




	return 0;
}