Problem: Sereja has an array a, consisting of n integers a1, a2, ..., an. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out m integers l1, l2, ..., lm (1 ≤ li ≤ n). For each number li he wants to know how many distinct numbers are staying on the positions li, li + 1, ..., n. Formally, he want to find the number of distinct numbers among ali, ali + 1, ..., an.?

Sereja wrote out the necessary array elements but the array was so large and the boy was so pressed for time. Help him, find the answer for the described question for each li.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105) — the array elements.

Next m lines contain integers l1, l2, ..., lm. The i-th line contains integer li (1 ≤ li ≤ n).

Output

Print m lines — on the i-th line print the answer to the number li.

Examples

Input

10 10
1 2 3 4 1 2 3 4 100000 99999
1
2
3
4
5
6
7
8
9
10


Output

6
6
6
6
6
5
4
3
2
1

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class Main {

    static PrintWriter out;
    static FastReader fr;
    // make it false if Multiple test case is not in the question
    final static boolean multipleTC = false;
    // Global Variables
    final static int MOD = (int) 1e9 + 7;
    final static double INF = Double.POSITIVE_INFINITY;
    final static int MAX = (int) 1e5;
    static int TestCase = 1;

    // for pre processing if needed
    void pre() throws Exception {
    }

    public static void main(String[] args) throws Exception {

        new Main().run();
    }

    // input output handled here
    private Object solve() throws Exception {
        int n = fr.ni(), m = fr.ni();
        int[] arr = fr.nextIntArray(n);
        StringBuilder sb = new StringBuilder();
        HashSet<Integer> hs = new HashSet<>();
        HashMap<Integer, Integer> map = new HashMap<>();
        map.put(n, 1);
        hs.add(arr[n - 1]);
        for (int i = n - 1; i > 0; i--) {
            hs.add(arr[i - 1]);
            map.put(i, hs.size());
        }

        for (int i = 0; i < m; i++) {
            // hs.clear();
            int l = fr.ni();
            sb.append(map.get(l) + "\n");
        }

        return sb;
    }

    void run() throws Exception {
        // long start_time = System.nanoTime();

        try {
            fr = new FastReader("in0.txt");
            out = new PrintWriter("out0.txt");
        } catch (Exception e) {
            fr = new FastReader();
            out = new PrintWriter(System.out);
        }
        pre();
        StringBuilder print = new StringBuilder("");

        int T = (multipleTC) ? fr.ni() : 1;
        for (TestCase = 1; TestCase <= T - 1; TestCase++) {
            print.append(solve()).append("\n");
        }
        print.append(solve());
        p(print);
        // long end_time = System.nanoTime();
        // System.out.printf("Running Time in sec : %2.10f", (double) (end_time -
        // start_time) * (double) 1e-9);

        out.flush();
        out.close();
    }

    static void p(Object o) {
        out.print(o);
    }

    static void pln(Object o) {
        out.println(o);
    }

    static void psp(Object o) {
        out.print(o + " ");
    }

    static void pnf(Object o) {
        out.println(o);
        out.flush();
    }

    static void deb(Object... x) {
        System.out.print("#" + TestCase + " = ");
        for (int i = 0; i < x.length - 1; i++)
            System.out.print(x[i] + " , ");
        System.out.println(x[x.length - 1]);

    }

    public <Type> Type also(Type a, Type b) throws Exception {
        return a;
    }

    class FastReader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public FastReader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public FastReader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String next() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == ' ')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }

        String n() throws Exception {
            return fr.next();
        }

        String nln() throws Exception {
            return fr.readLine().trim();
        }

        int ni() throws Exception {
            return fr.nextInt();
        }

        long nl() throws Exception {
            return fr.nextLong();
        }

        double nd() throws Exception {
            return fr.nextDouble();
        }

        int[] nextIntArray(int n) throws Exception {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = fr.nextInt();
            }
            return a;
        }

        long[] nextLongArray(int n) throws Exception {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = fr.nextLong();
            }
            return a;
        }
    }

}