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>
#include <stdio.h>
using namespace std;

int val;
bool comp(vector<int>&v1,  vector<int>&v2)
{
	int l1=v1[0]/val;
	int l2=v2[0]/val;
	if(l1!=l2) return (l1 < l2);
	return v1[1]<v2[1];
}

int arr[500001];
int main()
{
	int n,q;
	scanf("%d",&n);	scanf("%d",&q);
	for(int i=1;i<=n;i++) scanf("%d",&arr[i]);

	vector< vector<int> > query(q, vector<int>(3));
	vector<int>sol(q);

	for(int i=0;i<q;i++)
	{
		scanf("%d %d",&query[i][0],&query[i][1]);
		query[i][2]=i;
	}
	val=sqrt(n);
	sort(query.begin(),query.end(),comp);

	int l=1,r=0,diff=0;
	vector<int>fr(1000001,0);
	for(const auto& x: query)
	{
		while(r>x[1])
		{
			fr[arr[r]]--;

			if(fr[arr[r]]==0) diff--;

			--r;
		}
		while(l<x[0])
		{
			fr[arr[l]]--;

			if(fr[arr[l]]==0) diff--;

			l++;
		}
		while(r<x[1])
		{
			++r;
			fr[arr[r]]++;

			if(fr[arr[r]]==1) diff++;
		}
		while(l>x[0])
		{
			l--;

			fr[arr[l]]++;

			if(fr[arr[l]]==1) diff++;
		}
		sol[x[2]]=diff;
	}
	for(int x:sol) printf("%d\n",x);
}