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

template <typename T, typename Op = plus<T>>
class segtree {
private:
    size_t N;
    vector<T> data;
    T idelem;
    const Op &op;

public:
    segtree(size_t n, T idelem, const Op &op = Op())
    : idelem(idelem), op(op) {
        for(N = 1; N < n; N <<= 1);
        data = vector<T>(2 * N, idelem);
    }

    segtree(const vector<T> &init, T idelem, const Op &op = Op())
    : idelem(idelem), op(op) {
        for(N = 1; N < init.size(); N <<= 1);
        data = vector<T>(2 * N, idelem);
        for(int i = 0; i < init.size(); ++i) data[i + N] = init[i];
        for(int i = N - 1; i >= 0; --i) data[i] = op(data[2 * i], data[2 * i + 1]);
    }

    void update(size_t pos, T val) {
        data[pos + N] = val;
        for(pos = (pos + N) / 2; pos > 0; pos >>= 1) {
            data[pos] = op(data[2 * pos], data[2 * pos + 1]);
        }
    }

    T query(size_t left, size_t right) {
        left += N;
        right += N;

        T vl = idelem, vr = idelem;
        while(left < right) {
            if(left & 1) vl = op(vl, data[left++]);
            if(right & 1) vr = op(data[right - 1], vr);
            left >>= 1;
            right >>= 1;
        }
        return op(vl, vr);
    }

    T operator[](size_t k) {
        return data[k + N];
    }
};


int main() {
    using P = pair<int, int>;

    int N, Q; cin >> N >> Q;
    vector<P> A(N);
    for(int i=0; i<N; ++i) {
        cin >> A[i].first;
        A[i].second = i;
    }
    
    auto op = [](P const& a, P const& b) {
        return a.first < b.first ? a : b;
    };
    segtree<P, decltype(op)> tree(A, P(100100, -1), op);

    while(Q--) {
        int k,l,r; cin >> k >> l >> r;
        if(k == 1) {
            auto s = tree[l - 1], t = tree[r - 1];
            tree.update(l - 1, P(t.first, l - 1));
            tree.update(r - 1, P(s.first, r - 1));
        } else {
            cout << tree.query(l - 1, r).second + 1 << endl;
        }
    }
}