// #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
*/
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 p[22504],res[22504];
set <int> cols[302];
inline void clear() { for(int i=1; i<=N; ++i) cols[i].clear(); }
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) p[i]=i;
    sort(p+1,p+m+1,[&](int x,int y) {
        return E[x].val1()<E[y].val1();
    });
    for(int i=1; i<=m; ++i) {
        int x=p[i];
        int u=E[x].u,v=E[x].v,c=-1;
        for(int j=1; j<=k; ++j) {
            c=E[x].col[j];
            if(cols[u].count(c)||cols[v].count(c)) continue;
            break;
        }
        if(c==-1) return ; // failed
        cols[u].insert(c);
        cols[v].insert(c);
        res[x]=c;
    }
    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();
    cerr<<"err!"<<endl;
    // fprintf(stderr,"%.4lf\n",1.0*clock()/CLOCKS_PER_SEC);
    return 0;
}