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>
#define PI 3.141592653589793238462
using namespace std;
typedef long long ll;
typedef double long db;
struct ppp{ll l,r,pos;}p[500005];
ll a[500005],tree[500005],ans[500005];
bool cmp(ppp x,ppp y){
    return x.r<y.r;
}
unordered_map<ll,ll> k;
void add(ll x,ll k){
    while(x<=500000){
        tree[x]+=k;
        x+=x&(-x);
    }
}
ll query(ll x){
    ll res=0;
    while(x){
        res+=tree[x];
        x-=x&(-x);
    }
    return res;
}
int main(){
    int n,q;cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=q;i++){
        cin>>p[i].l>>p[i].r;p[i].pos=i;
    }
    sort(p+1,p+1+q,cmp);ll now=1;
    for(int i=1;i<=q;i++){
        while(now<=p[i].r){
            if(k[a[now]]==0){
                k[a[now]]=now;
                add(now,1);
            }
            else{
                add(k[a[now]],-1);
                k[a[now]]=now;add(now,1);
            }
            now++;
        }
        ans[p[i].pos]=query(p[i].r)-query(p[i].l-1);
    }
    for(ll i=1;i<=q;i++){
        printf("%lld\n",ans[i]);
    }
}