// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include <bits/stdc++.h>
// #define int long long
#define i64 long long
#define pii pair <int, int> 
using namespace std;
inline int read(void) {
    int x=0,sgn=1; char ch=getchar();
    while(ch<48||57<ch) {if(ch==45)sgn=0;ch=getchar();}
    while(47<ch&&ch<58) {x=x*10+ch-48;   ch=getchar();}
    return sgn? x:-x;
}
void write(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
/*
    write((Ans%p+p)%p); pls
*/
mt19937 rnd(1147189248);
int n,m,k,N;
int cnt[1000006],deg[302];
struct edge {
    int u,v;
    int col[154];
    inline void init() {
        ++deg[u];
        ++deg[v];
        for(int i=1; i<=k; ++i) ++cnt[col[i]];
    }
    inline int val1() { return deg[u]+deg[v]; }
} E[22504];
int res[22504];
int stk[100005],top;
map <int,int> cols[302];
inline void clear() { for(int i=1; i<=N; ++i) cols[i].clear(); }
inline void delE(int x,int col) {
    cols[E[x].u].erase(col);
    cols[E[x].v].erase(col);
    stk[++top]=x;
    res[x]=0;
}
inline void attempt1() {
    for(int i=1; i<=m; ++i) sort(E[i].col+1,E[i].col+k+1,[&](int x,int y) { return cnt[x]<cnt[y]; });
    for(int i=1; i<=m; ++i) stk[i]=i; top=m;
    shuffle(stk+1,stk+m+1,rnd);
    while(top) {
        int x=stk[top]; --top;
        int u=E[x].u;
        int v=E[x].v;
        int c=-1,d=-1,e=-1;
        for(int j=1; j<=k; ++j) {
            int tmp=E[x].col[j];
            if(cols[u].count(tmp)&&cols[v].count(tmp)) continue;
            if(cols[u].count(tmp)) {
                if(d==-1) {
                    d=cols[u][tmp];
                    e=tmp;
                }
            } else if(cols[v].count(tmp)) {
                if(d==-1) {
                    d=cols[v][tmp];
                    e=tmp;
                }
            } else {
                c=tmp;
                break;
            }
        }
        if(c>-1) {
            cols[u][c]=x;
            cols[v][c]=x;
            res[x]=c;
        } else {
            assert(d!=-1);
            delE(d,e);
            cols[u][e]=x;
            cols[v][e]=x;
            res[x]=e;
        }
    }
    for(int i=1; i<=m; ++i) write(res[i]),putchar(" \n"[i==m]);
    exit(0);
}
signed main() {
    // freopen("localinput","r",stdin);
    // freopen("localoutput","w",stdout);
    n=read(); m=read(); k=read(); N=n<<1;
    for(int i=1; i<=m; ++i) {
        E[i].u=read();
        E[i].v=read()+n;
        for(int u=1; u<=k; ++u) E[i].col[u]=read();
        E[i].init();
    }
    attempt1();
    // fprintf(stderr,"%.4lf\n",1.0*clock()/CLOCKS_PER_SEC);
    return 0;
}