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=1100000;
int n,m,ans[N],tree[N],a[N],book[N];
struct Node{int l,r,place;}p[N];
inline int read()
{
	int s=0,w=1;
	char ch;ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') w=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int lowbit(int x){return x&(-x);}
void Add(int x,int p)
{
	while(x<=n)
	{
		tree[x]+=p;
		x+=lowbit(x);
	}
}
int Ask(int x)
{
	int ans=0;
	while(x)
	{
		ans+=tree[x];
		x-=lowbit(x);
	}
	return ans;
}
bool cp(Node x,Node y){return x.r<y.r;}
int main()
{
	n=read(); m=read();
	for(int i=1;i<=n;i++) a[i]=read();
	for(int i=1;i<=m;i++) {p[i].l=read();p[i].r=read(); p[i].place=i;}
	sort(p+1,p+1+m,cp);int nxt=1;
	for(int i=1;i<=m;i++)
	{
		for(int j=nxt;j<=p[i].r;j++)
		{
			if(book[a[j]]) Add(book[a[j]],-1);
			Add(j,1);book[a[j]]=j;
		}nxt=p[i].r+1;ans[p[i].place]=Ask(p[i].r)-Ask(p[i].l-1);
	}
	for(int i=1;i<=m;i++) printf("%d\n",ans[i]);
	return 0;
}