求助 70pts

#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
const int N = 1e6;
const int mod = 1145141;
int len,q,a[N],ans,b,f[N],l,r;
int quickly_pow(int a,int p,int mod){
	int tmp=1;
	while(p){
		if(p&1) tmp=tmp*a%mod;
		a=a*a%mod;
		p>>=1;
	}
	return tmp%mod;
}
signed main(){
	cin>>len>>q;
	f[0]=1;
	for(int i=1;i<=len;i++){
		cin>>a[i];
		f[i]=f[i-1]*a[i]%mod;//前缀积 
	}
	while(q--){
		cin>>l>>r;
		int b=quickly_pow(f[l-1],mod-2,mod)*f[r]%mod;
		ans^=b;
	}
	cout<<ans;
	return 0;
}