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 fi first
#define se second
const int N=2e6+1;
int n,q;
int c[N];
int p[N];
int f[N];
int ans[N];
int lz[N];
vector<pair<int,int> >qr[N];
void push(int id){
	lz[id*2]+=lz[id];
	lz[id*2+1]+=lz[id];
	lz[id]=0;
}
void upd(int id,int l,int r,int ql,int qr,int v){
	if(l>qr || r<ql) return;
	if(ql<=l && r<=qr){
		lz[id]+=v;return;
	}
	push(id);
	int mid=(l+r)/2;
	upd(id*2,l,mid,ql,qr,v);
	upd(id*2+1,mid+1,r,ql,qr,v);
}
int qry(int id,int l,int r,int p){
	if(l==r) return lz[id];
	push(id);
	int mid=(l+r)/2;
	if(p<=mid) return qry(id*2,l,mid,p);
	else return qry(id*2+1,mid+1,r,p);
}
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> q;
	for(int i=1; i<=n ;i++){
		cin >> c[i];
		p[i]=f[c[i]];
		f[c[i]]=i;
	}
	for(int i=1; i<=q ;i++){
		int l,r;cin >> l >> r;
		qr[r].push_back({l,i});
	}
	for(int i=1; i<=n ;i++){
		upd(1,1,n,p[i]+1,i,1);
		for(auto c:qr[i]){
			ans[c.se]=qry(1,1,n,c.fi);
		}
	}
	for(int i=1; i<=q ;i++){
		cout << ans[i] << '\n';
	}
	
}
