#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n - m + p) % p + p) % p;
}
inline long long int modpro(long long int n, long long int m,
                            long long int p = 1000000007) {
  return (((n % p) * (m % p)) % p + p) % p;
}
unsigned long long int powe(long long int first, long long int second) {
  unsigned long long int res = 1;
  while (second > 0) {
    if (second & 1) res = res * first;
    second = second >> 1;
    first = first * first;
  }
  return res;
}
long long int modpow(long long int first, long long int second,
                     long long int p = 1000000007) {
  long long int res = 1;
  while (second > 0) {
    if (second & 1) res = modpro(res, first, p);
    second = second >> 1;
    first = modpro(first, first, p);
  }
  return res;
}
inline long long int modInverse(long long int n, long long int p = 1000000007) {
  if (n == 1) return 1;
  return modpow(n, p - 2, p);
}
inline long long int moddiv(long long int n, long long int m,
                            long long int p = 1000000007) {
  return modpro(n, modInverse(m, p), p);
}
inline long long int modadd3(long long int first, long long int second,
                             long long int z, long long int p = 1000000007) {
  return modadd(modadd(first, second, p), z, p);
}
inline long long int modadd4(long long int first, long long int second,
                             long long int z, long long int w,
                             long long int p = 1000000007) {
  return modadd(modadd(first, second, p), modadd(z, w, p), p);
}
inline long long int modnCr(long long int fac[], int n, int r,
                            long long int p = 1000000007) {
  if (r == 0) return 1;
  return modpro(fac[n], modInverse(modpro(fac[r], fac[n - r], p), p), p);
}
template <typename T>
inline T max3(T first, T second, T z) {
  return max(max(first, second), z);
}
template <typename T>
inline T max4(T first, T second, T z, T w) {
  return max(max3(first, second, w), z);
}
template <typename T>
inline T min3(T first, T second, T z) {
  return min(min(first, second), z);
}
template <typename T>
inline T min4(T first, T second, T z, T w) {
  return min(min3(first, second, w), z);
}
template <typename T>
void printArr(T *arr, int s, int n) {
  for (int i = s; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
int a[300005];
int p[300005][3];
set<int> s, s2;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int erer = 1;
  for (int erer2 = (1); erer2 < (erer + 1); erer2++) {
    int n;
    cin >> n;
    int first;
    for (int i = (1); i < (3 * n + 1); i++) {
      cin >> first;
      a[first] = i;
    }
    for (int i = (0); i < (n); i++)
      for (int j = (0); j < (3); j++) cin >> p[i][j];
    for (int i = (1); i < (3 * n + 1); i++) s2.insert(i);
    int k;
    cin >> k;
    for (int i = (0); i < (n); i++) {
      int mi = -1;
      for (int j = (0); j < (3); j++)
        if (p[i][j] == k) {
          mi = j;
          break;
        }
      if (mi == -1) {
        for (int j = (0); j < (3); j++) s.insert(p[i][j]);
      } else {
        for (int j = (0); j < (3); j++)
          if (j != mi) s.insert(p[i][j]);
        int f = 1;
        for (int j = (0); j < (3); j++)
          if (a[p[i][mi]] > a[p[i][j]]) f = 0;
        s2.erase(k);
        if (f) {
          for (int first : s) s2.erase(first);
          vector<int> v;
          int big = -1;
          for (int j = (0); j < (3); j++)
            if (j != mi) big = max(big, p[i][j]);
          for (int first : s)
            if (first > big) v.push_back(first);
          for (int first : v) s.erase(first), s2.insert(first);
          for (int first : s) cout << first << " ";
          for (int first : s2) cout << first << " ";
          exit(0);
        } else {
          for (int first : s2) cout << first << " ";
        }
      }
    }
  }
  return 0;
}
