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 <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#define MAXN 500001

int n, m, a[MAXN], ans[MAXN];
int sqrn, num[MAXN], ba[MAXN];
struct query {
	int x, y, id;
	friend bool operator < (query q1, query q2) {
		if (num[q1.x] == num[q2.x]) return num[q1.y] < num[q2.y];
		return num[q1.x] < num[q2.x];
	}
}q[MAXN];

int main() {
	scanf("%d %d", &n, &m), sqrn = sqrt(n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
		num[i] = (i - 1) / sqrn + 1;
	}
	for (int i = 1; i <= m; ++i) {
		scanf("%d %d", &q[i].x, &q[i].y);
		q[i].id = i;
	}
	std::sort(q + 1, q + m +1);
	int l = 1, r = 1, now = 1;
	ba[a[l]] = 1;
	for (int i = 1; i <= m; ++i) {
		while(l > q[i].x) {
			++ba[a[--l]];
			if (ba[a[l]] == 1) ++now;
		}
		while(r < q[i].y) {
			++ba[a[++r]];
			if (ba[a[r]] == 1) ++now;
		}
		while(l < q[i].x) {
			if (ba[a[l]] == 1) --now;
			--ba[a[l++]];
		}
		while(r > q[i].y) {
			if (ba[a[r]] == 1) --now;
			--ba[a[r--]];
		}
		ans[q[i].id] = now;
	}
	for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
	return 0;
}