Problem Statement

You are given a simple undirected graph with $N$ vertices and $M$ edges. The $N$ vertices are called Vertex $1$, Vertex $2$, $\ldots$, Vertex $N$. For each $i = 1, 2, \ldots, M$, the $i$-th edge connects Vertex $u_i$ and Vertex $v_i$. Additionally, for each $i = 1, 2, \ldots, N$, Vertex $i$ has an integer $i$ written on it.

You are also given $Q$ queries. For each $i = 1, 2, \ldots, Q$, the $i$-th query is represented as an integer $x_i$. This query involves the following operation.

1. Let $X$ be the integer written on Vertex $x_i$.
2. For every vertex adjacent to Vertex $x_i$, replace the integer written on it with $X$.

Here, Vertex $u$ and Vertex $v$ are said to be adjacent when there is an edge connecting them.

Print the integer written on each vertex after all queries are processed in the order they are given from input.

Constraints

• $1 \leq N \leq 2 \times 10^5$
• $0 \leq M \leq \min(2 \times 10^5, N(N-1)/2)$
• $1 \leq Q \leq 2 \times 10^5$
• $1 \leq u_i, v_i \leq N$
• $1 \leq x_i \leq N$
• The given graph is simple. In other words, it has no self-loops and no multi-edges.
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M Q
u_1 v_1
u_2 v_2
\vdots
u_M v_M
x_1 x_2 \ldots x_Q

Output

Print the integers written on the vertices after all queries are processed, in the format below, with spaces in between. Here, for each $i = 1, 2, \ldots, N$, $A_i$ denotes the integer written on Vertex $i$.

A_1 A_2 \ldots A_N