#include<bits/stdc++.h>

//#define int long long

#define endl "\n"

#define ull unsigned long long

#define ts cout<<1<<"\n";

using namespace std;

int n,q;

int a[1000005];

int mi[1000000*4+5];

void build(int k,int x,int y){
	
	if(x==y){
		
		mi[k]=a[x];
		
		return ;
		
	} else {
		
		int mid=(x+y)>>1;
		
		build(k*2,x,mid);
		
		build(k*2+1,mid+1,y);
		
		mi[k]=min(mi[k*2],mi[k*2+1]);
		
		return ;
		
	}
	
}

void modify(int k,int x,int y,int qx,int qy,int z){
	
	if(x==qx&&qy==y){
		
		a[x]+=z;
		
		mi[k]=a[x];
		
	} else {
		
		int mid=(x+y)>>1;
		
		if(qy<=mid) modify(k*2,x,mid,qx,qy,z);
		
		if(qx>mid) modify(k*2+1,mid+1,y,qx,qy,z);
		
//		else modify(k*2,x,mid,qx,mid,z),modify(k*2+1,mid+1,y,mid+1,qy,z);
	    
	    mi[k]=min(mi[k*2],mi[k*2+1]);
	    
	}
	
}

int query(int k,int x,int y,int qx,int qy){
	
	if(x>=qx&&y<=qy){
		
		return mi[k];
		
	} else {
		
		int ans=n;
		
		int mid=(x+y)>>1;
		
		if(qx<=mid) ans=min(ans,query(k*2,x,mid,qx,qy));
		
		if(qy>mid) ans=min(ans,query(k*2+1,mid+1,y,qx,qy));
		
		return ans;
		
	}
	
}

signed main(){
	
	ios::sync_with_stdio(0);
	
	cin.tie(0);
	
	cout.tie(0);
	
	memset(mi,0x3f,sizeof(mi));
	
	cin>>n>>q;
	
	for(int i=1;i<=n;i++) cin>>a[i];
	
	build(1,1,n);
	
	while(q--){
		
		int pd,x,y;
		
		cin>>pd>>x>>y;
		
		if(pd==1){
			
			int cntx=a[x],cnty=a[y];
			
			modify(1,1,n,x,x,cnty-cntx);
			
			modify(1,1,n,y,y,cntx-cnty);
			
		} else {
			
			int ans=n;
			
			if(x>1) ans=min(ans,query(1,1,n,1,x-1));
			
			if(y<n) ans=min(ans,query(1,1,n,y+1,n));
			
			cout<<ans<<"\n";
			
		}
		
	}
	
	return 0;
	
}