1 #include<bits/stdc++.h>
  2 #define FOR(i,a,b) for (register int i=(a);i<=(b);i++)
  3 #define pb push_back
  4 using namespace std;
  5 typedef long long ll;
  6 const int N=6e5+5;
  7 const int T=600000;
  8 int type,n,mod,q,a[N],time_now=0,f[N<<2];
  9 int opt,tmp1,tmp2,tmp3,tmp4,ans;
 10 struct data
 11 {
 12     int a,b,l,r;
 13 }tmp_node;
 14 inline data merge(data x,data y)
 15 {
 16     data ret;
 17     ret.a=1LL*x.a*y.a%mod;
 18     ret.b=(1LL*x.b*y.a%mod+y.b)%mod;
 19     ret.l=max(x.l,y.l);
 20     ret.r=min(x.r,y.r);
 21     return ret;
 22 }
 23 vector <data> tr[N<<2];
 24 inline int read()
 25 {
 26     int x=0,f=1;
 27     char c=getchar();
 28     while (c<‘0‘||c>‘9‘) {if (c==‘-‘) f=-1;c=getchar();}
 29     while (c>=‘0‘&&c<=‘9‘) {x=(x<<1)+(x<<3)+c-‘0‘;c=getchar();}
 30     return f*x;
 31 }
 32 inline void write(int x)
 33 {
 34     if (x<0) putchar(‘-‘),x=-x;
 35     if (x>9) write(x/10);
 36     putchar(x%10+‘0‘);
 37     return;
 38 }
 39 #define mid ((l+r)>>1)
 40 #define lson p<<1,l,mid
 41 #define rson p<<1|1,mid+1,r
 42 inline void UP(int p)
 43 {
 44     tr[p].clear();
 45     int ls=p<<1,rs=p<<1|1,siz1=tr[ls].size(),siz2=tr[rs].size();
 46     data tmp;
 47     for (register int i=0,j=0,now=1;i<siz1&&j<siz2;)
 48     {
 49         tmp=merge(tr[ls][i],tr[rs][j]);
 50         tr[p].pb(tmp);
 51         if (tr[ls][i].r==tmp.r) i++;
 52         if (tr[rs][j].r==tmp.r) j++;
 53     }
 54     f[p]=1;
 55     return;
 56 }
 57 inline void MD(int p,int l,int r,int k,data v)
 58 {
 59     if (l==r)
 60     {
 61         if (v.l>1) tr[p].pb((data){1,0,1,v.l-1});
 62         tr[p].pb(v);
 63         if (v.r<n) tr[p].pb((data){1,0,v.r+1,n});
 64         f[p]=1;
 65         return;
 66     }
 67     if (k<=mid) MD(lson,k,v);
 68     else MD(rson,k,v);
 69     if (f[p<<1]&&f[p<<1|1]&&!f[p]) UP(p);
 70     return;
 71 }
 72 inline data QR(int p,int l,int r,int L,int R,int k)
 73 {
 74     if (L<=l&&r<=R)
 75     {
 76         int LL=0,RR=tr[p].size()-1,MID;
 77         while (LL<=RR)
 78         {
 79             MID=(LL+RR)>>1;
 80             if (tr[p][MID].l<=k&&k<=tr[p][MID].r) return tr[p][MID];
 81             if (k<tr[p][MID].l) RR=MID-1;
 82             else if (tr[p][MID].r<k) LL=MID+1;
 83         }
 84     }
 85     data ret;
 86     ret=(data){1,0,1,T};
 87     if (L<=mid) ret=merge(ret,QR(lson,L,R,k));
 88     if (R>mid) ret=merge(ret,QR(rson,L,R,k));
 89     return ret;
 90 }
 91 #undef mid
 92 #undef lson
 93 #undef rson
 94  
 95 int main()
 96 {
 97     type=read();
 98     n=read(),mod=read();
 99     FOR(i,1,n) a[i]=read();
100     q=read();
101     while (q--)
102     {
103         opt=read(),tmp1=read(),tmp2=read(),tmp3=read();
104         if (opt==1)
105         {
106             tmp4=read();
107             if (type&1) tmp1^=ans,tmp2^=ans;
108             tmp_node=(data){tmp3,tmp4,tmp1,tmp2};
109             ++time_now;
110             MD(1,1,T,time_now,tmp_node);
111         }
112         else
113         {
114             if (type&1) tmp1^=ans,tmp2^=ans,tmp3^=ans;
115             tmp_node=QR(1,1,T,tmp1,tmp2,tmp3);
116             ans=(1LL*tmp_node.a*a[tmp3]%mod+tmp_node.b)%mod;
117             write(ans),putchar(‘\n‘);
118         }
119     }
120     return 0;
12