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 <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int c[500010],last[500010],ans[500010];
pair<pair<int,int>,int> p[500010];
int n,seg[1000010];
void update(int p,int val){
    for(seg[p += n] = val;p>1;p>>=1){
        seg[p>>1] = seg[p] + seg[p^1];
    }
}

int query(int l,int r){
    int res = 0;
    for(l += n,r += n; l<r;l>>=1,r>>=1){
        if(l&1) res += seg[l++];
        if(r&1) res += seg[--r];
    }
    return res;
}

int main(){
    int i,q; cin >> n >> q;
    for(i=0;i<n;i++){
        cin >> c[i]; c[i]--; last[i] = -1;
    }
    for(i=0;i<q;i++){
        int l,r; cin >> l >> r; l--; r--;
        p[i] = {{r,l},i};
    }
    sort(p,p + q);
    int r = 0;
    for(i=0;i<q;i++){
        pair<int,int> pp = p[i].first;
        while(r<=pp.first){
            if(last[c[r]]!=-1) update(last[c[r]],0);
            update(r,1);
            last[c[r]] = r; r++;
        }
        ans[p[i].second] = query(pp.second,pp.first + 1);
    }
    for(i=0;i<q;i++) cout << ans[i] << endl;
}