Recently 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 3n, 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 3n-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 3n, 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.
最近，在伯兰州立大学奥林匹克程序员培训中心完成了个人培训课程。根据这些培训课程的结果，团队为即将到来的团队比赛季节组成。每个团队由三人组成。中心的所有学生都拥有从1到3 n的数字，所有团队都拥有从1到n的数字。将学生分成小组的方式如下：虽然有些人不属于团队，但从中选择总分最高的人（新团队的队长），此人根据他的优先级列表从剩下的人中为自己选择两个队友。每个人的优先事项列表表示为除他自己之外参加该中心的其他 3n - 1 名学生的排列组合。
您将获得个人培训课程的结果，这些结果是从 1 到 3n 的数字排列，其中第 i 个数字是赢得第 i 名的学生人数。没有两个学生共享一个位置。您还可以按照已组建的团队的创建顺序排列。您的任务是确定学生编号 k 的优先级列表。如果有多个优先级列表，请选择按字典顺序排列的最小优先级列表。
Input
The first line contains an integer n (1≤n≤105) which is the number of resulting teams. The second line contains 3n space-separated integers from 1 to 3n 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 3n − 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≤3n) which is the number of a student for who the list of priorities should be found.
Output
Print
3n-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≤3n), that
ai<bi, and for any
j (
1≤j<i)
aj=bj. 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.