We have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.

You are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?

Constraints

* 1\leq N,Q \leq 5 \times 10^5
* 1\leq c_i \leq N
* 1\leq l_i \leq r_i \leq N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N Q
c_1 c_2 \cdots c_N
l_1 r_1
l_2 r_2
:
l_Q r_Q


Output

Print Q lines. The i-th line should contain the response to the i-th query.

Examples

Input

4 3
1 2 1 3
1 3
2 4
3 3


Output

2
3
1


Input

10 10
2 5 6 5 2 1 7 9 7 2
5 5
2 4
6 7
2 2
7 8
7 9
1 8
6 9
8 10
6 8


Output

1
2
2
1
2
2
6
3
3
3
#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 10;
const int Q = 1e6 + 10;
const int K = 1e6 + 10;

int n , q , a[N] , bel[N] , cnt[K] , ans[Q] , now;

struct Mo_Team{
	int l , r , id;
	bool operator < (const Mo_Team &a) const
	 {
		return (bel[l] ^ bel[a.l]) ? bel[l] < bel[a.l] : ((bel[l] & 1) ? r < a.r : r > a.r);
	}
}Ques[Q];

void Add(int pos){
	now += !(cnt[a[pos]]++);
}

void Del(int pos){
	now -= !(--cnt[a[pos]]);
}

int main(){
	scanf("%d %d" , &n , &q);
	for(int i = 1; i <= n; i++) scanf("%d" , &a[i]);
	int num = sqrt(n) , siz = ceil(1.0 * n / num);
	for(int i = 1; i <= num; i++)
		for(int j = (i - 1) * siz + 1; j <= i * siz; j++) bel[j] = i;
	for(int i = 1; i <= q; i++)
		scanf("%d %d" , &Ques[i].l , &Ques[i].r) , Ques[i].id = i;
	sort(Ques + 1 , Ques + q + 1);
	int l = 1 , r = 0;
	for(int i = 1; i <= q; i++){
		while(l < Ques[i].l) Del(l++);
		while(l > Ques[i].l) Add(--l);
		while(r < Ques[i].r) Add(++r);
		while(r > Ques[i].r) Del(r--);
		ans[Ques[i].id] = now;
	}
	for(int i = 1; i <= q; i++) printf("%d\n" , ans[i]);
	return 0;
}	