#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 1005;
const int MAXM = 1005;
struct edge_color {
  int deg[2][MAXN];
  pi has[2][MAXN][MAXN];
  int color[MAXM];
  int c[2];
  void clear(int n) {
    for (int t = 0; t < 2; t++) {
      for (int i = 0; i <= n; i++) {
        deg[t][i] = 0;
        for (int j = 0; j <= n; j++) {
          has[t][i][j] = pi(0, 0);
        }
      }
    }
  }
  void dfs(int x, int p) {
    auto i = has[p][x][c[!p]];
    if (has[!p][i.first][c[p]].second)
      dfs(i.first, !p);
    else
      has[!p][i.first][c[!p]] = pi(0, 0);
    has[p][x][c[p]] = i;
    has[!p][i.first][c[p]] = pi(x, i.second);
    color[i.second] = c[p];
  }
  int solve(vector<pi> v, vector<int> &cv) {
    int m = ((int)(v).size());
    int ans = 0;
    for (int i = 1; i <= m; i++) {
      int x[2];
      x[0] = v[i - 1].first;
      x[1] = v[i - 1].second;
      for (int d = 0; d < 2; d++) {
        deg[d][x[d]] += 1;
        ans = max(ans, deg[d][x[d]]);
        for (c[d] = 1; has[d][x[d]][c[d]].second; c[d]++)
          ;
      }
      if (c[0] != c[1]) dfs(x[1], 1);
      for (int d = 0; d < 2; d++) has[d][x[d]][c[0]] = pi(x[!d], i);
      color[i] = c[0];
    }
    cv.resize(m);
    for (int i = 1; i <= m; i++) {
      cv[i - 1] = color[i];
      color[i] = 0;
    }
    return ans;
  }
} EC;
int cnt[2][MAXN];
int idx[2][MAXN], L, R;
int main() {
  int n, m, t;
  scanf("%d %d %d", &n, &m, &t);
  for (int i = 0; i < n; i++) scanf("%*d");
  vector<pi> ans;
  for (int i = 0; i < m; i++) {
    int l, r;
    scanf("%d %d", &l, &r);
    if (cnt[0][l] == 0) idx[0][l] = ++L;
    if (cnt[1][r] == 0) idx[1][r] = ++R;
    cnt[0][l]++;
    cnt[1][r]++;
    if (cnt[0][l] == t) cnt[0][l] = 0;
    if (cnt[1][r] == t) cnt[1][r] = 0;
    ans.emplace_back(idx[0][l], idx[1][r]);
  }
  vector<int> color;
  EC.solve(ans, color);
  for (auto &i : color) printf("%d\n", i);
}
