#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

template<typename T> class ST {
    using F = function<T(T, T)>;
    int size;
    T init;
    F f;
    vector<T> seg;
    int depth = 0;
    
    public: ST(int size, T init, F f): size(size), init(init), f(f) {
        while (1<<depth < size) depth++;
        seg.assign(2<<depth, init);
    }
    
    void update(int k, T t) {
        k += 1 << depth;
        seg[k] = t;
        while(k>>=1) seg[k] = f(seg[2*k], seg[2*k+1]);
    }
    
    T query(int a, int b) {
        a += 1<<depth;
        b += 1<<depth;
        T l = init;
        T r = init;
        while(a < b) {
            if (a & 1) l = f(l, seg[a++]);
            if (b & 1) r = f(r, seg[--b]);
            a >>= 1;
            b >>= 1;
        }
        return f(l, r);
    }
    
    T operator[] (int k) {
        return seg[k + (1<<depth)];
    }
};

int N,Q;

struct Leaf {
    int n;
    int v;
    
    Leaf(int n, int v): n(n), v(v) {}
};

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin>>N>>Q;
    
    auto init = Leaf(-1, LONG_LONG_MAX);
    ST<Leaf> tree(N, init, [](Leaf a, Leaf b) { return (a.v < b.v) ? a : b; });
    
    int a;
    REP(i, N) {
        cin >> a;
        tree.update(i, Leaf(i+1, a));
    }
    
    int c,l,r;
    REP(i, Q) {
        cin>>c>>l>>r;
        l--;
        r--;
        if (c == 1) {
            auto tmp = tree[l];
            tree.update(l, Leaf(l+1, tree[r].v));
            tree.update(r, Leaf(r+1, tmp.v));
        } else {
            cout << tree.query(l, r+1).n << endl;
        }
    }
    
    return 0;
}