#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
long long m,n,k,p1,p2;
long long a[1000010];
int main()
{
	freopen("chocolatebox.in","r",stdin);
	freopen("chocolatebox.out","w",stdout);
	cin>>n>>m>>k>>p1>>p2;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=m;i++)
	{
		int p,x1,x2;
		cin>>p>>x1>>x2;
		if(p==2)
		{
			unsigned long long zz=1,zz1=1;
			for(int j=x1;j<=x2;j++)
				zz*=a[j];
			for(int i=1;i<=zz;i++)
			{
				zz1*=k;
				zz1%=p2;
			}
			cout<<zz1<<endl;
		}
		else
		{
			long long zz=1;
			for(int j=x1;j<=x2;j++)
			{
				zz*=a[j];
				zz%=p1;
			}
			cout<<zz<<endl;
		}
	}
	return 0;
}