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 rep(k,i,n) for(ll i=k;i<n;i++)
const ll N=5e5+10;
static ll dat[N];
void init(){
    rep(0,i,N)dat[i]=0;
}
void add(ll i,ll x){
    for(;i<N;i+=i&-i)dat[i]+=x;
}
ll sum(ll i){
    ll res=0;
    for(;i>0;i-=i&-i)res+=dat[i];
    return res;
}
ll rangesum(ll l,ll r){
    return sum(r)-sum(l-1);
}
static ll n,q,c[N],ans[N],a[N];
static vector<ll>ql[N],qid[N];
int main(void){
    cin>>n>>q;
    rep(1,i,n+1)cin>>c[i];
    rep(0,i,q){
        ll l,r;
        cin>>l>>r;
        ql[r].push_back(l);
        qid[r].push_back(i);
    }
    init();
    rep(0,i,N)a[i]=0;
    rep(1,i,n+1){
        if(a[c[i]]>0)add(a[c[i]],-1);
        add(i,+1);
        a[c[i]]=i;
        rep(0,j,ql[i].size()){
            ans[qid[i][j]]=rangesum(ql[i][j],i);
        }
    }
    rep(0,i,q)cout<<ans[i]<<endl;
}