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

int main() {
    int n, q; scanf("%d %d", &n, &q);
    int c[n]; for (int i = 0; i < n; i++) scanf(" %d", &c[i]);
    vector<pair<int, int> > query[n+1];
    for (int i = 0; i < q; i++) {
        int l, r; scanf(" %d %d", &l, &r);
        query[r-1].push_back({l, i});
    }
    int ans[q], pos[n+1], bit[n+1];
    fill(pos, pos+n+1, 0);
    fill(bit, bit+n+1, 0);
    for (int i = 0; i < n; i++) {
        if (pos[c[i]] > 0)
            for (int j = pos[c[i]]; j > 0; j -= j&-j) bit[j]--;
        for (int j = i+1; j > 0; j -= j&-j) bit[j]++;
        pos[c[i]] = i+1;
        for (auto [l, idx] : query[i]) {
            int a = 0;
            for (int j = l; j <= n; j += j&-j) a += bit[j];
            ans[idx] = a;
        }
    }
    for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
}
