#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read() {
  T f = 0, x = 0;
  char c = getchar();
  while (!isdigit(c)) f = c == '-', c = getchar();
  while (isdigit(c)) x = x * 10 + c - 48, c = getchar();
  return f ? -x : x;
}
namespace run {
const int N = 1e3 + 9;
int n, m, K, w[N], cnt[N], bel[N];
vector<pair<int, int> > son[N];
inline int getcol() { return rand() % K + 1; }
int head[N], nex[N << 2], to[N << 2], id[N << 2], tot, deg[N], vis[N << 2];
inline void add(int u, int v, int c) {
  nex[++tot] = head[u], head[u] = tot, to[tot] = v, id[tot] = c, deg[u]++;
  nex[++tot] = head[v], head[v] = tot, to[tot] = u, id[tot] = c, deg[v]++;
}
inline void dfs(int u) {
  vis[u] = 1;
  for (int i = head[u]; i; i = nex[i])
    if (!vis[to[i]]) dfs(to[i]);
}
int s, t;
inline void get(int u) {
  for (int i = head[u]; i; i = nex[i])
    if (!vis[i]) {
      vis[i] = vis[i ^ 1] = 1, get(to[i]);
      bel[id[i]] = s, swap(s, t);
    }
}
inline void solve(int mx, int mn) {
  for (int i = 0; i <= n; i++) head[i] = deg[i] = 0;
  for (int i = 0; i <= max(n, tot); i++) vis[i] = 0;
  tot = 1;
  for (int u = 1; u <= n; u++)
    for (int i = 0; i < son[u].size(); i++)
      if ((bel[son[u][i].first] == mx || bel[son[u][i].first] == mn) &&
          son[u][i].second >= u)
        add(u, son[u][i].second, son[u][i].first);
  for (int i = 1; i <= n; i++)
    if (deg[i] & 1) add(0, i, 0);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i), add(0, i, 0), add(0, i, 0);
  for (int i = 0; i <= n; i++) vis[i] = 0;
  s = mx, t = mn, get(0);
}
int main() {
  srand(time(0));
  n = read<int>(), m = read<int>(), K = read<int>();
  for (int i = 1; i <= n; i++) w[i] = read<int>();
  for (int i = 1; i <= m; i++) {
    int u = read<int>(), v = read<int>();
    bel[i] = getcol();
    son[u].push_back(pair<int, int>(i, v)),
        son[v].push_back(pair<int, int>(i, u));
  }
  for (int i = 1; i <= m; i++) bel[i] = 1;
  while (1) {
    int peg = 0;
    for (int u = 1; u <= n; u++) {
      if (!son[u].size()) continue;
      int num = 0;
      for (int i = 0; i < son[u].size(); i++)
        if (!cnt[bel[son[u][i].first]]++) ++num;
      int mx = bel[son[u][0].first], mn = bel[son[u][0].first];
      for (int i = 1; i < son[u].size(); i++) {
        if (cnt[bel[son[u][i].first]] > cnt[mx]) mx = bel[son[u][i].first];
        if (cnt[bel[son[u][i].first]] < cnt[mn]) mn = bel[son[u][i].first];
      }
      if (num < K)
        for (int i = 1; i <= K; i++)
          if (!cnt[i]) {
            mn = i;
            break;
          }
      if (cnt[mx] - cnt[mn] > 2) peg = 1;
      for (int i = 0; i < son[u].size(); i++) cnt[bel[son[u][i].first]]--;
      if (peg == 1) {
        solve(mx, mn);
        break;
      }
    }
    if (!peg) break;
  }
  for (int i = 1; i <= m; i++) printf("%d\n", bel[i]);
  return 0;
}
}  // namespace run
int main() { return run::main(); }
