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;
#define N 510000
struct ques{
	int l,r,id;
	int ans;
}q[N];
int pos[N],c[N],s[N],ans,n,m;
bool cmp(ques x,ques y)
{
	if(pos[x.l] == pos[y.l])
	return x.r < y.r;
	return x.l < y.l;
}
bool __id(ques x,ques y)
{
	return x.id < y.id;
}
void add(int color)
{
	s[color]++;
	ans += s[color] == 1;
}
void del(int color)
{
	s[color]--;
	ans -= s[color] == 0;
}
int main()
{
	cin>>n>>m;
	for(int i = 1;i <= n;i++)
	cin>>c[i];
	int size = (int)sqrt(n);
	for(int i = 1;i <= n;i++)
	pos[i] = (i-1)/size+1;
	for(int i = 1;i <= m;i++)
	{
		cin>>q[i].l>>q[i].r;
		q[i].id = i;
	}	
	sort(q+1,q+1+m,cmp);
	int l = 1,r = 0;
	for(int i = 1;i <= m;i++)
	{
		while(q[i].l<l) add(c[--l]);
		while(q[i].l>l) del(c[l++]);
		while(q[i].r>r) add(c[++r]);
		while(q[i].r<r) del(c[r--]);
		q[i].ans = ans;
	}
	sort(q+1,q+1+m,__id);
	for(int i = 1;i <= m;i++ )
	cout<<q[i].ans<<endl;
	return 0;
}