//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n,q;
int a[300300];
int nxt[300300];
int pos[300300];
const int B=550;
int tr[B+5][300300],v[B+5][300300];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	memset(pos,-1,sizeof(pos));
	for(int i=n;i>=1;i--)
	{
		nxt[i]=pos[a[i]];
		pos[a[i]]=i;
	}
	for(int i=1;i<=n/B;i++)
	{
		int bound=i*B-1;
		for(int j=bound;j>=1;j--)
			if(nxt[j]==-1||nxt[j]/B>i)
			{
				tr[i][j]=tr[i][j+1];
				v[i][j]=v[i][j+1]+1;
			}
			else if(nxt[j]/B==i)
			{
				tr[i][j]=j;
				v[i][j]=0;
			}
			else
			{
				tr[i][j]=tr[i][nxt[j]+1];
				v[i][j]=v[i][nxt[j]+1];
			}
	}
	int lst=0;
	while(q--)
	{
		int l,r;
		cin>>l>>r;
		l^=lst;
		r^=lst;
		int ans=0;
		while(l/B!=r/B)
		{
			ans+=v[r/B][l];
			l=tr[r/B][l];
			if(l/B==r/B) break;
			if(nxt[l]<=r) l=nxt[l]+1;
			else ans++,l++;
		}
		while(l<=r)
		{
			if(nxt[l]<=r&&nxt[l]!=-1) l=nxt[l]+1;
			else ans++,l++;
		}
		cout<<(lst=ans)<<'\n';
	}
	return 0;
}