#include<bits/stdc++.h>
using namespace std;
struct time_helper{
#ifdef LOCAL
clock_t time_last;time_helper(){time_last=clock();}void test(){auto time_now=clock();std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;time_last=time_now;}~time_helper(){test();}
#else
void test(){}
#endif
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

void init();void solve(int tc);
main()
{
    init();int t=1;
    // cin>>t;
    for(int tc=1;tc<=t;tc++)solve(tc);
}
void init()
{
}
constexpr int vlim=100000,inf=1e9;
int a[500001],n;
struct node
{
    int mi,mx,cnt,tag;
    long long sum;
    // node()=delete;
    node operator+(const node&b)
    {
        return {min(mi,b.mi),max(mx,b.mx),cnt+b.cnt,0,sum+b.sum};
    }
}tr[31][vlim+2];
void bbuild(int u,int l,int r)
{
    for(int x=0;x<=30;x++)
    tr[x][u]=node{inf,0,0,0,0};
	for(int x=l;x<=r;x++)
	tr[__lg(a[x])][u]=tr[__lg(a[x])][u]+node{a[x],a[x],1,0,a[x]};
}
void build(int u,int l,int r)
{
	if(u*2>vlim)
	{
		bbuild(u,l,r);
		return;
	}
    if(l==r)
    {
        for(int x=0;x<=30;x++)
        tr[x][u]=node{inf,0,0,0,0};
        tr[__lg(a[l])][u]={a[l],a[l],1,0,a[l]};
        return;
    }
    int mi=(l+r)/2;
    build(u*2,l,mi);
    build(u*2+1,mi+1,r);
    for(int x=0;x<=30;x++)
    tr[x][u]=tr[x][u*2]+tr[x][u*2+1];
}
void addtag(int u,int lv,int val)
{
    tr[lv][u].mx-=val;
    tr[lv][u].mi-=val;
    tr[lv][u].tag+=val;
    tr[lv][u].sum-=1ll*tr[lv][u].cnt*val;
}
void pushdown(int u,int lv)
{
    if(tr[lv][u].tag)
    {
        addtag(u*2,lv,tr[lv][u].tag);
        addtag(u*2+1,lv,tr[lv][u].tag);
        tr[lv][u].tag=0;
    }
}
void bapplytag(int u,int l,int r)
{
	for(int x=l;x<=r;x++)
	a[x]-=tr[__lg(a[x])][u].tag;
    for(int x=0;x<=30;x++)
	tr[x][u].tag=0;
}
void bapplytag(int u,int l,int r,int lv)
{
	if(tr[lv][u].tag)bapplytag(u,l,r);
}
void bupdate0(int u,int l,int r,int pos,int val,int lv)
{
	bapplytag(u,l,r,lv);
	a[pos]=val;
	tr[lv][u]=node{inf,0,0,0,0};
	for(int x=l;x<=r;x++)
    {
        if(x==pos)a[x]=val;
	    if(__lg(a[x])==lv)tr[lv][u]=tr[lv][u]+node{a[x],a[x],1,0,a[x]};
    }
}
void update0(int u,int l,int r,int pos,int val,int lv)
{
	if(u*2>vlim)
	{
		bupdate0(u,l,r,pos,val,lv);
		return;
	}
	if(l==r)
	{
		tr[lv][u]={val,val,1,0,val};
		return;
	}
	pushdown(u,lv);
	int mi=(l+r)/2;
	if(pos<=mi)update0(u*2,l,mi,pos,val,lv);
	else update0(u*2+1,mi+1,r,pos,val,lv);
	tr[lv][u]=tr[lv][u*2]+tr[lv][u*2+1];
}
void bmodify(int u,int l,int r,int L,int R,int val,int lv)
{
    bapplytag(u,l,r,lv);
    for(int x=l;x<=r;x++)
    if(L<=x&&x<=R&&__lg(a[x])==lv&&a[x]>val)
    {
        if(a[x]-val>=(1<<lv))a[x]-=val;
        else
        {
            int k=a[x]-val;
            int nlv=__lg(k);
            update0(1,1,n,x,k,nlv);
        }
    }
    tr[lv][u]=node{inf,0,0,0,0};
    for(int x=l;x<=r;x++)
    if(__lg(a[x])==lv)tr[lv][u]=tr[lv][u]+node{a[x],a[x],1,0,a[x]};
}
void modify(int u,int l,int r,int L,int R,int val,int lv)
{
    // cerr<<u<<','<<l<<','<<r<<','<<L<<','<<R<<','<<lv<<endl;
    if(tr[lv][u].mx<=val)return;
	if(u*2>vlim)
	{
		bmodify(u,l,r,L,R,val,lv);
		return;
	}
    if(L<=l&&r<=R&&tr[lv][u].mi-val>=(1<<lv))
    {
		// cerr<<"addtag"<<u<<','<<lv<<','<<val<<endl;
		addtag(u,lv,val);
        return;
    }
    if(l==r)
    {
		int k=tr[lv][u].mx-val;
        int nlv=__lg(k);
		// cerr<<"specialadd"<<u<<','<<lv<<','<<nlv<<','<<val<<','<<k<<endl;
        tr[lv][u]=node{inf,0,0,0,0};
        update0(1,1,n,l,k,nlv);
        return;
    }
    pushdown(u,lv);
    int mi=(l+r)/2;
    if(L<=mi)modify(u*2,l,mi,L,R,val,lv);
    if(mi<R)modify(u*2+1,mi+1,r,L,R,val,lv);
    tr[lv][u]=tr[lv][u*2]+tr[lv][u*2+1];
}
node bquery(int u,int l,int r,int L,int R)
{
    bapplytag(u,l,r);
    node res=node{inf,0,0,0,0};
    for(int x=l;x<=r;x++)
    if(L<=x&&x<=R)res=res+node{a[x],a[x],1,0,a[x]};
    return res;
}
node query(int u,int l,int r,int L,int R)
{
	if(u*2>vlim)
	{
		return bquery(u,l,r,L,R);
	}
    if(L<=l&&r<=R)
    {
        node res=node{inf,0,0,0,0};
        for(int x=0;x<=30;x++)
        res=res+tr[x][u];
        return res;
    }
    for(int x=0;x<=30;x++)
    pushdown(u,x);
    int mi=(l+r)/2;
    if(R<=mi)return query(u*2,l,mi,L,R);
    if(mi<L)return query(u*2+1,mi+1,r,L,R);
    return query(u*2,l,mi,L,R)+query(u*2+1,mi+1,r,L,R);
}
void boutput(int u,int l,int r)
{
    cerr<<"detail in "<<l<<','<<r<<endl;
    bapplytag(u,l,r);
    for(int x=l;x<=r;x++)
    cerr<<a[x]<<' ';cerr<<endl;
}
void output(int u,int l,int r)
{
    node res=node{inf,0,0,0,0};
    for(int x=0;x<=30;x++)
    res=res+tr[x][u];
    cerr<<u<<','<<l<<','<<r<<','<<res.sum<<','<<res.mi<<','<<res.mx<<','<<res.cnt<<endl;
	if(u*2>vlim)
	{
		boutput(u,l,r);
        return;
	}
	// for(auto i:{0,1})
	// cerr<<i<<':'<<tr[i][u].sum<<','<<tr[i][u].mi<<','<<tr[i][u].mx<<','<<tr[i][u].cnt<<endl;
    if(l==r)return;
    for(int x=0;x<=30;x++)
    pushdown(u,x);
    int mi=(l+r)/2;
    output(u*2,l,mi);
    output(u*2+1,mi+1,r);
}
void solve([[maybe_unused]]int tc)
{
    int m;
    cin>>n>>m;
    for(int x=1;x<=n;x++)
    cin>>a[x];
    build(1,1,n);
    int lastans=0;
    while(m--)
    {
        // cerr<<"-----------"<<endl;output(1,1,n);cerr<<"----------"<<endl;
        int op;
        cin>>op;
		// lastans=0;
        if(op==1)
        {
            int l,r,x;
            cin>>l>>r>>x;
            l^=lastans,r^=lastans,x^=lastans;
            for(int i=0;i<=30;i++)
            modify(1,1,n,l,r,x,i);
        }
        else
        {
            int l,r;
            cin>>l>>r;
            l^=lastans,r^=lastans;
            node res=query(1,1,n,l,r);
            cout<<res.sum<<' '<<res.mi<<' '<<res.mx<<endl;
            // cerr<<res.sum<<','<<res.mi<<','<<res.mx<<endl;
            lastans=res.sum%(1<<20);
        }
    }
}