#include<bits/stdc++.h>
using namespace std;
const int N=500005,M=20;
typedef long long LL;
typedef unsigned int UI;
typedef unsigned long long ULL;
int n,T,a[N],pos;
LL lans;
struct SegmentTree
{
	int l,r,mx,mi;
	LL sum;
	#define l(p) tr[p].l
	#define r(p) tr[p].r
	#define mx(p) tr[p].mx
	#define mi(p) tr[p].mi
	#define sum(p) tr[p].sum
}tr[N<<2];
inline int ls(int x){return x<<1;}
inline int rs(int x){return x<<1|1;}
inline LL query_sum(int p)
{
	if(mx(p)<=pos) return pos*(r(p)-l(p)+1);
	else if(mi(p)>=pos) return sum(p);
	int mid=l(p)+((r(p)-l(p))>>1);
	if(pos<=mx(ls(p))) return query_sum(ls(p))+(sum(p)-sum(ls(p)));
	else return 1LL*pos*(mid-l(p)+1)+query_sum(rs(p));
}
inline void pushup(int p,int mid,int r)
{
	mx(p)=max(mx(ls(p)),mx(rs(p)));
	mi(p)=mi(ls(p));
	pos=mx(ls(p));
	sum(p)=sum(ls(p))+query_sum(rs(p));
}
inline void build(int p,int l,int r)
{
	l(p)=l,r(p)=r;
	if(l==r)
	{
		mx(p)=mi(p)=sum(p)=a[l];
		return;
	}
	int mid=l+((r-l)>>1);
	build(ls(p),l,mid);
	build(rs(p),mid+1,r);
	pushup(p,mid,r);
}
inline LL query(int p,int l,int r)
{
	if(l<=l(p)&&r(p)<=r)
	{
		LL tmp=query_sum(p);
		pos=max(pos,mx(p));
		return tmp;
	}
	int mid=l(p)+((r(p)-l(p))>>1);
	LL ans=0;
	if(l<=mid) ans+=query(ls(p),l,r);
	if(mid<r) ans+=query(rs(p),l,r);
	return ans;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin>>n>>T;
	for(int i=1;i<=n;i++) cin>>a[i];
	build(1,1,n);
	while(T--)
	{
		int u,v;
		cin>>u>>v;
		int l=1+(u^lans)%n;
		int q=1+(v^(lans+1))%(n-l+1);
		pos=0;
		LL ans=query(1,l,l+q-1);
		cout<<ans<<'\n';
		lans=ans;
	}
	return 0;
}

回复请 at 我。