#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define int long long

int n,m,a[],Q,tot,Ans,cnt,L[],R[];

struct node {

    int le,ri,a,b;

};

node d[];

inline void PUSH(int wh,int le,int ri,int aa,int bb){

    d[wh].le=le,d[wh].ri=ri,d[wh].a=aa,d[wh].b=bb;

}

inline void update(int wh,int le,int ri){

    int i,j,k,be=;

    L[wh]=cnt+;

    for(i=L[le],j=L[ri];i<=R[le]&&j<=R[ri];){

      if(d[i].ri>=d[j].ri){

          PUSH(++cnt,be,d[j].ri,d[i].a*d[j].a%m,(d[j].a*d[i].b+d[j].b)%m);

          be=d[j].ri+;

          if(d[i].ri==d[j].ri)i++;

          j++;

      }else {

          PUSH(++cnt,be,d[i].ri,d[i].a*d[j].a%m,(d[j].a*d[i].b%m+d[j].b)%m);

          be=d[i].ri+;

          i++;

      }

    }

    R[wh]=cnt;

}

inline void build(int le,int ri,int wh,int pl,int x,int y,int k1,int k2){

    if(le==ri){

      L[wh]=cnt+;

      if(x>)PUSH(++cnt,,x-,,);

      PUSH(++cnt,x,y,k1,k2);

      if(y<n)PUSH(++cnt,y+,n,,);

      R[wh]=cnt;

      return;

    }

    int mid=(le+ri)>>;

    if(mid>=pl)build(le,mid,wh<<,pl,x,y,k1,k2);

      else build(mid+,ri,wh<<|,pl,x,y,k1,k2);

    if(ri==pl)update(wh,wh<<,wh<<|);

}

inline void work(int wh,int pl){

    int le=L[wh],ri=R[wh];

    while(ri-le>){

      int mid=(le+ri)>>;

      if(pl<=d[mid].ri)ri=mid;

        else le=mid+;

    }

    Ans=(Ans*d[le].a%m+d[le].b)%m;

}

inline void q(int le,int ri,int wh,int x,int y,int k){

    if(le>=x&&ri<=y){

      work(wh,k);

      return;

    }

    int mid=(le+ri)>>;

    if(mid>=x)q(le,mid,wh<<,x,y,k);

    if(mid<y)q(mid+,ri,wh<<|,x,y,k);

}

signed main(){

    int i,j,k,t;

    scanf("%lld",&t);

    scanf("%lld%lld",&n,&m);

    for(i=;i<=n;i++)scanf("%lld",&a[i]);

    scanf("%lld",&Q);

    for(i=;i<=Q;i++){

      int le,ri,x,y;

      scanf("%lld%lld%lld",&k,&le,&ri);

      if(t&)le^=Ans,ri^=Ans;

      if(k==){

          scanf("%lld%lld",&x,&y);

          tot++;

          build(,Q,,tot,le,ri,x,y);

      }else {

          scanf("%lld",&x);

          if(t&)x^=Ans;

          Ans=a[x];

          q(,Q,,le,ri,x);

          printf("%lld\n",Ans);

      }

    }

    return ;

}