#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,q,a[N],to[N][21],lst[N];
namespace IO {
    const int SIZE=(1<<21)+1;
    char ibuf[SIZE],*iS,*iT,obuf[SIZE],*oS=obuf,*oT=oS+SIZE-1,c,qu[55];int f, qr;
    #define gc() (iS==iT?(iT=(iS=ibuf)+fread(ibuf,1,SIZE,stdin),(iS==iT?EOF:*iS++)):*iS++)
    inline void flush(){fwrite(obuf,1,oS-obuf,stdout),oS=obuf;}
    inline void putc(char x){*oS++=x;if(oS==oT)flush();}
    template <class I>
    inline void read(I &x){
        for(f=1,c=gc();c<'0'||c>'9';c=gc())if(c=='-')f=-1;
        for(x=0;c<='9'&&c>='0';c=gc())x=x*10+(c&15);x*=f;
    }
    template <class I>
    inline void print(I x){
        if(!x)putc('0');if(x<0)putc('-'),x=-x;
        while(x)qu[++qr]=x%10+'0',x/=10;
        while(qr)putc(qu[qr --]);
    }
    struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using IO::read;
using IO::putc;
using IO::print;
int main()
{
	read(n),read(q);
	for(int i=1;i<=n;i++)read(a[i]);
	for(int i=1;i<=n;i++)lst[i]=n+1;
	to[n+1][0]=n+1;
	for(int i=n;i>=1;i--)to[i][0]=min(to[i+1][0],lst[a[i]]),lst[a[i]]=i;
	for(int i=1;i<=19;i++)for(int j=1;j<=n+1;j++)to[j][i]=to[to[j][i-1]][i-1];
	while(q--)
	{
		int x,y;
		read(x),read(y);
		if(x>y)swap(x,y);
		int num=0;
		for(int i=19;i>=0;i--)if(to[x][i]<=y)x=to[x][i],num|=(1<<i);
        num=(y-x)*2-num;
		print(num),putc('\n');
	}
	return 0;
}