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
n, q = map(int, input().split())
bit = [0] * (n + 1)


def fenwick_add(x, w):
    while x <= n:
        bit[x] += w
        x += x & -x


def fenwick_sum(x):
    sm = 0
    while x > 0:
        sm += bit[x]
        x -= x & -x
    return sm


c = list(map(int, input().split()))
p = [-1] * (n + 1)
ps = [[] for _ in range(n + 1)]
for i, v in enumerate(c):
    l = p[v]
    if l != -1:
        ps[l].append(i)
    p[v] = i

qs = [[] for _ in range(n + 1)]
for i in range(q):
    l, r = map(int, input().split())
    qs[l - 1].append([r - 1, i])

ans = [0] * q
for i in range(n - 1, -1, -1):
    for v in ps[i]:
        fenwick_add(v, 1)
    for v in qs[i]:
        r, qi = v
        ans[qi] = r - i + 1 - fenwick_sum(r)
print(*ans, sep="\n")
