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 <vector>
#include <algorithm>
using namespace std;

int n, q, c[500005], l[500005], r[500005], p[500005], bit[500005], ans[500005];
vector <int> v;

bool cmp(int x, int y){
    return r[x] <= r[y];
}
void update(int x, int d){
    while (x <= n){
        bit[x] += d;
        x += x & (-x);
    }
}
int query(int x){
    int ret = 0;
    while (x){
        ret += bit[x];
        x -= x & (-x);
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++){
        cin >> c[i];
    }
    for (int i = 0; i < q; i++){
        cin >> l[i] >> r[i];
        v.push_back(i);
    }
    int pos = 0;
    sort(v.begin(), v.end(), cmp);
    for (auto i:v){
        for (int j = pos+1; j <= r[i]; j++){
            if (p[c[j]]) update(p[c[j]], -1);
            update(j, 1);
            p[c[j]] = j;
        }
        pos = r[i];
        ans[i] = query(r[i])-query(l[i]-1);
    }
    for (int i = 0; i < q; i++){
        cout << ans[i] << "\n";
    }
}
