T-shirt buying

A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers p _i, a _i and b _i, where p _i is the price of the i-th t-shirt, a _i is front color of the i-th t-shirt and b _i is back color of the i-th t-shirt. All values p _i are distinct, and values a _i and b _i are integers from 1 to 3.

m buyers will come to the shop. Each of them wants to buy exactly one t-shirt. For the j-th buyer we know his favorite color c _j.

A buyer agrees to buy a t-shirt, if at least one side (front or back) is painted in his favorite color. Among all t-shirts that have colors acceptable to this buyer he will choose the cheapest one. If there are no such t-shirts, the buyer won’t buy anything. Assume that the buyers come one by one, and each buyer is served only after the previous one is served.

You are to compute the prices each buyer will pay for t-shirts.

Input

The first line contains single integer n (1 ≤ n ≤ 200 000) — the number of t-shirts.

The following line contains sequence of integers p ₁, p ₂, …, p _n (1 ≤ p _i ≤ 1 000 000 000), where p _i equals to the price of the i-th t-shirt.

The following line contains sequence of integers a ₁, a ₂, …, a _n (1 ≤ a _i ≤ 3), where a _i equals to the front color of the i-th t-shirt.

The following line contains sequence of integers b ₁, b ₂, …, b _n (1 ≤ b _i ≤ 3), where b _i equals to the back color of the i-th t-shirt.

The next line contains single integer m (1 ≤ m ≤ 200 000) — the number of buyers.

The following line contains sequence c ₁, c ₂, …, c _m (1 ≤ c _j ≤ 3), where c _j equals to the favorite color of the j-th buyer. The buyers will come to the shop in the order they are given in the input. Each buyer is served only after the previous one is served.

Output

Print to the first line m integers — the j-th integer should be equal to the price of the t-shirt which the j-th buyer will buy. If the j-th buyer won’t buy anything, print -1.

Examples

input

5
300 200 400 500 911
1 2 1 2 3
2 1 3 2 1
6
2 3 1 2 1 1

output

200 400 300 500 911 -1 

input

2
1000000000 1
1 1
1 2
2
2 1

output

1 1000000000 

Solution:

#include <bits/stdc++.h>

using namespace std;

const int N = 1234567;

set < pair <int, int> > s[7];
int p[N], a[N], b[N];
bool alive[N];

int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
    scanf("%d", p + i);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", b + i);
  }
  for (int i = 0; i < n; i++) {
    s[a[i]].insert(make_pair(p[i], i));
    s[b[i]].insert(make_pair(p[i], i));
    alive[i] = true;
  }
  int tt;
  scanf("%d", &tt);
  while (tt--) {
    int c;
    scanf("%d", &c);
    int ans = -1;
    while (!s.empty()) {
      int x = (*(s.begin())).second;
      s.erase(s.begin());
      if (!alive[x]) {
        continue;
      }
      alive[x] = false;
      ans = p[x];
      break;
    }
    printf("%d ", ans);
  }
  puts("");
  return 0;
}