#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define int long long

using namespace std;

inline int read(){

    int f=,ans=;char c=getchar();

    while(c<''||c>''){if(c=='-')f=-;c=getchar();}

    while(c>=''&&c<=''){ans=ans*+c-'';c=getchar();}

    return f*ans;

}

const int MAXN=;

struct Node{

    int val[];

    void clear(){memset(val,-/,sizeof(val));}

}tmp[MAXN<<];

int n,m;

Node operator+(Node x1,Node x2){

    Node x3;

    for(int i=;i<=m;i++) x3.val[i]=max(x1.val[i],x2.val[i]);

    return x3;

}

int w[MAXN],c[MAXN];

int tagw[MAXN<<],tagc[MAXN<<];

struct Segment{

    void debug(Node t1){

        for(int i=;i<=m;i++) printf("val(%d):%d\n",i,t1.val[i]);

        return;

    }

    void build(int k,int l,int r){

        if(l==r){

            tmp[k].clear();

            tmp[k].val[w[l]]=c[l];

            return;

        }

        int mid=l+r>>;

        build(k<<,l,mid),build(k<<|,mid+,r);

        tmp[k]=tmp[k<<]+tmp[k<<|];

        return;

    }

    Node Mw(int ps,int d){

        if(!d) return tmp[ps];

        Node t1;t1.clear();

        for(int i=;i<=m;i++){

            if((i+d)%m==) t1.val[m]=tmp[ps].val[i];

            else t1.val[(i+d)%m]=tmp[ps].val[i];

        }

        return t1;

    }

    Node Mc(int ps,int d){

        Node t1=tmp[ps];

        for(int i=;i<=m;i++) t1.val[i]+=d;return t1;

    }

    void pushdownw(int k){

        tmp[k<<]=Mw(k<<,tagw[k]),tmp[k<<|]=Mw(k<<|,tagw[k]);

        tagw[k<<]+=tagw[k],tagw[k<<|]+=tagw[k];

        tagw[k]=;return;

    }

    void pushdownc(int k){

        tmp[k<<]=Mc(k<<,tagc[k]),tmp[k<<|]=Mc(k<<|,tagc[k]);

        tagc[k<<]+=tagc[k],tagc[k<<|]+=tagc[k];

        tagc[k]=;return;

    }

    void modify_w(int k,int l,int r,int x,int y,int d){

        if(x<=l&&r<=y){

            tmp[k]=Mw(k,d);

            tagw[k]+=d;return;

        }

        pushdownw(k);

        pushdownc(k);

        int mid=l+r>>;

        if(x<=mid) modify_w(k<<,l,mid,x,y,d);

        if(mid<y) modify_w(k<<|,mid+,r,x,y,d);

        tmp[k]=tmp[k<<]+tmp[k<<|];return;

    }

    void modify_c(int k,int l,int r,int x,int y,int d){

        if(x<=l&&r<=y){

            tmp[k]=Mc(k,d);

            tagc[k]+=d;return;

        }

        pushdownw(k);

        pushdownc(k);

        int mid=l+r>>;

        if(x<=mid) modify_c(k<<,l,mid,x,y,d);

        if(mid<y) modify_c(k<<|,mid+,r,x,y,d);

        tmp[k]=tmp[k<<]+tmp[k<<|];

        return;

    }

    Node Query(int k,int l,int r,int x,int y){

        if(x<=l&&r<=y) return tmp[k];

        pushdownw(k),pushdownc(k);

        int mid=l+r>>;Node res;res.clear();

        if(x<=mid) res=res+Query(k<<,l,mid,x,y);

        if(mid<y) res=res+Query(k<<|,mid+,r,x,y);

        tmp[k]=tmp[k<<]+tmp[k<<|];

        return res;

    }

}segment;

int q,f[];

signed main(){

//    freopen("1.in","r",stdin);

    n=read(),m=read();

    for(int i=;i<=n;i++) w[i]=read();

    for(int i=;i<=n;i++) c[i]=read();

    q=read();

    segment.build(,,n);

    while(q--){

        int opt=read(),l=read(),r=read();

        if(opt==){

            int d=read();

            segment.modify_w(,,n,l,r,d);

        }

        if(opt==){

            int d=read();

            segment.modify_c(,,n,l,r,d);

        }

        if(opt==){

            memset(f,-/,sizeof(f));

            f[]=;

            Node g=segment.Query(,,n,l,r);

            for(int i=;i<=m;i++)

                for(int j=i;j<=m;j++) f[j]=max(f[j],f[j-i]+g.val[i]);

            int sum=,Xor=;

            for(int i=;i<=m;i++) f[i]=max(f[i],f[i-]);

            for(int i=;i<=m;i++) sum+=f[i],Xor^=f[i];

            printf("%lld %lld\n",sum,Xor);

        }

    }

}