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>
#define maxn 500010
using namespace std;
int n,m;
int c[maxn],book[maxn],tree[maxn],ans[maxn];
struct node{
	int l,r,seq;
}q[maxn];
int lowbit(int x){
	return x&-x;
}
void add(int pos,int val){
	while(pos<=n){
		tree[pos]+=val;
		pos+=lowbit(pos);
	}
}
int sum(int pos){
	int ret=0;
	while(pos>0){
		ret+=tree[pos];
		pos-=lowbit(pos);
	}
	return ret;
}
int cmp(node a,node b){
	return a.r<b.r;
}
int main(){
	int i,j,start;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)scanf("%d",&c[i]);
	for(i=1;i<=m;i++)scanf("%d%d",&q[i].l,&q[i].r),q[i].seq=i;
	sort(q+1,q+1+m,cmp);
	start=1;
	for(i=1;i<=m;i++){
		for(j=start;j<=q[i].r;j++){
			if(book[c[j]])add(book[c[j]],-1);
			add(j,1),book[c[j]]=j;
		}
		start=q[i].r+1;
		ans[q[i].seq]=sum(q[i].r)-sum(q[i].l-1);
	}
	for(i=1;i<=m;i++)printf("%d\n",ans[i]);
	return 0;
}
 