#include<map>
#include<queue>
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long 

ll n,m,k,p1,p2,ai[1000010],ans=1;
struct T{
	ll l,r,id,ty,aa;
}e[1000010];

bool cmp1(T a,T b){return a.l<b.l||(a.l==b.l&&a.r<b.r);}
bool cmp2(T a,T b){return a.id<b.id;}
ll read(){
	char ch=getchar();ll x=0,f=1;
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void init(){
	n=read(),m=read(),k=read(),p1=read(),p2=read();
	for(int i=1;i<=n;i++)ai[i]=read();
	for(int i=1;i<=m;i++){
		e[i].id=i,e[i].ty=read();
		e[i].l=read(),e[i].r=read();
	}
	sort(e+1,e+1+m,cmp1);
}
void work(){
	if(p2==0){
		for(int i=1;i<=m;i++){
			if(e[i].l==e[i-1].l&&e[i].r==e[i-1].r){e[i].aa=e[i-1].aa;continue;}
			if(e[i].l==e[i-1].l){
				for(int j=e[i-1].r+1;j<=e[i].r;j++)
					ans=(ans*ai[j])%p1;
				e[i].aa=ans;
			}
			else{
				ans=1;
				for(int j=e[i].l;j<=e[i].r;j++)
					ans=(ans*ai[j])%p1;
				e[i].aa=ans;
			}
		}
	}
}
void print(){
	sort(e+1,e+1+m,cmp2);
	for(int i=1;i<=m;i++)
		cout<<e[i].aa<<endl;
}
int main(){
	freopen("chocolatebox.in","r",stdin);
	freopen("chocolatebox.out","w",stdout);
	init();
	work();
	print();
	return 0;
}