// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 150, M = 1e6;
int a, b, c, ans[N * N + 5];
bool vis[M + 5];
struct pii {
	int x, y;
} s[N * N + 5];
vi st[M + 5];

struct FLOW {
	static const int N = 4e6, inf = 1e9;
	int head[N + 5], S, T, dep[N + 5], cur[N + 5], top;
	struct road {
		int lst, v, val;
	} s[N + 5];
	void init(int n) {
		S = n + 1, T = n + 2;
		rep(i, 1, T) head[i] = 0;
		top = 1;
	}
	inline void add(int l1, int l2, int l3) {
		s[++top] = (road) {head[l1], l2, l3};
		head[l1] = top;
		s[++top] = (road) {head[l2], l1, 0};
		head[l2] = top;
	}
	inline bool bfs() {
		rep(i, 0, T) dep[i] = 0, cur[i] = head[i];
		queue<int> qu;
		qu.push(S);
		dep[S] = 1;
		while (!qu.empty()) {
			int u = qu.front();
			qu.pop();
			for (int i = head[u]; i; i = s[i].lst) {
				int v = s[i].v;
				if (dep[v] || !s[i].val) continue;
				dep[v] = dep[u] + 1;
				qu.push(v);
			}
		}
		return dep[T];
	}
	inline int dfs(int n, int mx) {
		if (n == T) return mx;
		int res = 0;
		for (int i = cur[n]; i; i = s[i].lst) {
			cur[n] = i;
			int v = s[i].v;
			if (dep[v] != dep[n] + 1 || !s[i].val) continue;
			int tmp = dfs(v, min(mx, s[i].val));
			s[i].val -= tmp;
			s[i ^ 1].val += tmp;
			res += tmp;
			mx -= tmp;
			if (!mx) break;
		}
		if (!res) dep[n] = -1;
		return res;
	}
	inline int dinic() {
		int res = 0;
		while (bfs()) res += dfs(S, inf);
		return res;
	}
} S;

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a >> b >> c;
	int x;
	rep(i, 1, b) {
		cin >> s[i].x >> s[i].y;
		rep(j, 1, c) cin >> x, st[x].PB(i);
	}
	int cnt = 0;
	per(i, M, 1) {
		int top = 0;
		rep(j, 1, a + a) vis[j] = 0;
		for(int x : st[i]) if(!ans[x]) {
			if(!vis[s[x].x]) {
				vis[s[x].x] = ++top;
			}
			if(!vis[s[x].y + a]) {
				vis[s[x].y + a] = ++top;
			}
		}
		S.init(top);
		rep(j, 1, a) if(vis[j]) S.add(S.S, vis[j], 1);
		rep(j, a + 1, a + a) if(vis[j]) S.add(vis[j], S.T, 1);
		for(int x : st[i]) if(!ans[x]) S.add(vis[s[x].x], vis[s[x].y + a], 1);
		cnt += S.dinic();
		for(int x : st[i]) if(!ans[x]) {
			for(int j = S.head[vis[s[x].x]]; j; j = S.s[j].lst) {
				if(S.s[j].v == vis[s[x].y + a] && !S.s[j].val) {
					ans[x] = i;
				}
			}
		}
	}
	// cerr << cnt << endl;
	while(cnt != b);
	rep(i, 1, b) cout << ans[i] << ' ';
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}