#include <bits/stdc++.h>
using namespace std;
const long double PI = acosl(-1.0);
const double EPS = 1e-12;
void combination(long long com[][1005]) {
  com[0][0] = 1;
  int sz = 1000;
  for (int i = 1; i <= sz; i++) {
    com[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      com[i][j] = com[i - 1][j] + com[i - 1][j - 1];
      com[i][j] = com[i][j] % 1000000007;
    }
  }
}
int find_par(int cn) {}
int gcd(int u, int v) {
  if (v == 0) return u;
  return gcd(v, u % v);
}
void insert_ind(int cs, int ci, int s, int e) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    insert_ind(2 * cs, ci, s, mid);
  else
    insert_ind(2 * cs + 1, ci, mid + 1, e);
}
void update_ind(int cs, int ci, int s, int e, int val) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    update_ind(2 * cs, ci, s, mid, val);
  else
    update_ind(2 * cs + 1, ci, mid + 1, e, val);
}
void update_seg(int cs, int ds, int de, int s, int e, int val) {
  if (ds == s && de == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ds <= mid) update_seg(2 * cs, ds, min(mid, de), s, mid, val);
  if (de > mid) update_seg(2 * cs + 1, max(mid + 1, ds), de, mid + 1, e, val);
}
void pattern_match(char pat[], const int len, int pi[]) {
  pi[1] = 0;
  for (int i = 2; i <= len; i++) {
    int st = i - 1;
    while (st >= 0 && pat[pi[st] + 1] != pat[i]) st = pi[st];
    if (st == 0)
      pi[i] = 0;
    else
      pi[i] = pi[st] + 1;
  }
}
void pattern_match(char pat[], int pi[], char tar[], const int len1, int gi[]) {
  if (pat[0] == tar[0]) gi[0] = 1;
  for (int i = 1; i < len1; i++) {
    int st = gi[i - 1];
    while (pat[st] != tar[i]) {
      if (st == 0) {
        st = -1;
        break;
      }
      st = pi[st - 1];
    }
    if (st == -1)
      gi[i] = 0;
    else
      gi[i] = st + 1;
  }
}
struct myArray {
  int mat[10][10];
};
myArray matrix_mul(myArray mat1, myArray mat2, const int sz) {
  int tmp[sz][sz];
  memset((tmp), 0, sizeof((tmp)));
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++)
      for (int cr = 0; cr < sz; cr++)
        tmp[r][c] += mat1.mat[r][cr] * mat2.mat[c][cr];
  myArray res;
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++) res.mat[r][c] = tmp[r][c];
  return res;
}
myArray unit_matrix(const int sz) {
  myArray ma;
  memset((ma.mat), 0, sizeof((ma.mat)));
  for (int i = 0; i < sz; i++) ma.mat[i][i] = 1;
  return ma;
}
myArray matrix_expo(int p, myArray mat, const int sz) {
  if (p == 0) {
    return unit_matrix(sz);
  }
  if (p & 1) return matrix_mul(mat, matrix_expo(p - 1, mat, sz), sz);
  myArray tmp = matrix_expo(p >> 1, mat, sz);
  return matrix_mul(tmp, tmp, sz);
}
int X[] = {0, 0, 1, -1};
int Y[] = {1, -1, 0, 0};
int n, k;
int place[3 * 100005], gp_no[3 * 100005];
vector<int> gp[100005];
int main() {
  cin >> n;
  for (int i = (1); i < (3 * n + 1); ++i) {
    int no;
    cin >> no;
    place[no] = i;
  }
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (3); ++j) {
      int no;
      cin >> no;
      gp_no[no] = i;
      gp[i].push_back(no);
    }
  }
  cin >> k;
  int gpK = gp_no[k];
  bool is = true;
  for (int i = (0); i < (gp[gpK].size()); ++i)
    if (place[k] > place[gp[gpK][i]]) is = false;
  if (is) {
    vector<int> v;
    for (int i = 0; i < gpK; i++)
      for (int j = 0; j < 3; j++) v.push_back(gp[i][j]);
    for (int i = (0); i < (3); ++i)
      if (gp[gpK][i] != k) v.push_back(gp[gpK][i]);
    sort(v.begin(), v.end());
    int cnt = 0, in = 0;
    for (int i = 0; i < v.size(); i++) {
      cout << v[i] << " ";
      is = false;
      for (int j = 0; j < 3; j++)
        if (gp[gpK][j] == v[i]) is = true;
      if (is == true) cnt++;
      if (cnt == 2) {
        in = i;
        break;
      }
    }
    vector<int> v1;
    for (int i = (gpK + 1); i < (n); ++i)
      for (int j = (0); j < (3); ++j) v1.push_back(gp[i][j]);
    for (int i = (in + 1); i < (v.size()); ++i) v1.push_back(v[i]);
    sort(v1.begin(), v1.end());
    for (int i = (0); i < (v1.size()); ++i) cout << v1[i] << " ";
    printf("\n");
  } else {
    for (int i = (1); i < (3 * n + 1); ++i)
      if (i != k) cout << i << " ";
    printf("\n");
  }
  return 0;
}
