#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
using namespace std;
#define MAXN 1000100
typedef long long ll;
ll n,m,k,p1,p2,a[MAXN],tr[MAXN*4];
inline ll read()
{
	ll x=0,f=1;  char ch=getchar();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
void build(ll p,ll l,ll r)
{
	if(l>r)  return;
	if(l==r)  {tr[p]=a[l]%p1;  return;}
	ll mid=(l+r)/2;
	build(p*2,l,mid);
	build(p*2+1,mid+1,r);
	tr[p]=tr[p*2]*tr[p*2+1]%p1;
}
ll ask(ll p,ll l,ll r,ll x,ll y)
{
	if(x>r||y<l)  return 0;
	if(x<=l&&y>=r)  return tr[p];
	ll mid=(l+r)/2;
	ll templ=ask(p*2,l,mid,x,y);
	ll tempr=ask(p*2+1,mid+1,r,x,y);
	return templ*tempr%p1;
}
int main()
{
	freopen("chocolatebox.in","r",stdin);
	freopen("chocolatebox.out","w",stdout);
	n=read();  m=read();  k=read();  p1=read();  p2=read();
	for(ll i=1;i<=n;i++)  a[i]=read();
	build(1,1,n);
	for(ll i=1;i<=m;i++)
	{
		ll flag=read(),x=read(),y=read();
		printf("%lld\n",ask(1,1,n,x,y));
	}
	return 0;
}