Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Team Arrangement

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRecently personal training sessions have finished in the Berland State University Olympiad Programmer Training Centre. By the results of these training sessions teams are composed for the oncoming team contest season. Each team consists of three people. All the students of the Centre possess numbers from 1 to 3*n*, and all the teams possess numbers from 1 to *n*. The splitting of students into teams is performed in the following manner: while there are people who are not part of a team, a person with the best total score is chosen among them (the captain of a new team), this person chooses for himself two teammates from those who is left according to his list of priorities. The list of every person's priorities is represented as a permutation from the rest of 3*n* - 1 students who attend the centre, besides himself.

You are given the results of personal training sessions which are a permutation of numbers from 1 to 3*n*, where the *i*-th number is the number of student who has won the *i*-th place. No two students share a place. You are also given the arrangement of the already formed teams in the order in which they has been created. Your task is to determine the list of priorities for the student number *k*. If there are several priority lists, choose the lexicographically minimal one.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 10^{5}) which is the number of resulting teams. The second line contains 3*n* space-separated integers from 1 to 3*n* which are the results of personal training sessions. It is guaranteed that every student appears in the results exactly once.

Then follow *n* lines each containing three integers from 1 to 3*n* — each line describes the members of a given team. The members of one team can be listed in any order, but the teams themselves are listed in the order in which they were created. It is guaranteed that the arrangement is correct, that is that every student is a member of exactly one team and those teams could really be created from the given results using the method described above.

The last line contains number *k* (1 ≤ *k* ≤ 3*n*) which is the number of a student for who the list of priorities should be found.

Output

Print 3*n* - 1 numbers — the lexicographically smallest list of priorities for the student number *k*.

The lexicographical comparison is performed by the standard < operator in modern programming languages. The list *a* is lexicographically less that the list *b* if exists such an *i* (1 ≤ *i* ≤ 3*n*), that *a*_{i} < *b*_{i}, and for any *j* (1 ≤ *j* < *i*) *a*_{j} = *b*_{j}. Note, that the list 1 9 10 is lexicographically less than the list 1 10 9. That is, the comparison of lists is different from the comparison of lines.

Examples

Input

3

5 4 1 2 6 3 7 8 9

5 6 2

9 3 4

1 7 8

4

Output

2 3 5 6 9 1 7 8

Input

3

5 4 1 2 6 3 7 8 9

5 6 2

9 3 4

1 7 8

8

Output

1 2 3 4 5 6 7 9

Input

2

4 1 3 2 5 6

4 6 5

1 2 3

4

Output

5 6 1 2 3

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/04/2020 15:22:37 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|