#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
#define ls(p) p<<1
#define rs(p) (p<<1)+1
int n,q,a[N];
int t[N<<2];
void build(int l,int r,int p){
	if(l==r){
		t[p]=a[l];
		return;
	}
	int mid=(l+r)>>1;
	build(l,mid,ls(p));
	build(mid+1,r,rs(p));
	t[p]=min(t[ls(p)],t[rs(p)]);
}
void mo(int l,int r,int p,int x,int num){
	if(l==r){
		t[p]=num;
		return;
	}
	int mid=(l+r)>>1;
	if(x<=mid)
		mo(l,mid,ls(p),x,num);
	else
		mo(mid+1,r,rs(p),x,num);
	t[p]=min(t[ls(p)],t[rs(p)]);
}
int gn(int l,int r,int p,int x,int y){
	if(x>y)
		return n;
	if(x<=l&&r<=y)
		return t[p];
	int mid=(l+r)>>1,res=n+1;
	if(x<=mid)
		res=min(res,gn(l,mid,ls(p),x,y));
	if(y>mid)
		res=min(res,gn(mid+1,r,rs(p),x,y));
	return res;
}
int main(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	build(1,n,1);
	while(q--){
		int op,x,y;
		scanf("%d%d%d",&op,&x,&y);
		if(op==1){
			swap(a[x],a[y]);
			mo(1,n,1,x,a[x]);
			mo(1,n,1,y,a[y]);
		}
		else
			printf("%d\n",min(gn(1,n,1,1,x-1),gn(1,n,1,y+1,n)));
	}
	return 0;
}