#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
struct bipartite_edgecoloring_general {
  ll n, m, c;
  vvc<multiset<ll>> g;
  vi deg;
  bipartite_edgecoloring_general(ll nn, ll mm, ll cc)
      : n(nn), m(mm), c(cc), g(n + m, vc<multiset<ll>>(c)), deg(n + m) {}
  bool can(ll i, ll j) { return ll(g[i][j].size()) < (deg[i] + c - 1) / c; }
  ll x, y;
  vc<multiset<ll>::iterator> cur;
  void rec(ll v) {
    ll nx = y, pre = x;
    if (v >= n) swap(nx, pre);
    if (ll(g[v][nx].size()) < ll(g[v][pre].size())) return;
    ll to = *cur[v]++;
    check(to);
    rec(to);
    g[v][nx].erase(g[v][nx].find(to));
    g[v][pre].insert(to);
    g[to][nx].erase(g[to][nx].find(v));
    g[to][pre].insert(v);
    check(to);
  }
  void check(ll i) {
    ll mn = inf, mx = 0;
    for (ll j = ll(0); j < ll(c); j++) {
      chmin(mn, ll(g[i][j].size()));
      chmax(mx, ll(g[i][j].size()));
    }
    assert(mx - mn <= 1);
  }
  void add(ll i, ll j) {
    j += n;
    deg[i]++;
    deg[j]++;
    x = -1, y = -1;
    for (ll k = ll(0); k < ll(c); k++) {
      if (can(i, k)) x = k;
      if (can(j, k)) y = k;
      if (x == k && y == k) {
        g[i][k].insert(j);
        g[j][k].insert(i);
        return;
      }
    }
    cur.clear();
    for (ll k = ll(0); k < ll(n); k++) cur.push_back(g[k][y].begin());
    for (ll k = ll(0); k < ll(m); k++) cur.push_back(g[k + n][x].begin());
    rec(j);
    assert(can(i, x));
    assert(can(j, x));
    g[i][x].insert(j);
    g[j][x].insert(i);
    for (ll k = ll(0); k < ll(n + m); k++) check(k);
  }
};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n, m, k;
  cin >> n >> m >> k;
  bool dbg = n < 0;
  if (dbg)
    n = -n;
  else {
    vi tmp = readvi(n);
  }
  bipartite_edgecoloring_general x(n, n, k);
  map<pi, ll> idx;
  for (ll i = ll(0); i < ll(m); i++) {
    ll first, second;
    if (!dbg) {
      cin >> first >> second;
      first--;
      second--;
    } else {
      do {
        first = rand_int(0, n - 1);
        second = rand_int(0, n - 1);
      } while (first == second || idx.count(pi(first, second)));
    }
    idx[pi(first, second)] = i;
    x.add(first, second);
  }
  vi ans(m, -1);
  for (ll i = ll(0); i < ll(n); i++)
    for (ll c = ll(0); c < ll(k); c++) {
      for (auto j : x.g[i][c]) {
        ll first = i, second = j % n;
        ans[idx[pi(first, second)]] = c;
      }
    }
  for (auto& v : ans) {
    assert(v >= 0);
    v++;
  }
  print(ans);
}
