#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
template<class T, class Compare = less<T> >
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template<class T, class Compare = greater<T> >
using MinHeap = priority_queue<T, vector<T>, Compare>;
using llong = long long;

//===
template<typename Monoid>
struct SegmentTree {
    using OP = function<Monoid(Monoid, Monoid)>;
    
    vector<Monoid> tree;
    int size;
    const OP f; // bin' operation
    const Monoid e; // neutral element
                                           
    SegmentTree(int nmemb, const Monoid &e, const OP &f):
        f(f),
        e(e)
    {
        size = 1;
        while (size < nmemb) {
            size *= 2;
        }

        tree.assign(2 * size - 1, e);
    }

    void update(int k, Monoid dat) {
        k += size - 1;
        tree[k] = dat;
        
        while(k > 0) {
            k = (k - 1) / 2;
            tree[k] = f(tree[2 * k + 1], tree[2 * k + 2]);
        }
    }

    // [l, r)
    Monoid query(int l, int r) {
        l += size - 1;
        r += size - 1;

        Monoid d = e;
        while (l < r) {
            if (l % 2 == 0) {
                d = f(d, tree[l]);
                l++;
            }
            if (r % 2 == 0) {
                r--;
                d = f(d, tree[r]);
            }

            l = (l - 1) / 2;
            r = (r - 1) / 2;
        }

        return d;
    }

    Monoid operator[] (const int k) { return query(k, k + 1); }
};
//===

struct P {
    int v;
    int idx;

    P(int v, int idx): v(v), idx(idx) {};

    bool operator < (const P &r) const { return this->v < r.v; };
};

int n, q;
int com, l, r;
SegmentTree<P> seg(100005, P(1 << 29, 0), [](auto l, auto r){ return min(l, r); });

int main() {
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        int v;
        cin >> v;
        seg.update(i, P(v, i + 1));
    }

    for (int i = 0; i < q; i++) {
        cin >> com >> l >> r;

        r--; l--;

        if (com == 1) {
            P a = seg[l];
            P b = seg[r];

            seg.update(l, P(b.v, a.idx));
            seg.update(r, P(a.v, b.idx));
        }
        else if (com == 2) {
            P a = seg.query(l, r + 1);

            cout << a.idx << endl;
        }
    }

    return 0;
}