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>
 
using namespace std;

struct 
{ 
	int i, p; 
} E[500005];
int A[500005], D[500005], P[500005]{}, F[500005]{}, T[500005]{}, N, Q;
int main() 
{
	cin.tie(0);
	ios::sync_with_stdio(0);
	
	cin >> N >> Q;
	
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
	}
	int K = 0;
	for(int i=0;i<Q;i++)
	{
		int l, r;
		cin>>l>>r; --l, --r;
		E[i+1]={l, F[r]}, F[r]=i+1;
	}
	for(int r=0;r<N;r++)
	{
		int x=A[r]-1;
		if(P[x])
		{ 
			for(int j=P[x]; j<=N; j+=j&-j)
			{
				T[j]--;
			}
		}
		else 
		{
			K++;
		}
		for(int j=P[x]=r+1; j<=N; j+=j&-j) 
		{
			T[j]++;
		}
		for(int k=F[r]; k; k=E[k].p) 
		{
			D[k]=K;
			for(int j=E[k].i; j; j-=j&-j)
			{ 
				D[k]-=T[j];
			}
		}
	}
	for(int i=0;i<Q;i++)
	{
		cout<<D[i+1]<<'\n';
	}

	return 0;
}
