#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define link(x) for(edge *j=h[x];j;j=j->next)
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,r,l) for(int i=r;i>=l;i--)
const int MAXN=3e5+10;
const double eps=1e-8;
#define ll long long
const int inf=2e9;
using namespace std;
struct edge{int t,v;edge*next;}e[MAXN<<1],*h[MAXN],*o=e;
void add(int x,int y,int vul){o->t=y;o->v=vul;o->next=h[x];h[x]=o++;}
ll read(){ll x=0,f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();return x*f;
}int pre[MAXN],ch[MAXN][2],key[MAXN],lk[MAXN],rk[MAXN],minn[MAXN],maxx[MAXN],Lmin[MAXN],sz[MAXN];
int cnt,rt;
void Treavel(int x)
{if(x){Treavel(ch[x][0]);printf("结点%2d:左儿子 %2d 右儿子 %2d 父结点 %2d size=%2d key=%2d\n",x,ch[x][0],ch[x][1],pre[x],sz[x],key[x]);Treavel(ch[x][1]);}
}
void debug(int rp)
{printf("root:%d\n",rp);Treavel(rp);
}
void newnode(int &x,int t,int fa){x=++cnt;pre[x]=fa;ch[x][0]=ch[x][1]=0;key[x]=lk[x]=rk[x]=t;minn[x]=maxx[x]=t;Lmin[x]=inf;sz[x]=1;
}void up(int x){sz[x]=sz[ch[x][0]]+sz[ch[x][1]]+1;minn[x]=maxx[x]=key[x];Lmin[x]=inf;lk[x]=rk[x]=key[x];if(ch[x][0])lk[x]=lk[ch[x][0]],minn[x]=min(minn[x],minn[ch[x][0]]),maxx[x]=max(maxx[x],maxx[ch[x][0]]),Lmin[x]=min(min(Lmin[x],abs(rk[ch[x][0]]-key[x])),Lmin[ch[x][0]]);if(ch[x][1])rk[x]=rk[ch[x][1]],minn[x]=min(minn[x],minn[ch[x][1]]),maxx[x]=max(maxx[x],maxx[ch[x][1]]),Lmin[x]=min(min(Lmin[x],abs(lk[ch[x][1]]-key[x])),Lmin[ch[x][1]]);
}void rotate(int x,int kind){int y=pre[x];pre[ch[x][kind]]=y;ch[y][!kind]=ch[x][kind];if(pre[y])ch[pre[y]][ch[pre[y]][1]==y]=x;pre[x]=pre[y];ch[x][kind]=y;pre[y]=x;up(y);
}void splay(int x,int goal){while(pre[x]!=goal){if(pre[pre[x]]==goal)rotate(x,ch[pre[x]][0]==x);else{int y=pre[x];int kind=ch[pre[y]][0]==y;if(ch[y][kind]==x)rotate(x,!kind),rotate(x,kind);else rotate(y,kind),rotate(x,kind);}}if(goal==0)rt=x;up(x);
}int find1(int x,int k){if(k==sz[ch[x][0]]+1)return x;else if(k<=sz[ch[x][0]])return find1(ch[x][0],k);else return find1(ch[x][1],k-sz[ch[x][0]]-1);
}void merge(int x,int e){splay(find1(rt,x+1),0);splay(find1(rt,x+3),rt);ch[ch[rt][1]][0]=0;key[rt]=e;up(ch[rt][1]);up(rt);
}void insert(int x,int e){splay(find1(rt,x+1),0);splay(find1(rt,x+2),rt);newnode(ch[ch[rt][1]][0],e,ch[rt][1]);up(ch[rt][1]);up(rt);
}void Max(int x,int y){splay(find1(rt,x),0);splay(find1(rt,y+2),rt);int t=ch[ch[rt][1]][0];printf("%d\n",maxx[t]-minn[t]);
}void Min(int x,int y){splay(find1(rt,x),0);splay(find1(rt,y+2),rt);int t=ch[ch[rt][1]][0];printf("%d\n",Lmin[t]);
}int a[MAXN],n,m;void built(int &x,int l,int r,int y){if(l>r)return ;int mid=(l+r)>>1;newnode(x,a[mid],y);built(ch[x][0],l,mid-1,x);built(ch[x][1],mid+1,r,x);up(x);
}void inte(){newnode(rt,0,0);newnode(ch[rt][1],0,rt);built(ch[ch[rt][1]][0],1,n,ch[rt][1]);up(ch[rt][1]);up(rt);
}int main(){n=read();m=read();cnt=0;inc(i,1,n)a[i]=read();inte();int x,y;char str[11];while(m--){scanf("%s",str);x=read();y=read();if(str[1]=='e')merge(x,y);else if(str[0]=='i')insert(x,y);else if(str[1]=='a')Max(x,y);else Min(x,y);}return 0;
}