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

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

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 
//package org.javadov.codeforces.contest413;

import java.io.*;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeSet;

/**
 * Created by asgar on 2/21/17.
 */

public class TaskB {
    public void solve(int testNumber, InputReader in, PrintWriter out) throws IOException {
        int n = in.nextInt();
        int[] p = in.readIntArray(n);
        int[] a = new int[n], b = new int[n];

        TreeSet<Pair>[] maps = new TreeSet[3];
        for (int i = 0; i < maps.length; i++) {
            maps[i] = new TreeSet<>();
        }

        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt() - 1;
            maps[a[i]].add(new Pair(i, p[i]));
        }
        for (int i = 0; i < n; i++) {
            b[i] = in.nextInt() - 1;
            maps[b[i]].add(new Pair(i, p[i]));
        }

        //out.println(maps[0]);
        //out.flush();

        int m =in.nextInt();
        for (int i = 0; i < m; i++) {
            int color = in.nextInt() - 1;
            if (maps[color].isEmpty()) {
                out.print(-1);
                out.print(" ");
            } else {
                Pair result = maps[color].pollFirst();
                out.print(result.price);
                out.print(" ");
                if (a[result.index] != b[result.index]) {
                    if (a[result.index] != color)
                        maps[a[result.index]].remove(result);
                    else
                        maps[b[result.index]].remove(result);
                }
            }
        }
        return;
    }

    static class Pair implements Comparable <Pair> {
        int index, price;

        public Pair(int index, int price) {
            this.index = index;
            this.price = price;
        }

        @Override
        public int compareTo(Pair o) {
            return this.price - o.price;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (!(o instanceof Pair)) return false;

            Pair pair = (Pair) o;

            if (index != pair.index) return false;
            return price == pair.price;

        }

        @Override
        public int hashCode() {
            int result = index;
            result = 31 * result + price;
            return result;
        }

        @Override
        public String toString() {
            return "Pair{" +
                    "index=" + index +
                    ", price=" + price +
                    '}';
        }
    }
    public static void main(String[] args) throws IOException {
        try (InputReader reader = new InputReader(System.in);
             PrintWriter writer = new PrintWriter(System.out)) {
            new TaskB().solve(1, reader, writer);
            writer.flush();
        }
    }

    static class InputReader extends BufferedReader {
        StringTokenizer tokenizer;

        public InputReader(InputStream inputStream) {
            super(new InputStreamReader(inputStream), 32768);
        }

        public InputReader(String filename) {
            super(new InputStreamReader(Thread.currentThread().getContextClassLoader().getResourceAsStream(filename)));
        }

        public String next() throws IOException {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                String line = readLine();
                if (line == null)
                    return null;
                tokenizer = new StringTokenizer(line);
            }
            return tokenizer.nextToken();
        }

        public Integer nextInt() throws IOException {
            return Integer.valueOf(next());
        }

        public Long nextLong() throws IOException {
            return Long.valueOf(next());
        }

        public int[] readIntArray (int size) throws IOException {
            int[] array = new int[size];
            for (int i = 0; i < size; i++)
                array[i] = nextInt();
            return array;
        }
    }

    static class FastWriter extends PrintWriter {
        public FastWriter(OutputStream outputStream) {
            super(outputStream);
        }
    }
}


