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 <algorithm>
#include <iostream>
#include <map>
using namespace std;
struct data
{
	int z, y, xh;
	bool operator < ( const data& x) const
	{
		if (y < x.y)
			return 1;
		else
			return 0;
	}
} s[501001];
int c[500011];
int a[500101];
int h[500101];

map<int, int> Map;
int n;
int lowbit(int i)
{
	return i & (-i);
}
void add(int i, int x)
{
	while (i <= n)
	{
		c[i] += x;
		i += lowbit(i);
	}
}
int sum(int x)
{
	int ans = 0;
	while (x > 0)
	{
		ans += c[x];
		x -= lowbit(x);
	}
	return ans;
}
int main()
{
	ios::sync_with_stdio(0);
	int m;
	cin >> n >> m;
	for (int i = 1; i <= n; ++i)
		cin >> a[i];

	for (int i = 1; i <= m; ++i)
	{
		cin >> s[i].z >> s[i].y;
		s[i].xh = i;
	}

	sort(s + 1, s + 1 + m);
	int last = 0;
	for (int i = 1; i <= m; ++i)
	{
		++last;
		for (int j = last; j <= s[i].y; ++j)
		{
			if (Map[a[j]])
			{
				add(Map[a[j]], -1);
				Map[a[j]] = j;
				add(Map[a[j]], 1);
			}
			else
			{
				Map[a[j]] = j;
				add(j, 1);
			}
		}
		h[s[i].xh] = sum(s[i].y) - sum(s[i].z - 1);
		last = s[i].y;
	}
	for (int i = 1; i <= m; ++i)
		cout << h[i] << endl;
}