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=5e5+5;
int block;
struct query{
	int l,r,id;
	bool operator < (const query& x) const{
		if(l/block!=x.l/block) return l/block<x.l/block;
		if(l/block%2) return r<x.r;
		else return r>x.r;
	}
}seg[N];
int a[N];
int cnt[N];
int res[N];
int ans;
void add(int x){
	cnt[x]++;
	if(cnt[x]==1) ans++;
}
void del(int x){
	cnt[x]--;
	if(cnt[x]==0) ans--;
}
int main(){
	int n,q;
	scanf("%d %d",&n,&q);
	block=int(sqrt(1.0*n));
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=q;i++){
		scanf("%d %d",&seg[i].l,&seg[i].r);
		seg[i].id=i;
	}
	sort(seg+1,seg+q+1);
	int l=seg[1].l,r=seg[1].l-1;
	for(int i=1;i<=q;i++){
		while(l<seg[i].l) del(a[l++]);
		while(r>seg[i].r) del(a[r--]);
		while(l>seg[i].l) add(a[--l]);
		while(r<seg[i].r) add(a[++r]);
		res[seg[i].id]=ans;
	}
	for(int i=1;i<=q;i++){
		printf("%d\n",res[i]);
	}
	return 0;
}