Problem: There are n football teams in the world. 

The Main Football Organization (MFO) wants to host at most m games. MFO wants the i-th game to be played between the teams a_i and b_i in one of the k stadiums. 

Let s_{ij} be the numbers of games the i-th team played in the j-th stadium. MFO does not want a team to have much more games in one stadium than in the others. Therefore, for each team i, the absolute difference between the maximum and minimum among s_{i1}, s_{i2}, …, s_{ik} should not exceed 2.

Each team has w_i — the amount of money MFO will earn for each game of the i-th team. If the i-th team plays l games, MFO will earn w_i ⋅ l.

MFO needs to find what games in what stadiums they need to host in order to earn as much money as possible, not violating the rule they set.

However, this problem is too complicated for MFO. Therefore, they are asking you to help them.

Input

The first line contains three integers n, m, k (3 ≤ n ≤ 100, 0 ≤ m ≤ 1 000, 1 ≤ k ≤ 1 000) — the number of teams, the number of games, and the number of stadiums.

The second line contains n integers w_1, w_2, …, w_n (1 ≤ w_i ≤ 1 000) — the amount of money MFO will earn for each game of the i-th game.

Each of the following m lines contains two integers a_i and b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i) — the teams that can play the i-th game. It is guaranteed that each pair of teams can play at most one game.

Output

For each game in the same order, print t_i (1 ≤ t_i ≤ k) — the number of the stadium, in which a_i and b_i will play the game. If the i-th game should not be played, t_i should be equal to 0.

If there are multiple answers, print any.

Example

Input


7 11 3
4 7 8 10 10 9 3
6 2
6 1
7 6
4 3
4 6
3 1
5 3
7 5
7 3
4 2
1 4


Output


3
2
1
1
3
1
2
1
2
3
2

Note

One of possible solutions to the example is shown below:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int Max_N = 1e2, Max_M = 1e3, Max_K = 1e3, S = 1200;
int n, m, k, w[Max_N + 5], d[Max_N * 2 + 5], l[Max_N * 2 + 5],
    fir[Max_N * 2 + 5], t[Max_M + 5], bln[S + 5][Max_K + 5],
    num[S + 5][Max_K + 5];
set<int> a[S + 5];
struct kk {
  int u, v;
} E[Max_M + 5];
inline void dfs(int x, int col, int From_Id, int From_num) {
  if (bln[x][col]) {
    int To = bln[x][col], Id = num[x][col];
    bln[x][col] = From_Id;
    num[x][col] = From_num;
    bln[To][col] = num[To][col] = 0;
    a[To].insert(col);
    int fc = *a[x].begin();
    a[x].erase(fc);
    bln[x][fc] = To;
    num[x][fc] = Id;
    t[Id] = fc;
    dfs(To, fc, x, Id);
  } else {
    a[x].erase(col);
    bln[x][col] = From_Id;
    num[x][col] = From_num;
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  l[0] = 1;
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &E[i].u, &E[i].v);
    if (E[i].u > E[i].v) swap(E[i].u, E[i].v);
    ++d[E[i].u], ++d[E[i].v + n];
  }
  for (int i = 1; i <= 2 * n; i++)
    if (d[i - 1] == 0)
      l[i] = l[i - 1];
    else
      l[i] = l[i - 1] + (d[i - 1] - 1) / k + 1;
  for (int i = 1; i <= l[2 * n] + (d[2 * n] - 1) / 2; i++)
    for (int j = 1; j <= k; j++) a[i].insert(j);
  for (int i = 1; i <= m; i++) {
    int u = l[E[i].u] + fir[E[i].u] / k;
    int v = l[E[i].v + n] + fir[E[i].v + n] / k;
    ++fir[E[i].u];
    ++fir[E[i].v + n];
    int fc = *a[u].begin();
    a[u].erase(fc);
    t[i] = fc;
    bln[u][fc] = v;
    num[u][fc] = i;
    dfs(v, fc, u, i);
  }
  for (int i = 1; i <= m; i++) printf("%d\n", t[i]);
  return 0;
}