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>
#include<vector>
using namespace std;
#define ll long long int
ll a[500005], q[500005];
ll sz = 720, ans;

struct ele{
  ll l,r, id;  
    
};

ele p[500005];
ll f[500005];
bool cmp(ele p1, ele p2){
    ll v1 = p1.l/sz;
    ll v2 = p2.l/sz;
    if(v1 == v2) {
        if(v1 & 1) return p1.r > p2.r;
        return p1.r < p2.r;
    }
    return p1.l < p2.l;
}

void add(ll v){
    if(f[v] == 0) ans+=1;
    f[v] += 1;
}

void rem(ll v){
    if(f[v] == 1) ans -=1;
    f[v]-=1;
}




int main() {
	// your code goes here
	ll i,j,k,n,m,t;
	cin>>n>>t;
	for(i=1;i<=n;i++) cin>>a[i];
	for(i=1;i<=t;i++){
	    cin>>p[i].l>>p[i].r;
	    p[i].id = i;
	}
	
	sort(p+1, p+t+1, cmp);
	ll lt = 1, rt = 0; ans = 0;
	for(i=1;i<=t;i++){
	    ll cl = p[i].l, cr = p[i].r, cid = p[i].id;
	    while(rt < cr) add(a[++rt]);
	    while(lt > cl) add(a[--lt]);
	    while(rt>cr) rem(a[rt--]);
	    while(lt<cl) rem(a[lt++]);
	   // cout<<cl<<" "<<cr<<" "<<ans<<"\n";
	    q[cid] = ans;
	}
	//cout<<"\n";
	
	for(int i=1;i<=t;i++) cout<<q[i]<<"\n";
	
	return 0;
}
