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;
typedef pair<ll,ll> P;
ll bi[514514];
void add(ll n,ll i,ll x){
	for(;i<=n;i+=i&-i)bi[i]+=x;
}
ll sum(ll i){
	ll num=0;
	for(;i>0;i-=i&-i)num+=bi[i];
	return num;
}
ll c[514514],g[514514],ans[514514];
int main(){
	ll n,q;
	cin>>n>>q;
	vector<vector<ll>>v(n+1),w(n+1);
	for(int i=1;i<=n;i++)cin>>c[i];
	for(int i=0;i<q;i++){
		ll l,r;
		cin>>l>>r;
		v[r].push_back(l);
		w[r].push_back(i);
	}
	for(int i=1;i<=n;i++){
		if(g[c[i]])add(n,g[c[i]],-1);
		add(n,i,1);
		g[c[i]]=i;
		ll cnt=0;
		for(ll p:v[i]){
			ans[w[i][cnt]]=sum(i)-sum(p-1);
			cnt++;
		}
	}
	for(int i=0;i<q;i++)cout<<ans[i]<<endl;
	return 0;
}
