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 <cstdio>
#include <algorithm>
#include <cmath>
#define N 1000070

using namespace std;

inline int read(){
   int s=0,w=1;
   char 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;
}

struct Node{
	int l,r,num;
}q[N];
int n,m,a[N],block,ans,res[N],cnt[N];

bool cmp(Node a,Node b){
	return (a.l/block)^(b.l/block)?a.l<b.l:(((a.l/block)&1)?a.r<b.r:a.r>b.r);
}

void add(int x){
	cnt[x]++;
	if(cnt[x]==1) ans++;
}

void del(int x){
	cnt[x]--;
	if(cnt[x]==0) ans--;
}

int main(void){
	n=read();m=read();
	for(int i=1;i<=n;++i)
		a[i]=read();
	block=n/sqrt(m*2/3);
	for(int i=1;i<=m;++i){
		q[i].l=read();
		q[i].r=read();
		q[i].num=i; 
	}
	std::sort(q+1,q+m+1,cmp);
	int l=0,r=0;
	for(int i=1;i<=m;++i){
		while(l>q[i].l) add(a[--l]);
		while(l<q[i].l) del(a[l++]);
		while(r>q[i].r) del(a[r--]);
		while(r<q[i].r) add(a[++r]);
		res[q[i].num]=ans;
	}
	for(int i=1;i<=m;++i)
		printf("%d\n",res[i]);
}