//// n1
	for (int j = 1; j <= n1; j++){
		C[0][j] = 1;
	}
	for (int v = 1; v < n1 + 1; v++){
		in >> k[v];
		for (int j = 0; j < k[v]; j++){
			in >> to;
			C[v][to] = INT_MAX;
		}
	}
	//// n2
	for (int v = n1 + 1, count = 0; v < n1 + 2 * n2 + 1; v += 2, count++){
		C[v][v + 1] = c[count];
	}
	for (int v = n1 + 2, count = 0; v < n1 + 2 * n2 + 1; v += 2, count++) {
		in >> k[v];
		for (int j = 0; j < k[v]; j++) {
			in >> to;
			if(to <= n1 + n2)
				C[v][to * 2 - (n1 + 1)] = INT_MAX;
			else
				C[v][to + (n1 + 1)] = INT_MAX;
		}
	}
	//// n3
	for (int i = n1 + 2 * n2 + 1; i < N - 1; i++) {
		C[i][N-1] = 1;
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << C[i][j] << " ";
		}
		cout << endl;
	}