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;
const int maxn=5e5+5;
int pos[maxn],root[maxn];
struct Psdtree
{
	int tot,cnt[maxn*40],lson[maxn*40],rson[maxn*40];
	void update(int& rt,int prt,int l,int r,int pos,int val)
	{
		rt=++tot,cnt[rt]=cnt[prt]+val;
		lson[rt]=lson[prt],rson[rt]=rson[prt];
		if(l==r) return;
		int mid=(l+r)>>1;
		if(pos<=mid) update(lson[rt],lson[prt],l,mid,pos,val);
		else update(rson[rt],rson[prt],mid+1,r,pos,val);
	}
	int query(int rt,int l,int r,int pos)
	{
		if(pos<=l) return cnt[rt];
		int mid=(l+r)>>1;
		if(pos>mid) return query(rson[rt],mid+1,r,pos);
		else return query(lson[rt],l,mid,pos)+cnt[rson[rt]];
	}
}t;
int main()
{
	int n,q,x,l,r;
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		t.update(root[i],root[i-1],1,n,i,1);
		if(pos[x])
			t.update(root[i],root[i],1,n,pos[x],-1);
		pos[x]=i;
	}
	while(q--)
	{
		scanf("%d%d",&l,&r);
		printf("%d\n",t.query(root[r],1,n,l));
	}
}