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 foreach(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define chmax(a,b) a=max(a,b)
int n,Q,bl;
int c[500005];
int ans=0,cnt[500005];
struct query{
	int l,r,id;
}q[500005];
int qans[500005];
bool cmp(query a,query b){
	return (a.r/bl)==(b.r/bl)?a.l<b.l:a.r<b.r;
}
void add(int x){
	if(!cnt[c[x]]){
		ans++;
	}
	cnt[c[x]]++;
}
void del(int x){
	cnt[c[x]]--;
	if(!cnt[c[x]]){
		ans--;
	}
}
int main(){
	cin>>n>>Q;
	bl=n/sqrt(Q*2/3);
	for(int i=1;i<=n;++i){
		cin>>c[i];
	}
	for(int i=1;i<=Q;++i){
		cin>>q[i].l>>q[i].r;
		q[i].id=i;
	}
	sort(q+1,q+1+Q,cmp);
	int l=0,r=0;
	for(int i=1;i<=Q;++i){
		int ql=q[i].l,qr=q[i].r;
//		cout<<ql<<' '<<qr<<'\n';
		while(l<ql){
			del(l);
			l++;
		}
		while(l>ql){
			l--;
			add(l);
		}
		while(r>qr){
			del(r);
			r--;
		}
		while(r<qr){
			r++;
			add(r);
		}
		qans[q[i].id]=ans;
	}
	for(int i=1;i<=Q;++i){
		cout<<qans[i]<<'\n';
	}
	return 0;
}
