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>
#define maxn 500005
using namespace std;

const int K=800;

int ans[maxn];
int n,m;
int a[maxn];

struct query{
	int l,r,id;
}q[maxn];

int cnt[maxn];

bool cmp(query x,query y){
	if(x.l/K!=y.l/K)return x.l<y.l;
	return x.r<y.r;
}

int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++){
		cin>>q[i].l>>q[i].r;
		q[i].id=i;
	}
	sort(q+1,q+m+1,cmp);
	int L,R;
	L=R=0;
	int res=0;
	for(int i=1;i<=m;i++){
		while(R<q[i].r){
			R++;
			cnt[a[R]]++;
			if(cnt[a[R]]==1)res++;
		}
		while(R>q[i].r){
			cnt[a[R]]--;
			if(cnt[a[R]]==0)res--;
			R--;
		}
		while(L>q[i].l){
			L--;
			cnt[a[L]]++;
			if(cnt[a[L]]==1)res++;
		}
		while(L<q[i].l){
			cnt[a[L]]--;
			if(cnt[a[L]]==0)res--;
			L++;
		}
		ans[q[i].id]=res;
	}
	for(int i=1;i<=m;i++)cout<<ans[i]<<endl;
	
}