Problem: There are n military men in the Berland army. Some of them have given orders to other military men by now. Given m pairs (xi, yi), meaning that the military man xi gave the i-th order to another military man yi.

It is time for reform! The Berland Ministry of Defence plans to introduce ranks in the Berland army. Each military man should be assigned a rank — integer number between 1 and k, inclusive. Some of them have been already assigned a rank, but the rest of them should get a rank soon.

Help the ministry to assign ranks to the rest of the army so that:

  * for each of m orders it is true that the rank of a person giving the order (military man xi) is strictly greater than the rank of a person receiving the order (military man yi); 
  * for each rank from 1 to k there is at least one military man with this rank. 

Input

The first line contains three integers n, m and k (1 ≤ n ≤ 2·105, 0 ≤ m ≤ 2·105, 1 ≤ k ≤ 2·105) — number of military men in the Berland army, number of orders and number of ranks.

The second line contains n integers r1, r2, ..., rn, where ri > 0 (in this case 1 ≤ ri ≤ k) means that the i-th military man has been already assigned the rank ri; ri = 0 means the i-th military man doesn't have a rank yet.

The following m lines contain orders one per line. Each order is described with a line containing two integers xi, yi (1 ≤ xi, yi ≤ n, xi ≠ yi). This line means that the i-th order was given by the military man xi to the military man yi. For each pair (x, y) of military men there could be several orders from x to y.

Output

Print n integers, where the i-th number is the rank of the i-th military man. If there are many solutions, print any of them.

If there is no solution, print the only number -1.

Examples

Input

5 3 3
0 3 0 0 2
2 4
3 4
3 5


Output

1 3 3 2 2 


Input

7 6 5
0 4 5 4 1 0 0
6 1
3 6
3 1
7 5
7 1
7 4


Output

2 4 5 4 1 3 5 


Input

2 2 2
2 1
1 2
2 1


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void wrote(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) wrote(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(int x) {
  wrote(x);
  puts("");
}
const int N = 400010;
vector<pair<int, int> > g[N];
priority_queue<pair<int, int> > Q;
int head[N], nxt[N], vet[N], dfn[N], q[N], rk[N], mx[N], mn[N], n, m, k, top,
    tot = 1;
inline void insert(int x, int y) {
  nxt[++tot] = head[x];
  head[x] = tot;
  vet[tot] = y;
}
int main() {
  n = read();
  m = read();
  k = read();
  for (int i = 1; i <= n; ++i)
    rk[i] = read(), mx[i] = rk[i] ? rk[i] : k, mn[i] = rk[i] ? rk[i] : 1;
  for (int i = 1; i <= m; ++i) {
    int x = read(), y = read();
    insert(x, y);
    insert(y, x);
    ++dfn[y];
  }
  for (int i = 1; i <= n; ++i)
    if (!dfn[i]) q[++top] = i;
  for (int now = 1; now <= top; ++now)
    for (int i = head[q[now]]; i; i = nxt[i])
      if (i % 2 == 0)
        if (!--dfn[vet[i]]) q[++top] = vet[i];
  if (top != n) return puts("-1"), 0;
  for (int now = 1; now <= top; ++now)
    for (int i = head[q[now]]; i; i = nxt[i])
      if (i % 2 == 0) mx[vet[i]] = min(mx[vet[i]], mx[q[now]] - 1);
  for (int now = top; now >= 1; --now)
    for (int i = head[q[now]]; i; i = nxt[i])
      if (i % 2 == 1) mn[vet[i]] = max(mn[vet[i]], mn[q[now]] + 1);
  for (int i = 1; i <= n; ++i)
    if (mx[i] < mn[i])
      return puts("-1"), 0;
    else
      g[mx[i]].push_back(make_pair(mn[i], i));
  for (int i = k; i >= 1; --i) {
    for (int j = 0; j < g[i].size(); j++) Q.push(g[i][j]);
    if (Q.empty()) return puts("-1"), 0;
    rk[Q.top().second] = i;
    Q.pop();
    while (!Q.empty() && Q.top().first == i) rk[Q.top().second] = i, Q.pop();
  }
  for (int i = 1; i <= n; ++i) printf("%d ", rk[i]);
}