Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

data structures

implementation

*1400

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. T-shirt buying

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA 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*_{1}, *p*_{2}, ..., *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*_{1}, *a*_{2}, ..., *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*_{1}, *b*_{2}, ..., *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*_{1}, *c*_{2}, ..., *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

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/06/2024 01:04:39 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|