T-shirt buying

一包共 $n$ 件T恤被送到了商店。每件T恤被三个正整数 $p_{i}$ , $a_{i}$ 和 $b_{i}$ 所描述。 $p_{i}$ 是第 $i$ 件T恤的价格， $a_{i}$ 是第 $i$ 件T恤正面的颜色， $b_{i}$ 是第 $i$ 件T恤背面的颜色。所有 $p_{i}$ 都各不相同， $a_{i}$ 和 $b_{i}$ 都是1~3的整数。 有 $m$ 个顾客，每人都仅想买一件T恤。第 $i$ 个顾客最喜欢的颜色是 $c_{j}$ 。 如果一件T恤至少一面（前或后）的颜色是顾客喜欢的，他才会将其买下；如果有多件T恤符合条件，他会选择最便宜的；如果没有符合条件的，他什么都不会买。我们假定顾客都乖巧地排着队一个一个来，前一个顾客走后第二个才能被接待。 你需要计算每个顾客分别花了多少钱。 Translated by @长河落日

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.

The first line contains single integer $ n $ ( $ 1<=n<=200000 $ ) — the number of t-shirts. The following line contains sequence of integers $ p_{1},p_{2},...,p_{n} $ ( $ 1<=p_{i}<=1000000000 $ ), 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<=200000 $ ) — 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.

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.

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

200 400 300 500 911 -1 

2
1000000000 1
1 1
1 2
2
2 1

1 1000000000