#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;



template<typename Monoid>
struct SegmentTree{
    int n;
    vector<Monoid> node;

    SegmentTree(vector<Monoid> v){
        int k = v.size();
        n = 1; while(n < k) n *= 2;
        node.resize(2*n-1,Pi(0,0)); //単位元で初期化
        for(int i = 0; i < k; i++) node[i+n-1] = v[i];
        for(int i = n-2; i >= 0; i--){
            if(node[2*i+1].second < node[2*i+2].second) node[i] = node[2*i+1];
            else node[i] = node[2*i+2];
        } //書き換える
    }

    SegmentTree(int k){
        n = 1; while(n < k) n *= 2;
        node.resize(2*n-1,INT32_MAX); //書き換える
    }

    void update(int k, Monoid x){
        k += n-1;
        node[k] = x;
        while(k > 0){
            k = (k-1)/2;
            if(node[2*k+1].second < node[2*k+2].second) node[k] = node[2*k+1];
            else node[k] = node[2*k+2];//書き換える
        }
    }

    //[a,b)のクエリに答える
    Monoid query(int a, int b, int k = 0, int l = 0, int r = -1){
        if(r < 0) r = n;
        if(b <= l || a >= r) return Pi(0,INF);
        if(a <= l && b >= r) return node[k];
        else{
            Monoid s = query(a,b,2*k+1,l,(l+r)/2);
            Monoid t = query(a,b,2*k+2,(l+r)/2,r);
            return (s.second < t.second ? s : t); //書き換える
        }
    }

    Monoid operator [](int k){
        return node[k+n-1];
    }
};

int main(){
    int N,Q; cin >> N >> Q;
    vector<Pi> a(N);
    rep(i,N) cin >> a[i].second,a[i].first = i;
    SegmentTree<Pi> seg(a);
    while(Q--){
        int a,b,c; cin >> a >> b >> c;
        b--; c--;
        if(a == 1){
            auto s = seg[b];
            auto t = seg[c];
            seg.update(b,Pi(b,t.second));
            seg.update(c,Pi(c,s.second));
        }
        else{
            cout << seg.query(b,c+1).first+1 << endl;
        }
    }
}