Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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.

No tag edit access

B. Sereja and Suffixes

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSereja has an array *a*, consisting of *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n}. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out *m* integers *l*_{1}, *l*_{2}, ..., *l*_{m} (1 ≤ *l*_{i} ≤ *n*). For each number *l*_{i} he wants to know how many distinct numbers are staying on the positions *l*_{i}, *l*_{i} + 1, ..., *n*. Formally, he want to find the number of distinct numbers among *a*_{li}, *a*_{li + 1}, ..., *a*_{n}.?

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 *l*_{i}.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{5}). The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{5}) — the array elements.

Next *m* lines contain integers *l*_{1}, *l*_{2}, ..., *l*_{m}. The *i*-th line contains integer *l*_{i} (1 ≤ *l*_{i} ≤ *n*).

Output

Print *m* lines — on the *i*-th line print the answer to the number *l*_{i}.

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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/21/2018 04:11:36 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|