#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef __uint128_t L;
struct FastMod {
    ull b, m;
    FastMod(ull b) : b(b), m(ull((L(1) << 64) / b)) {}
    ull reduce(ull a) {
        ull q = (ull)((L(m) * a) >> 64);
        ull r = a - q * b; // can be proven that 0 <= r < 2*b
        return r >= b ? r - b : r;
    }
}F1(2);
const int N=1e5;
struct Thing{int k,b;};
struct Oper{
	int l,r;
	Thing x;
};
vector<Oper> v[400005];
int n,m,mod,tp,a[100005],rt[400005],cnt,q;
int tot;
Thing operator +(const Thing& x,const Thing& y){
	return {F1.reduce(1ll*y.k*x.k),F1.reduce(1ll*y.k*x.b+y.b)};
}
bool operator <(const Oper &x,const Oper &y){
	return x.r<y.r;
}
void Merge(vector<Oper> x,vector<Oper> y,vector<Oper> &z){
	int i=0,j=0;
	while(i<x.size()||j<y.size()){
		auto w=x[i].x+y[j].x;
		if(y[j].r<x[i].r){
			z.push_back({x[i].l,y[j].r,w});
			j++,x[i].l=y[j].l;
		}
		else if(x[i].r<y[j].r){
			z.push_back({x[i].l,x[i].r,w});
			i++,y[j].l=x[i].l;
		}
		else {
			z.push_back({x[i].l,x[i].r,w});
			i++,j++;
		}
	}
}
void Ins(int p,int l,int r,int pos,Oper x){
	if(l==r){
		if(x.l>1)v[p].push_back({1,x.l-1,{1,0}});
		v[p].push_back(x);
		if(x.r<n)v[p].push_back({x.r+1,n,{1,0}});
		return ;
	}
	int mid=(l+r)/2;
	if(pos<=mid)Ins(p*2,l,mid,pos,x);
	else Ins(p*2+1,mid+1,r,pos,x);
	if(pos==r)Merge(v[p*2],v[p*2+1],v[p]);
}
int Get(int p,int l,int r,int x,int y,int z,int w){
	if(x<=l&&r<=y){
		auto i=*lower_bound(v[p].begin(),v[p].end(),(Oper){z,z,{0,0}});
		return F1.reduce(1ll*i.x.k*w+i.x.b);
	}
	int mid=(l+r)/2;
	if(x<=mid)w=Get(p*2,l,mid,x,y,z,w);
	if(mid<y)w=Get(p*2+1,mid+1,r,x,y,z,w);
	return w;
}
#include <sys/mman.h>
struct _io {
    char* s;
    _io() : s((char*)mmap(0, 1 << 25, PROT_READ, MAP_PRIVATE, fileno(stdin), 0)) {}
    operator int() {
        int x = 0;
        while((*s) < '0'|| (*s) > '9')++s;
        while ((*s) >= '0'&& (*s) <= '9') x = x * 10 + ((*s++) & 15);
        return x;
    }
} it;
int p2=0;
char wb[1000005];
void pc(char x){
	if(p2>=1000000)fwrite(wb,1,1000000,stdout),p2=0;
	wb[p2++]=x;
}
void wrt(int x){
	int c[12]={0};
	if(!x)return pc('0'),void();
	while(x)c[++c[0]]=x%10,x/=10;
	while(c[0])pc(c[c[0]--]+'0');
}
int main(){
	tp=it,n=it,mod=it,F1=FastMod(mod);
	for(int i=1;i<=n;i++)a[i]=it;
	q=it;
	for(int i=1,op,la=0,x,y,z,w;i<=q;i++){
		op=it;
		if(op==1){
			x=it,y=it,z=it,w=it;
			if(tp&1)x^=la,y^=la;
			++cnt,Ins(1,1,N,cnt,{x,y,{z,w}});
		}
		else {
			x=it,y=it,z=it;
			if(tp&1)x^=la,y^=la,z^=la;
			wrt(la=Get(1,1,N,x,y,z,a[z])),pc('\n');
		}
	}
	fwrite(wb,1,p2,stdout);
}