#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
struct SegTree{
    int n;
    vector <pair <int,int> > node;
    SegTree(vector <int> v){
        int sz = v.size();
        n = 1;
        while(n<sz) n*=2;
        node.resize(2*n-1, {INF,INF});
        for(int i=0; i<sz; i++) node[i+n-1] = {v[i],i}; //一番下側
        for(int i=n-2;i>=0;i--) node[i] = min(node[2*i+1], node[2*i+2]);
    }
    void update(int number, int val){
        number += n-1;
        node[number].F= val;
        while(number>0){
            number=(number-1)/2;
            node[number] = min(node[number*2+1], node[number*2+2]);
        }
    }
    pair <int,int> getmin(int a, int b, int k=0, int l = 0, int r = -1){
        if(r<0) r=n;
        if(r<=a||l>=b) return {INF,INF};
        if(a <= l&& r<=b) return node[k];
        pair <int,int>  vl = getmin(a, b, 2*k+1, l, (l+r)/2);
        pair <int,int>  vr = getmin(a, b, 2*k+2, (l+r)/2, r);
        return min(vl, vr);
    }
};
//参考:http://tsutaj.hatenablog.com/entry/2017/03/29/204841
signed main(void){
    int n,q; cin>>n>>q;
    vector <int> a(n); 
    rep(i,n) cin>>a[i];
    SegTree t(a);
    n = t.n;
    rep(i, q){
        int b,l,r; cin>>b>>l>>r;
        l--,r--;
        if(b==1){
            int tmpl = t.node[n-1+l].F, tmpr = t.node[n-1+r].F;
            //cout<<tmpl<<' '<<tmpr<<endl;
            t.update(l,tmpr); t.update(r, tmpl);
        }else{
            l++; r++;
            cout<</*t.getmin(l,r).F<<'*'<<*/t.getmin(l,r).S + 1<<endl;
        }
    }
    //rep(i, 3) cout<<t.node[n-1+i].F<<' '<<t.node[n-1+i].S<<endl;;
}