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;

const int BLOCK = 707;

int c[500005], ans[500005], res, cnt[500005];

struct dat {
    int l, r, id;

    bool operator < (const dat& T) const {
        if (l / BLOCK != T.l / BLOCK) return l / BLOCK < T.l / BLOCK;
        return r < T.r;
    }
}a[500005];

void remove(int id) {
    cnt[c[id]]--;
    if (cnt[c[id]] == 0) res--;
}

void add(int id) {
    cnt[c[id]]++;
    if (cnt[c[id]] == 1) res++;
}

int main() {
    int n, q;
    scanf("%d%d", &n, &q);

    for (int i = 0; i < n; i++) scanf("%d", &c[i]);

    for (int i = 0; i < q; i++) {
        scanf("%d%d", &a[i].l, &a[i].r);
        a[i].l--;
        a[i].r--;
        a[i].id = i;
    }

    sort(a, a + q);

    int l = 0;
    int r = -1;
    res = 0;

    for (int i = 0; i < q; i++) {
        while (l < a[i].l) remove(l++);
        while (l > a[i].l) add(--l);
        while (r < a[i].r) add(++r);
        while (r > a[i].r) remove(r--);

        ans[a[i].id] = res;
    }

    for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
}
