#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include // #include // #include // #include // using namespace __gnu_pbds; // #include // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; #define double long double using datas=pair; using ddatas=pair; using tdata=pair; using vec=vector; using mat=vector; using pvec=vector; using pmat=vector; // using llset=tree,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define endl "\n" #define eb emplace_back #define print(v) cout< inline bool chmax(T& a,T b){bool x=a inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} void startupcpp(){ cin.tie(0); ios::sync_with_stdio(false); cout<0){ if(n&1)res=res*a%mod; a=a*a%mod; n>>=1; } return res; } ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);} ll lcm(ll a,ll b){return a/gcd(a,b)*b;} ll countdigits(ll n){ ll ans=0; while(n){n/=10;ans++;} return ans; } ll sumdigits(ll n){ ll ans=0; while(n){ans+=n%10;n/=10;} return ans; } void topcoder(vector& v){ string s; while(1){ cin>>s; int i=s[0]=='{',x=0; while(s[i]>='0'&&s[i]<='9'){ x=x*10+s[i]-'0'; ++i; } v.eb(x); if(s[i]=='}')break; } } void topcoder(string& s){ string t; cin>>t; int i=1; while(t[i]!='"'){ s+=t[i++]; } } int main(){ startupcpp(); // int codeforces;cin>>codeforces;while(codeforces--){ ll i,j,l,r,x,N,Q; cin>>N>>Q; vec v(N),sum(N+1,1); mat dp(N+1,vec(N+1,0)); dp[0][0]=1; rep(i,N)cin>>v[i]; vrsort(v); rep(i,N){ sum[i+1]=sum[i]*v[i]%mod; rep(j,N){ (dp[i+1][j]+=(v[i]-1)*dp[i][j])%=mod; (dp[i+1][j+1]+=dp[i][j])%=mod; } } // output(v); // matoutput(dp); while(Q--){ cin>>l>>r>>x; ll ans=0; For(i,l,r+1){ auto itr=v.rend()-lower_bound(allr(v),i); // print(itr); ans^=dp[itr][x]*moddevide(sum[N],sum[itr])%mod; // print(itr<<" "<