#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


#include <chrono>

#ifdef LOCAL
mt19937_64 rng(58);
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif


namespace bm {
constexpr int LIM_N0 = 210;
constexpr int LIM_N1 = 210;
constexpr int LIM_M = 40010;
int n0, n1, m, as[LIM_M], bs[LIM_M];
int to[LIM_N0], fr[LIM_N1], tof;
int pt[LIM_N0 + 2], zu[LIM_M], used[LIM_N0], lev[LIM_N0], que[LIM_N0], *qb, *qe;
void init(int n0_, int n1_) {
  n0 = n0_; n1 = n1_; m = 0;
}
int ae(int u, int v) {
  as[m] = u; bs[m] = v; return m++;
}
int augment(int u) {
  used[u] = tof;
  for (int j = pt[u]; j < pt[u + 1]; ++j) {
    const int v = zu[j];
    const int w = fr[v];
    if (!~w || (used[w] != tof && lev[u] < lev[w] && augment(w))) {
      to[u] = v; fr[v] = u; return 1;
    }
  }
  return 0;
}
int run() {
  memset(pt, 0, (n0 + 2) * sizeof(int));
  for (int i = 0; i < m; ++i) ++pt[as[i] + 2];
  for (int u = 2; u <= n0; ++u) pt[u + 1] += pt[u];
  for (int i = 0; i < m; ++i) zu[pt[as[i] + 1]++] = bs[i];
  memset(to, ~0, n0 * sizeof(int));
  memset(fr, ~0, n1 * sizeof(int));
  memset(used, ~0, n0 * sizeof(int));
  for (tof = 0; ; ) {
    qb = qe = que; memset(lev, ~0, n0 * sizeof(int));
    for (int u = 0; u < n0; ++u) if (!~to[u]) lev[*qe++ = u] = 0;
    for (; qb != qe; ) {
      const int u = *qb++;
      for (int j = pt[u]; j < pt[u + 1]; ++j) {
        const int w = fr[zu[j]];
        if (~w && !~lev[w]) lev[*qe++ = w] = lev[u] + 1;
      }
    }
    int f = 0;
    for (int u = 0; u < n0; ++u) if (!~to[u]) f += augment(u);
    if (!f) return tof;
    tof += f;
  }
}

// s: true, t: false (s: reachable from unmatched left)
// vertex cover: (0: false, 0: true)
// independent set: (0: true, 1: false)
bool side0[LIM_N0], side1[LIM_N1];
void dfs(int u) {
  if (!side0[u]) {
    side0[u] = true;
    for (int j = pt[u]; j < pt[u + 1]; ++j) {
      const int v = zu[j];
      if (!side1[v]) {
        side1[v] = true;
        const int w = fr[v];
        if (~w) dfs(w);
      }
    }
  }
}
void minCut() {
  memset(side0, 0, n0 * sizeof(bool));
  memset(side1, 0, n1 * sizeof(bool));
  for (int u = 0; u < n0; ++u) if (!~to[u]) dfs(u);
}
}  // namespace bm


int N, M, K;
vector<int> A, B;
vector<vector<int>> C;


vector<int> sub3() {
  assert(K == 2);
  vector<vector<int>> G(N + N);
  for (int i = 0; i < M; ++i) {
    G[A[i]].push_back(i);
    G[N + B[i]].push_back(i);
  }
  vector<int> ans(M, -1);
  vector<int> vis(N + N, 0);
  for (int phase = 1; phase <= 2; ++phase) {
    for (int r = 0; r < N + N; ++r) if (!vis[r] && (int)G[r].size() == phase) {
      vector<int> us, is;
      for (int bef = -1, u = r; !vis[u]; ) {
        vis[u] = true;
        us.push_back(u);
        if (us.size() >= 2 && G[u].size() == 1) break;
        for (const int i : G[u]) {
          const int v = A[i] ^ (N + B[i]) ^ u;
          if (bef != v) {
            is.push_back(i);
            bef = u;
            u = v;
            goto found;
          }
        }
        assert(false);
       found:{}
      }
// cerr<<"us = "<<us<<", is = "<<is<<endl;
      const int len = is.size();
      for (int k0 = 0; k0 < 2; ++k0) {
        vector<vector<int>> prv(len, vector<int>(2, -1));
        prv[0][k0] = -2;
        for (int j = 0; j < len - 1; ++j) {
          for (int k = 0; k < 2; ++k) if (~prv[j][k]) {
            for (int kk = 0; kk < 2; ++kk) if (C[is[j]][k] != C[is[j + 1]][kk]) {
              prv[j + 1][kk] = k;
            }
          }
        }
        for (int k1 = 0; k1 < 2; ++k1) if (~prv[len - 1][k1]) {
          if (us.size() == is.size() && C[is[len - 1]][k1] == C[is[0]][k0]) {
            continue;
          }
          for (int j = len - 1, k = k1; j >= 0; --j) {
            ans[is[j]] = C[is[j]][k];
            k = prv[j][k];
          }
          goto solved;
        }
      }
     solved:{}
    }
  }
  return ans;
}


vector<int> uso() {
  int limC = 0;
  for (int i = 0; i < M; ++i) {
    for (int k = 0; k < K; ++k) {
      chmax(limC, C[i][k]);
    }
  }
  ++limC;
  vector<vector<int>> iss(limC);
  for (int i = 0; i < M; ++i) {
    for (int k = 0; k < K; ++k) {
      iss[C[i][k]].push_back(i);
    }
  }
  for (; ; ) {
    vector<int> cs(limC);
    for (int c = 0; c < limC; ++c) cs[c] = c;
    shuffle(cs.begin(), cs.end(), rng);
    /*
    stable_sort(cs.begin(), cs.end(), [&](int c0, int c1) -> bool {
      return (iss[c0].size() > iss[c1].size());
    });
    */
    vector<int> ans(M, -1);
    vector<int> idsA(N, -1), idsB(N, -1);
    for (const int c : cs) {
      vector<int> is;
      for (const int i : iss[c]) if (!~ans[i]) {
        is.push_back(i);
      }
      if (is.size()) {
        vector<int> as, bs;
        for (const int i : is) {
          as.push_back(A[i]);
          bs.push_back(B[i]);
        }
        sort(as.begin(), as.end());
        sort(bs.begin(), bs.end());
        as.erase(unique(as.begin(), as.end()), as.end());
        bs.erase(unique(bs.begin(), bs.end()), bs.end());
        shuffle(as.begin(), as.end(), rng);
        shuffle(bs.begin(), bs.end(), rng);
        const int asLen = as.size();
        const int bsLen = bs.size();
        for (int x = 0; x < asLen; ++x) idsA[as[x]] = x;
        for (int y = 0; y < bsLen; ++y) idsB[bs[y]] = y;
        bm::init(asLen, bsLen);
        for (const int i : is) {
          bm::ae(idsA[A[i]], idsB[B[i]]);
        }
        bm::run();
        for (const int i : is) {
          if (bm::to[idsA[A[i]]] == idsB[B[i]]) {
            ans[i] = c;
          }
        }
      }
    }
    bool ok = true;
    for (int i = 0; i < M; ++i) {
      ok = ok && (~ans[i]);
    }
    if (ok) {
      return ans;
    }
  }
}

int main() {
  for (; ~scanf("%d%d%d", &N, &M, &K); ) {
    A.resize(M);
    B.resize(M);
    C.assign(M, vector<int>(K));
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
      for (int k = 0; k < K; ++k) {
        scanf("%d", &C[i][k]);
      }
    }
    
    vector<int> ans;
    if (K == 2) {
      ans = sub3();
    } else {
      ans = uso();
    }
    
    for (int i = 0; i < M; ++i) {
      if (i) printf(" ");
      printf("%d", ans[i]);
    }
    puts("");
  }
  return 0;
}