#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000505
#define inf 0x3f3f3f3f

struct dat{
	unsigned mx,t0,t1,cnt;
	dat(unsigned MX=0,unsigned T0=0,unsigned T1=0,unsigned C=0){mx=MX,t0=T0,t1=T1,cnt=C;}
	dat operator +(const dat&b)const{
		dat c;
		c.mx=max(mx,b.mx);
		c.t0=((~t0&b.t0)|(t0&b.t1));
		c.t1=((~t1&b.t0)|(t1&b.t1));
		c.cnt=cnt+b.cnt;
		return c;
	}
	void clr(){mx=cnt=t0=0,t1=-1;}
};

int n,m,wa[maxn],wb[maxn];

#define N 5000005
int ls[N],rs[N],sz[N];
dat lv[N],rv[N],res[N];
// res[u] : 合并时，中间一段剩余的答案 
int rub[maxn],top,cnt,rt;
inline int newn(){return top?rub[top--]:++cnt;}
inline void thro(int u){rub[++top]=u;}
inline int newn(int w1,signed w2){
	int u=newn();
	ls[u]=rs[u]=0; sz[u]=1; lv[u].clr(),rv[u].clr(),res[u].clr();
	if(w1) rv[u]=dat(w2,-1,~w2,1);
	else lv[u]=dat(w2,-1,~w2,1);
	return u;
}

dat askr(int u,int k){
	if(k==rv[u].cnt) return rv[u];
	int l=ls[u],r=rs[u];
	if(rv[l].cnt<=lv[r].cnt) return askr(r,k);
	int d=rv[l].cnt-lv[r].cnt;
	if(d>=k) return askr(l,k);
	return res[u]+askr(r,k-d);
}
dat askl(int u,int k){
	if(k==lv[u].cnt) return lv[u];
	int l=ls[u],r=rs[u];
	if(rv[l].cnt>=lv[r].cnt) return askl(l,k);
	int d=lv[r].cnt-rv[l].cnt;
	if(k<=d) return askl(r,k);
	return askl(l,k-d)+res[u];
}
void up(int u){
	int l=ls[u],r=rs[u];
	sz[u]=sz[l]+sz[r];
	if(rv[l].cnt>lv[r].cnt){ 
		res[u]=askr(l,rv[l].cnt-lv[r].cnt);
		lv[u]=lv[l];
		rv[u]=res[u]+rv[r];
	}
	else if(rv[l].cnt<lv[r].cnt){
		res[u]=askl(r,lv[r].cnt-rv[l].cnt); 
		lv[u]=lv[l]+res[u];
		rv[u]=rv[r];
	}
	else lv[u]=lv[l],rv[u]=rv[r],res[u]=dat(0,0,-1,0);
}

inline int up(int u,int v){
	int w=newn();
	return ls[w]=u,rs[w]=v,up(w),w;
}
int build(int l,int r){
	if(l==r)return newn(wa[l],wb[l]);
	int mid=l+r>>1;
	return up(build(l,mid),build(mid+1,r));
}
// this merge is fake!!!
int merge(int u,int v){
	if(!u||!v)return u|v;
	int t;
	if(sz[u]>sz[v]*4) return t=up(ls[u],merge(rs[u],v)),thro(u),t;
	if(sz[v]>sz[u]*4) return t=up(merge(u,ls[v]),rs[v]),thro(v),t;
	return up(u,v);
} 
void split(int p,int k,int&x,int&y){
	if(!k)return x=0,y=p,void();
	if(sz[p]==1)return x=p,y=0,void();
	if(k<=sz[ls[p]]) split(ls[p],k,x,y),thro(p),y=merge(y,rs[p]);
	else split(rs[p],k-sz[ls[p]],x,y),thro(p),x=merge(ls[p],x);
}

// query:
int split(int p,int l,int r){
	if(l==1 && r==sz[p])return p;
	int mid=sz[ls[p]];
	if(r<=mid) return split(ls[p],l,r);
	if(l>mid) return split(rs[p],l-mid,r-mid);
	return up(split(ls[p],l,mid),split(rs[p],1,r-mid));
}
unsigned ask(int l,int r){
	int cnt0=cnt,top0=top;
	int u=split(rt,l,r);
	cnt=cnt0,top=top0;
	dat ret=(lv[u]+rv[u]);
	return (ret.mx^ret.t1);
}

void mdf1(int p,int x,int w){
	if(sz[p]==1){
		if(rv[p].cnt) rv[p].clr(),lv[p]=dat(w,-1,~w,1);
		else lv[p].clr(),rv[p]=dat(w,-1,~w,1);
		return;
	}
	int mid=sz[ls[p]];
	if(x<=mid)mdf1(ls[p],x,w);
	else mdf1(rs[p],x-mid,w);
	up(p);
}
void mdf2(int l,int r){
	int x,y,z;
	split(rt,l-1,x,y),split(y,r-l+1,y,z);
	rt=merge(merge(x,z),y);
}

signed main()
{
	n=read(),m=read();
	For(i,1,n)wa[i]=read(),wb[i]=read();
	rt=build(1,n);
	For(i,1,m){
		int op=read(),x=read(),y=read();
		if(op==1) mdf1(rt,x,y);
		else if(op==2) printf("%u\n",ask(x,y));
		else mdf2(x,y);
	}
	return 0;
}
/*
10 10
0 1
1 9
1 2
0 5
1 1
0 6
1 1
0 4
0 8
1 7
2 5 7
*/