#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
namespace IO{
	int read(){
		int x=0,c=getchar(),f=1;
		while(c<'0' || c>'9'){
			if(c=='-')f=-1;
			c=getchar();
		}
		while(c>='0' && c<='9'){
			x=(x<<3)+(x<<1)+c-'0';
			c=getchar();
		}
		return f==1?x:-x;
	}
	void write(int x){
		if(x<0){
			putchar('-');
			write(-x);
			return;
		}
		if(x>9)write(x/10);
		putchar(x%10+48);
	}
	void write(int x,char div){
		write(x);
		putchar(div);
	}
	void write(const char *s){
		int pos=0;
		while(s[pos])putchar(s[pos++]);
	}
}
using namespace IO;
int n,Q;
int val[600005];
int mn[600005],dat[600005],tag[600005];
int p[600005];
int ls[600005],rs[600005];
int sz[600005];
int rt=0;
int tot=0;
int newnode(int v){
	++tot;
	val[tot]=mn[tot]=v;
	dat[tot]=rand();
	tag[tot]=0;
	sz[tot]=1;
	return tot;
}
void pushup(int x){
	sz[x]=sz[ls[x]]+sz[rs[x]]+1;
	mn[x]=min(min(mn[ls[x]],mn[rs[x]]),val[x]);
}
void pushdown(int x){
	if(!tag[x])return;
	int tmp=tag[x];
	if(ls[x]){
		tag[ls[x]]+=tmp;
		val[ls[x]]+=tmp;
		mn[ls[x]]+=tmp;
	}
	if(rs[x]){
		tag[rs[x]]+=tmp;
		val[rs[x]]+=tmp;
		mn[rs[x]]+=tmp;
	}
	tag[x]=0;
}
void split(int x,int v,int &tx,int &ty){
	if(x==0){
		tx=ty=0;
		return;
	}
	pushdown(x);
	if(v>=sz[ls[x]]+1){
		tx=x;
		split(rs[x],v-sz[ls[x]]-1,rs[x],ty);
	}
	else{
		ty=x;
		split(ls[x],v,tx,ls[x]);
	}
	pushup(x);
}
int merge(int x,int y){
	if(x==0 || y==0)return x|y;
	if(dat[x]<dat[y]){
		pushdown(x);
		rs[x]=merge(rs[x],y);
		pushup(x);
		return x;
	}
	else{
		pushdown(y);
		ls[y]=merge(x,ls[y]);
		pushup(y);
		return y;
	}
}
int query(int x,int k){
	pushdown(x);
	if(k==sz[ls[x]]+1)return val[x];
	if(k<=sz[ls[x]])return query(ls[x],k);
	return query(rs[x],k-sz[ls[x]]-1);
}
void sswap(int x,int y){
	if(x>y)swap(x,y);
	int t1,t2,t3,t4,t5;
	split(rt,y,t4,t5);
	split(t4,y-1,t3,t4);
	split(t3,x,t2,t3);
	split(t2,x-1,t1,t2);
	rt=merge(merge(merge(merge(t1,t4),t3),t2),t5);
}
void output(int x){
	if(!x)return;
	pushdown(x);
	output(ls[x]);
	write(val[x],32);
	output(rs[x]);
}
int main(){
	val[0]=mn[0]=inf;
	n=read();Q=read();
	for(int i=1;i<=n;i++)p[i]=read();
	for(int i=1;i<=n;i++)p[p[i]+n]=i;
	for(int i=1;i<=n+n;i++)rt=merge(rt,newnode(p[i]));
	// output(rt);
	// printf("\n");
	while(Q--){
		int op=read();
		int x=read();
		// printf("***\n");
		// printf("%d %d\n",op,x);
		if(op==1)write(query(rt,x),10);
		if(op==2){
			int y=read();
			int t1,t2,t3,t4,t5;
			split(rt,y,t1,t2);
			split(t1,x-1,t3,t1);
			int l=mn[t1];
			int r=l+y-x;
			split(t2,r+n-y,t2,t5);
			split(t2,l-1+n-y,t2,t4);
			// printf("t1:\n");
			// output(t1);
			// printf("\nt2:\n");
			// output(t2);
			// printf("\nt3:\n");
			// output(t3);
			// printf("\nt4:\n");
			// output(t4);
			// printf("\nt5:\n");
			// output(t5);
			// printf("\n");
			int d=mn[t4]-mn[t1];
			mn[t1]+=d;
			val[t1]+=d;
			tag[t1]+=d;
			mn[t4]-=d;
			val[t4]-=d;
			tag[t4]-=d;
			rt=merge(merge(merge(merge(t3,t4),t2),t1),t5);
		}
		if(op==3){
			int y=read();
			// printf("SWAP %d %d\n",x,y);
			int tx=query(rt,x),ty=query(rt,y);
			// printf("tx=%d,ty=%d\n",tx,ty);
			sswap(x,y);
			sswap(tx+n,ty+n);
		}
		// output(rt);
		// putchar(10);
	}
	int tl,tr;
	split(rt,n,tl,tr);
	output(tl);
	return 0;
}
// quod erat demonstrandum