#include <bits/stdc++.h>
using namespace std;

template <class Monoid> struct SegmentTree{
    using Func = function<Monoid(Monoid, Monoid)>;

    int size;
    vector<Monoid> seg;
    const Func merge;
    const Monoid def;

    SegmentTree(int n, Monoid d, const Func f): merge(f), def(d){
        for(size = 1; size <= n; size <<= 1);
        seg.assign(size*2, def);
    }

    Monoid& operator[] (int i) { return seg[i+size]; };
    void build(){ for(int i = size-1;i >= 0;i--) seg[i] = merge(seg[i*2], seg[i*2+1]); }

    void update(int i, Monoid val){
        seg[i += size] = val;
        while(i >>= 1) seg[i] = merge(seg[i*2], seg[i*2+1]);
    }

    //void add(int i, Monoid val){ update(i, val+seg[i+size]); }

    Monoid get(int a, int b){
        Monoid l = def, r = def;
        for(a += size, b += size; a < b; a >>= 1, b >>= 1){
            if(a & 1) l = merge(l, seg[a++]);
            if(b & 1) r = merge(r, seg[--b]);
        }
        return merge(l, r);
    }
};

int main(){
    int n, q;
    cin >> n >> q;
    typedef pair<int, int> P;

    SegmentTree<P> seg(n, {INT_MAX, -1}, [](P a, P b){
            return min(a, b);
            });

    for(int i = 0;i < n;i++){
        int a;
        cin >> a;
        seg[i] = {a, i+1};
    }

    seg.build();

    for(int p = 0;p < q;p++){
        int a, b, c;
        cin >> a >> b >> c;
        b--;
        c--;
        if(a == 1){
            int l = seg[b].first;
            int r = seg[c].first;
            seg.update(b, {r, b+1});
            seg.update(c, {l, c+1});
        }else{
            cout << seg.get(b, c+1).second  << endl;
        }
    }

    return 0;
}