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

const int inf = 1000000000;

class segtree {
    vector<pair<int, int>> t;
    int n;
    
    void update(int to, pair<int, int> from) {
        to += n - 1;
        t.at(to) = make_pair(from.first, to - n + 2);
        while (to) {
            to = (to - 1) / 2;
            t.at(to) = min(t.at(2 * to + 1), t.at(2 * to + 2));
        }
    }
    
    pair<int, int> query(int a, int b, int k, int l, int r) {
        if (r <= a || b <= l) return make_pair(inf, inf);
        if (a <= l && r <= b) return t.at(k);
        return min(query(a, b, 2 * k + 1, l, (l + r) / 2), query(a, b, 2 * k + 2, (l + r) / 2, r));
    }
    
    public:
    segtree(vector<int> a) {
        n = 1;
        while (n < a.size()) n *= 2;
        for (int i = 0; i < n - 1; i++) t.emplace_back(inf, inf);
        for (int i = 0; i < a.size(); i++) t.emplace_back(a.at(i), i + 1);
        for (int i = a.size(); i < n; i++) t.emplace_back(inf, inf);
        for (int i = n - 2; i >= 0; i--) t.at(i) = min(t.at(2 * i + 1), t.at(2 * i + 2));
    }
    
    void swap(int l, int r) {
        l--; r--;
        auto w = t.at(l + n - 1);
        update(l, t.at(r + n - 1));
        update(r, w);
    }
    
    int find(int l, int r) {
        return query(l - 1, r, 0, 0, n).second;
    }
};

int main() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a.at(i);
    segtree t(a);
    for (int i = 0; i < q; i++) {
        int k, l, r;
        cin >> k >> l >> r;
        if (k == 1) {
            t.swap(l, r);
        } else {
            cout << t.find(l, r) << endl;
        }
    }
}