#include<cstdio>#include<algorithm>#include<cmath>using namespace std;#define N 200001#define BN 451int n,m,a[N],b[N],sumv[BN],l[N],num[N],num2[N],Lim,siz[BN],anss[N];struct Ask{int l,r,p;void Read(){scanf("%d%d",&l,&r);}}Q[N];bool operator < (const Ask &a,const Ask &b){return num2[a.l]!=num2[b.l] ? num2[a.l]<num2[b.l] : a.r<b.r;}void val_mb(){	int sum=1,sz=sqrt(Lim);	if(!sz) sz=1;	for(;sum*sz<Lim;++sum)	  {	  	l[sum]=(sum-1)*sz;	  	int r=l[sum]+sz-1;	  	for(int i=l[sum];i<=r;++i) num[i]=sum;	  	siz[sum]=sz;	  }	l[sum]=(sum-1)*sz;	for(int i=l[sum];i<=Lim;++i) num[i]=sum;	siz[sum]=Lim-l[sum]+1;}void mo_mb(){	int sum=1,sz=sqrt(n);	if(!sz) sz=1;	for(;sum*sz<n;++sum)	  {	  	int i=(sum-1)*sz+1,r=i+sz;	  	for(;i<=r;++i) num2[i]=sum;	  }	int i=(sum-1)*sz+1;	for(;i<=n;++i) num2[i]=sum;}void Insert(const int &x){if(!b[x]) ++sumv[num[x]]; ++b[x];}void Delete(const int &x){--b[x]; if(!b[x]) --sumv[num[x]];}int Query(){for(int i=1;;++i) if(sumv[i]!=siz[i]) for(int j=l[i];;++j) if(!b[j]) return j;}int main(){	scanf("%d%d",&n,&m);	for(int i=1;i<=n;++i) scanf("%d",&a[i]);	Lim=*max_element(a+1,a+n+1);	val_mb(); mo_mb();	for(int i=1;i<=m;++i) Q[i].Read(),Q[i].p=i;	sort(Q+1,Q+m+1);    for(int i=Q[1].l;i<=Q[1].r;++i) Insert(a[i]);    anss[Q[1].p]=Query();    for(int i=2;i<=m;++i)      {        if(Q[i].l<Q[i-1].l) for(int j=Q[i-1].l-1;j>=Q[i].l;--j) Insert(a[j]);        else for(int j=Q[i-1].l;j<Q[i].l;++j) Delete(a[j]);        if(Q[i].r<Q[i-1].r) for(int j=Q[i-1].r;j>Q[i].r;--j) Delete(a[j]);        else for(int j=Q[i-1].r+1;j<=Q[i].r;++j) Insert(a[j]);        anss[Q[i].p]=Query();      }    for(int i=1;i<=m;++i) printf("%d\n",anss[i]);	return 0;}