#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 50007;

vector <pii> adj[3][3][N];

struct HopcroftKarp {
	const int INF = 1 << 30;
	int n, m;
	vector <vector <int>> g;
	vector <int> match, dis, matched, vis;
	bool dfs(int x) {
		vis[x] = true;
		for (int y : g[x])
			if (match[y] == -1 || (dis[match[y]] == dis[x] + 1) && !vis[match[y]] && dfs(match[y])) {
				match[y] = x, matched[x] = true;
				return true;
			}
		return false;
	}
	bool bfs() {
		fill(all(dis), -1);
		queue <int> q;
		for (int x = 0; x < n; ++x) if (!matched[x])
			dis[x] = 0, q.push(x);
		int mx = INF;
		while (!q.empty()) {
			int x = q.front(); q.pop();
			for (int y : g[x]) {
				if (match[y] == -1) {
					mx = dis[x];
					break;
				} else if (dis[match[y]] == -1)
					dis[match[y]] = dis[x] + 1, q.push(match[y]);
			}
		}
		return mx < INF;
	}
	int solve() {
		int res = 0;
		fill(all(match), -1);
		fill(all(matched), 0);
		while (bfs()) {
			fill(all(vis), 0);
			for (int x = 0; x < n; ++x) if (!matched[x])
				res += dfs(x);
		}
		return res;
	}
	void add_edge(int x, int y) { g[x].pb(y); }
	HopcroftKarp (int _n, int _m) : n(_n), m(_m), g(n), match(m), dis(n), matched(n), vis(n) {}
};

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n, m, k;
	cin >> n >> m >> k;
	int e = 0;
	for (int i = 0; i < n; ++i) {
		int s; cin >> s;
		for (int j = 0, x; j < s; ++j) {
			cin >> x, --x;
			adj[0][1][i].pb(pii(x, e));
			adj[1][0][x].pb(pii(i, e));
			e++;
		}
	}
	for (int i = 0; i < n; ++i) {
		int s; cin >> s;
		for (int j = 0, x; j < s; ++j) {
			cin >> x, --x;
			adj[0][2][i].pb(pii(x, e));
			adj[2][0][x].pb(pii(i, e));
			e++;
		}
	}
	for (int i = 0; i < m; ++i) {
		int s; cin >> s;
		for (int j = 0, x; j < s; ++j) {
			cin >> x, --x;
			adj[1][2][i].pb(pii(x, e));
			adj[2][1][x].pb(pii(i, e));
			e++;
		}
	}

	vector <array <int, 3>> tri;
	vector <vector <int>> edge(e);
	for (int i = 0; i < n; ++i) {
		for (auto [j, e1] : adj[0][1][i]) {
			for (auto [k, e2] : adj[1][2][j]) {
				for (auto [ii, e3] : adj[2][0][k]) {
					if (ii != i) continue;
					edge[e1].pb(tri.size());
					edge[e2].pb(tri.size());
					edge[e3].pb(tri.size());
					tri.pb({i, j, k});
				}
			}
		}
	}

	vector <vector <int>> nadj(tri.size());
	for (int i = 0; i < e; ++i) {
		for (int s1 = 0; s1 < edge[i].size(); ++s1) {
			for (int s2 = s1 + 1; s2 < edge[i].size(); ++s2) {
				int v = edge[i][s1], u = edge[i][s2];
				nadj[v].pb(u), nadj[u].pb(v);
				// cout << u << ' ' << v << endl;
			}
		}
	}

	// cout << tri.size() << endl;

	int ans = 0;
	vector <bool> vis(tri.size());
	vector <int> col(tri.size()), id(tri.size());
	int _id[2] = {0, 0};
	for (int i = 0; i < tri.size(); ++i) if (!vis[i]) {
		vector <int> cc;
		queue <int> q;
		q.push(i), vis[i] = true;
		bool deg3 = false;
		_id[0] = _id[1] = 0;
		while (!q.empty()) {
			int v = q.front(); q.pop();
			cc.pb(v);
			deg3 |= nadj[v].size() >= 3;
			id[v] = _id[col[v]]++;
			for (int u : nadj[v]) if (!vis[u]) {
				q.push(u), vis[u] = true;
				col[u] = col[v] ^ 1;
			}
		}
		if (deg3) {
			HopcroftKarp matching(_id[0], _id[1]);
			for (int v : cc) if (col[v] == 0) {
				for (int u : nadj[v]) {
					assert(col[u] != col[v]);
					// cout << id[v] << ' ' << id[u] << "!" << endl;
					matching.add_edge(id[v], id[u]);
				}
			}
			ans += (int)cc.size() - matching.solve();
		} else {
			int sume = 0;
			for (int v : cc) {
				sume += nadj[v].size();
			}
			sume /= 2;
			if (sume == cc.size()) {
				ans += (int)cc.size() / 2;
			} else {
				ans += ((int)cc.size() + 1) / 2;
			}
		}
	}
	cout << ans << '\n';
}