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;
typedef long long ll;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1e9+5;
const int N=5e5+5;
const int mod=1e9+7;


struct Query{
	int l,r,id;
};

Query Q[N];
int ans[N],a[N],cnt[N];
int cur_res;

void add(int t,int val){
	if(val==1){
		if(++cnt[a[t]]==1) ++cur_res;
	}
	else{
		if(--cnt[a[t]]==0) --cur_res;
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,q;
	cin>>n>>q;
	for(int i=0;i<n;++i) cin>>a[i];
	for(int i=0;i<q;++i){
		int x,y;
		cin>>x>>y;
		--x;
		Q[i]=Query{x,y,i};
	}
	int num=1000;
	auto cmp=[&](const Query& a,const Query& b){
		int al=a.l/num;
		int bl=b.l/num;
		return al<bl||(al==bl&&a.r<b.r);
	};
	sort(Q,Q+q,cmp);
	int l=0,r=0;
	for(int i=0;i<q;++i){
		while(l>Q[i].l) add(--l,1);
		while(l<Q[i].l) add(l++,-1);
		while(r>Q[i].r) add(--r,-1);
		while(r<Q[i].r) add(r++,1);
		ans[Q[i].id]=cur_res;
	} 
	for(int i=0;i<q;++i){
		cout<<ans[i]<<endl;
	}
	return 0;
}
