T-shirt buying
Contest: Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)
Difficulty rating: 1400
Tags: data structures, implementation

A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All values pi are distinct, and values ai and bi 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 cj.

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 format:
The first line contains single integer n (1 ≤ n ≤ 200 000) — the number of t-shirts.

The following line contains sequence of integers p1, p2, ..., pn (1 ≤ pi ≤ 1 000 000 000), where pi equals to the price of the i-th t-shirt.

The following line contains sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 3), where ai equals to the front color of the i-th t-shirt.

The following line contains sequence of integers b1, b2, ..., bn (1 ≤ bi ≤ 3), where bi 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 c1, c2, ..., cm (1 ≤ cj ≤ 3), where cj 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 format:
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.

Constraints:
Time limit: 3.0 s
Memory limit: 256.0 MB

Example input:
5
300 200 400 500 911
1 2 1 2 3
2 1 3 2 1
6
2 3 1 2 1 1

Example output:
200 400 300 500 911 -1

Example input:
2
1000000000 1
1 1
1 2
2
2 1

Example output:
1 1000000000

Editorial:
Let's store in three arrays t-shirts which have appropriate color. About each t-shirt is enough to store its index, but we will additionally store its cost. It is possible that one t-shirt will be in two arrays (if this t-shirt colorful).
Then we need to sort t-shirts in each array in increasing order of cost. After that we will process buyers. Also for each array we will store the pointer to leftmost t-shirt which was not purchased yet.
For a new buyer we need to look on array with t-shirts which appropriate to his favorite color. Using appropriate pointer let's iterate to the right until there are t-shirts or until we not found unsold t-shirt (to this we can store one more array used with type bool — did we sell or no appropriate t-shirt). If there are no t-shirt with needed color — print -1. In the other case, print the cost of founded t-shirt and tag in array used that we sold this t-shirt.