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>

const int maxn = 1e6 + 3;

int n, q, c[maxn], l[maxn], r[maxn], o[maxn], pc[maxn], ans[maxn];
int bits[maxn];

int query(int k) {
    int ans = 0;
    for(int i = k + 1; i >= 1; i -= i & -i)
        ans += bits[i];
    return ans;
}

void modify(int k, int v) {
    for(int i = k + 1; i < maxn; i += i & -i)
        bits[i] += v;
}

int main() {
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; ++i)
        scanf("%d", c + i);
    for(int i = 0; i < q; ++i) {
        scanf("%d%d", l + i, r + i);
        o[i] = i;
    }
    std::sort(o, o + q, [](int i, int j) {
        return r[i] < r[j];
    });
    for(int cr = 1, i = 0; cr <= n; ++cr) {
        if(pc[c[cr]])
            modify(pc[c[cr]], -1);
        modify(cr, 1);
        pc[c[cr]] = cr;
        while(i < q && r[o[i]] == cr) {
            ans[o[i]] = query(cr) - query(l[o[i]] - 1);
            i += 1;
        }
    }
    for(int i = 0; i < q; ++i)
        printf("%d\n", ans[i]);
    return 0;
}