#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
const ll N = 300005;
struct Tree{
    int cnt, rt[N];
    struct node{
        int lc,rc,v;
        void init(){ lc = rc = v = 0; }
    }t[64*N];
    void build(){ t[cnt=0].init(); }
    ll nww(){ t[++cnt].init(); return cnt; }
    void add(int &s,int l,int r,int v,int pre,int L,int R){
        if (!s) s = nww();
        if (L>=l && R<=r){ t[s] = t[pre]; t[s].v += v; return ; }
        int mid = (L+R)>>1;
        if (l<=mid) add(t[s].lc,l,r,v,t[pre].lc,L,mid);
        if (r>mid) add(t[s].rc,l,r,v,t[pre].rc,mid+1,R);
    }
    int qry(int s,int x,int L,int R){
        // printf("qry %lld %lld , %lld ~ %lld\n",s,x,L,R);
        if (!s) return 0;
        int ans = t[s].v, mid = (L+R)>>1;
        // printf("t[s].v = %lld\n",t[s].v);
        if (x<=mid) ans += qry(t[s].lc,x,L,mid);
        else ans += qry(t[s].rc,x,mid+1,R);
        return ans;
    }
}tr;
ll n,q;
ll a[N];
ll nx[N], pos[N];
int main(){
	// freopen("a.in","r",stdin);
//	freopen(".out","w",stdout);
    ll i,j;
    read(n), read(q);
    fr(i,1,n) read(a[i]);
    rfr(i,n,1) nx[i] = pos[a[i]], pos[a[i]] = i;
    // fr(i,1,n) printf("nx[%lld] = %lld\n",i,nx[i]);
    tr.build();
    rfr(i,n,1){
        if (!nx[i]) tr.add(tr.rt[i],i,n,1,tr.rt[i+1],1,n);
        else{
            tr.add(tr.rt[i],i,nx[i]-1,1,tr.rt[i+1],1,n);
            tr.add(tr.rt[i],nx[i],n,0,tr.rt[nx[i]+1],1,n);
        }
    }
    int ls = 0;
    while (q--){
        int l,r; read(l), read(r);
        l ^= ls, r ^= ls;
        ls = tr.qry(tr.rt[l],r,1,n);
        write(ls), putchar('\n');
    }
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2