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 maxn=5e5+5;
int n,q,bl,cnt,siz,Left,Right,t[maxn],cl[maxn],ans[maxn];
struct Query{
	int l,r,ls,num;
}qua[maxn];
bool cmp(Query a,Query b)
{
	if(a.ls==b.ls) return a.r<b.r;
	else return a.ls<b.ls;
}
void Minus(int loc)
{
	if(t[cl[loc]]==1) cnt--;
	t[cl[loc]]--;
}
void Add(int loc)
{
	if(t[cl[loc]]==0) cnt++;
	t[cl[loc]]++;
}
int main()
{
	scanf("%d%d",&n,&q),siz=sqrt(n);
	for(int i=1;i<=n;i++) scanf("%d",&cl[i]);
	for(int i=1;i<=q;i++)
	{
		scanf("%d%d",&qua[i].l,&qua[i].r);
		qua[i].num=i;
		if(qua[i].l%siz==0) qua[i].ls=qua[i].l/siz;
		else qua[i].ls=qua[i].l/siz+1;
	}
	sort(qua+1,qua+1+q,cmp);
	for(int i=1;i<=q;i++)
	{
		while(Right<qua[i].r) Right++,Add(Right);
		while(Left>qua[i].l) Left--,Add(Left);
		while(Left<qua[i].l) Minus(Left),Left++;
		while(Right>qua[i].r) Minus(Right),Right--;
		ans[qua[i].num]=cnt;
	}
	for(int i=1;i<=q;i++) printf("%d\n",ans[i]);
	return 0;
}
