Problem: 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.

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.

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 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int gcd(int i, int j) {
  if (j == 0)
    return i;
  else
    return gcd(j, i % j);
}
const double e = 0.0000005;
const double pi = 3.14159265359;
template <typename T>
inline T getint() {
  T val = 0;
  char c;
  bool neg = false;
  while ((c = getchar()) && !(c >= '0' && c <= '9')) {
    neg |= c == '-';
  }
  do {
    val = (val * 10) + c - '0';
  } while ((c = getchar()) && (c >= '0' && c <= '9'));
  return val * (neg ? -1 : 1);
}
const long long INF = 10000000000000;
const int Y = 100001;
int IDX[3 * Y + 1];
int arr[3 * Y];
int team[Y][3];
int way[3 * Y];
int IDX2[3 * Y];
int main() {
  srand(10241274216);
  cout.precision(10);
  cout.tie(0);
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int n, k;
  cin >> n;
  for (int i = 1; i <= 3 * n; ++i) {
    int tmp;
    cin >> tmp;
    IDX2[tmp] = i;
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 3; ++j) {
      cin >> team[i][j];
      way[3 * i - j] = team[i][j];
      IDX[team[i][j]] = 3 * i - j;
    }
  }
  cin >> k;
  int L = -1;
  int to = IDX[k];
  if (to % 3 == 2) {
    ++to;
  } else {
    if (to % 3 == 1) to += 2;
  }
  int mn = IDX2[k], mn1 = IDX2[k];
  int mx = 0;
  for (int j = 0; j <= 2; ++j) {
    if (way[to - j] != k) mx = max(mx, way[to - j]);
    mn = min(mn, IDX2[way[to - j]]);
  }
  if (mn != mn1) {
    for (int i = 1; i <= 3 * n; ++i) {
      if (i != k) cout << i << " ";
    }
    return 0;
  }
  for (int i = 1; i <= to; ++i) {
    if (way[i] <= mx) {
      arr[++L] = way[i];
    }
  }
  ++L;
  sort(arr, arr + L);
  int last = L;
  for (int i = 1; i <= 3 * n; ++i) {
    if (way[i] > mx || i > to) {
      arr[last++] = way[i];
    }
  }
  sort(arr + L, arr + last);
  for (int i = 0; i <= 3 * n; ++i) {
    if (arr[i] != k && arr[i] != 0) {
      cout << arr[i] << " ";
    }
  }
  return 0;
}