Sereja and Suffixes

题意翻译

给出一个长度为 $n$ 的序列 $\{A\}$,给出 $m$ 个查询 $l$ ,对于每个查询,输出 $[l,n]$ 的区间内不同数的个数。

题目描述

Sereja 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} $ .

输入输出格式

输入格式


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) $ .

输出格式


Print $ m $ lines — on the $ i $ -th line print the answer to the number $ l_{i} $ .

输入输出样例

输入样例 #1

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

输出样例 #1

6
6
6
6
6
5
4
3
2
1