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;
const int maxn=5e5+5;
const int MOD=1e9+7;


int a[maxn],c[maxn];
int mp[maxn];
int n;
struct qq{
    int l,r;
    int index;
}q[maxn];
int cmp(qq x,qq y){
    return x.r<y.r;
}
int lowbit(int x){
    return x&(-x);
}
void update (int i,int k){
    int x=i;
    while(i<=n){
        c[i]+=k;
        i+=lowbit(i);
    }
}
ll getsum(int i){
    ll ans=0;
    int x=i;
    while(i>0){
        ans+=c[i];
        i-=lowbit(i);
    }
    return ans;
}
int ans[maxn];
int main()
{
    int m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=m;i++){
        cin>>q[i].l>>q[i].r;
        q[i].index=i;
    }
    sort(q+1,q+1+m,cmp);
    int next=1;
    for(int i=1;i<=m;i++){
        for(int j=next;j<=q[i].r;j++){
            if(mp[a[j]]){
                update(mp[a[j]],-1);
            }
            update(j,1);
            mp[a[j]]=j;
        }
        next=q[i].r+1;
        ans[q[i].index]=getsum(q[i].r)-getsum(q[i].l-1);
    }
    for(int i=1;i<=m;i++) cout<<ans[i]<<endl;
}


