#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define MOD(x) ((x)>=mod?(x)-mod:(x))
#define ll long long
using namespace std;
const int maxn=500010, inf=1e9;
struct poi{int sum, cnt;}tree[maxn<<2];
int n, m, c, mod, cnt, ty, x, y;
int a[maxn], p[maxn], mi1[30][maxn], mi2[30][maxn], cmi[30][maxn];
inline void read(int &k)
{int f=1; k=0; char c=getchar();while(c<'0' || c>'9') c=='-'&&(f=-1), c=getchar();while(c<='9' && c>='0') k=k*10+c-'0', c=getchar();k*=f;
}
inline int min(int a, int b){return a<b?a:b;}
inline void pushup(int x)
{tree[x].sum=tree[x<<1].sum+tree[x<<1|1].sum; tree[x].sum=MOD(tree[x].sum);tree[x].cnt=min(tree[x<<1].cnt, tree[x<<1|1].cnt);
}
void build(int x, int l, int r)
{if(l==r){read(a[l]); tree[x].sum=a[l]; return;}int mid=(l+r)>>1;build(x<<1, l, mid); build(x<<1|1, mid+1, r);pushup(x);
}
inline int phi(int n)
{int ans=n;for(int i=2;i*i<=n;i++)if(!(n%i)){ans=ans/i*(i-1);while(!(n%i)) n/=i;}if(n>1) ans=ans/n*(n-1);return ans;
}
inline int power(int n, int x){return 1ll*mi2[x][n/10000]*mi1[x][n%10000]%p[x];}
inline int getmi(int x, int y, int mod)
{if(c==1)return 1; if(!y) return x%p[mod];int nxt=min(y, x+5); ll now=(nxt==y?x:c);if(now>=p[mod+1]) return power(getmi(x, y-1, mod+1)+p[mod+1], mod);for(int i=nxt-1;i>=1;i--){ll t=now, now=1; for(int j=1;j<=t;j++){now*=c; if(now>=p[mod+1]) return power(getmi(x, y-1, mod+1)+p[mod+1], mod);}}return power(getmi(x, y-1, mod+1), mod);
}
void prepare()
{p[0]=mod; while(p[cnt]-1) p[++cnt]=phi(p[cnt-1]); p[++cnt]=1;for(int i=0;i<=cnt;i++){mi1[i][0]=1; for(int j=1;j<=10000;j++) mi1[i][j]=1ll*mi1[i][j-1]*c%p[i];mi2[i][0]=1; for(int j=1;j<=10000;j++) mi2[i][j]=1ll*mi2[i][j-1]*mi1[i][10000]%p[i];}for(int i=1;i<=n;i++) for(int j=1;j<=cnt;j++) if(a[i]) cmi[j][i]=getmi(a[i], j, 0);else cmi[j][i]=getmi(1, j-1, 0);
}
void update(int x, int l, int r, int cl, int cr)
{if(tree[x].cnt>=cnt) return;if(l==r){tree[x].cnt++, tree[x].sum=cmi[tree[x].cnt][l]; return;}int mid=(l+r)>>1;if(cl<=mid) update(x<<1, l, mid, cl, cr);if(cr>mid) update(x<<1|1, mid+1, r, cl, cr);pushup(x);
}
inline int query(int x, int l, int r, int cl, int cr)
{if(cl<=l && r<=cr) return tree[x].sum;int mid=(l+r)>>1, ret=0;if(cl<=mid) ret=query(x<<1, l, mid, cl, cr);if(cr>mid) ret+=query(x<<1|1, mid+1, r, cl, cr), ret=MOD(ret);return ret;
}
int main()
{read(n); read(m); read(mod); read(c); build(1, 1, n); prepare();for(int i=1;i<=m;i++){read(ty); read(x); read(y);if(!ty) update(1, 1, n, x, y);else printf("%d\n", query(1, 1, n, x, y));}
}