#include<bits/stdc++.h>
using namespace std;
const int N = 800005;
int rnd[N],sz[N],add[N],ls[N],rs[N],mx[N],a[N],p[N],val[N];
int rt,rt1;
int n,m,nw;
int new_(int v){
	rnd[++nw] = rand(),sz[nw] = 1,val[nw] = v;return nw;
}void push_up(int k){
	sz[k] = sz[ls[k]]+sz[rs[k]]+1;
	mx[k] = val[k];
	if(ls[k])mx[k] = max(mx[k],mx[ls[k]]);
	if(rs[k])mx[k] = max(mx[k],mx[rs[k]]);
}void add_(int k,int x){
	add[k]+=x,val[k]+=x,mx[k]+=x;return;
}void push_down(int k){
	if(add[k]!=0){
		if(ls[k])add_(ls[k],add[k]);
		if(rs[k])add_(rs[k],add[k]);
		add[k] = 0;
	}return;
}void split_(int now,int& x,int& y,int k){
	if(!now){
		x = y =0;return;
	}push_down(now);
	if(sz[ls[now]]<k){
		x = now;split_(rs[now],rs[now],y,k-sz[ls[now]]-1);
	}else{
		y = now;split_(ls[now],x,ls[now],k);
	}push_up(now);
}int merge(int x,int y){
	if(!x or !y)return x|y;
	push_down(x);push_down(y);
	if(rnd[x]<rnd[y]){
		rs[x] = merge(rs[x],y);push_up(x);return x;
	}else{
		ls[y] = merge(x,ls[y]);push_up(y);return y;
	}
}void ins(int pos,int v){
	int x,y;split_(rt,x,y,pos);rt = merge(merge(x,new_(v)),y);
}void ins1(int pos,int v){
	int x,y;split_(rt1,x,y,pos);rt1 = merge(merge(x,new_(v)),y);
}int query(int pos){
	int x,y,z;
	split_(rt,x,y,pos-1);split_(y,y,z,1);
	int res = val[y];rt = merge(merge(x,y),z);
	return res;
}void Reverse(int l,int r){
	int x,y,z;
	split_(rt,x,y,l-1);split_(y,y,z,r-l+1);
	int Mx = mx[y];
	int L = Mx-(r-l),R = Mx;
//	cout << " " << L << " " << R << endl;
	//l->l
	int X,Y,Z;
	split_(rt1,X,Y,L-1);split_(Y,Y,Z,R-L+1);
	add_(Y,L-l),add_(y,l-L);
	rt = merge(merge(x,Y),z);
	rt1 = merge(merge(X,y),Z);
}void Swap(int a,int b){
	int x,y,z,w,u;
	split_(rt,x,y,a-1);split_(y,y,z,1);
	split_(z,z,w,b-a-1);split_(w,w,u,1);
	int A = val[y],B = val[w];
	if(A>B)swap(A,B);
	int X,Y,Z,W,U;
	split_(rt1,X,Y,A-1);split_(Y,Y,Z,1);
	split_(Z,Z,W,B-A-1);split_(W,W,U,1);
	rt1 = merge(merge(merge(X,merge(W,Z)),Y),U);
	rt = merge(merge(merge(x,merge(w,z)),y),u);
	
}void dfs(int now){
	push_down(now);
	if(ls[now])dfs(ls[now]);
	cout << val[now] << " ";
	if(rs[now])dfs(rs[now]);
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for(int i = 1;i<=n;i++){
		cin>> a[i];p[a[i]] = i;
	}for(int i = 1;i<=n;i++)ins(i,a[i]);
	for(int i = 1;i<=n;i++)ins1(i,p[i]);
	//for(int i = 1;i<=n;i++)cout << query(i) << " ";cout << endl;
//	dfs(rt);
	while(m--){
		int op;cin >> op;
		if(op == 1){
			int pos;cin >> pos;cout << query(pos) << '\n';
		}if(op == 2){
			int l,r;cin>> l >> r;Reverse(l,r);
		}if(op == 3){
			int x,y;cin >> x >> y;
			if(x>y)swap(x,y);
			if(x == y)continue;
			Swap(x,y);	
		}
	}dfs(rt);cout << '\n';
	return 0;
}/*
6 2
4 5 3 2 1 6
2 1 4
3 5 6
*/