**Time limit:**1.00 s**Memory limit:**512 MB

The encoder is given a tree of $n$ nodes and it removes all nodes from the tree. On each step, the encoder may remove any leaf from the current tree.

The decoder is given a list of distances between successively removed nodes by the encoder, and it has to reconstruct the original structure of the tree.

The decoder has to create any tree that has the same structure as the original tree (more precisely, it has to be isomorphic to the original tree).

**Input**

The first line has an integer $t$ that is either $1$ (encoder) or $2$ (decoder).

The second line has an integer $n$: the number of nodes in the tree. The nodes are numbered $1,2,\dots,n$.

If $t=1$, there are then $n-1$ lines that describe the tree. Each line has two integers $a$ and $b$: there is an edge between nodes $a$ and $b$.

If $t=2$, there is only one line that has $n-1$ integers: the distances between successively removed nodes.

**Output**

If $t=1$, the encoder has to print a permutation of numbers $1,2,\dots,n$: the order in which the nodes are removed from the tree.

If $t=2$, the decoder has to print $n-1$ lines that describe the structure of the tree.

**Example (encoder)**

Input:

`1`

3

1 2

2 3

Output:

`1 3 2`

**Example (decoder)**

Input:

`2`

3

2 1

Output:

`2 3`

1 3

**Subtask 1 (21 points)**

- $2 \le n \le 10$

**Subtask 2 (47 points)**

- $2 \le n \le 500$

**Subtask 3 (32 points)**

- $2 \le n \le 10^5$