#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <functional>
#include <cstring>
#include <regex>
#include <random>
#include <cassert>
#include <stack>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, s, n) for (int i = (s); i < (int)(n); i++)
#define revrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define revrepr(i, s, n) for (int i = (n) - 1; i >= s; i--)
#define debug(x) cerr << #x << ": " << x << "\n"
#define popcnt(x) __builtin_popcount(x)

using ll = long long;
using P = pair<int, int>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T>
istream& operator >>(istream &is, vector<T> &v) {
    for (int i = 0; i < (int)v.size(); i++) cin >> v.at(i);
    return is;
}

template<class T, class U>
ostream& operator <<(ostream &os, pair<T, U> p) {
    cout << '(' << p.first << ", " << p.second << ')';
    return os;
}

template<class T>
void print(const vector<T> &v, const string &delimiter) { rep(i, v.size()) cout << (0 < i ? delimiter : "") << v.at(i); cout << endl; }

template<class T>
void print(const vector<vector<T>> &vv, const string &delimiter) { for (const auto &v: vv) print(v, delimiter); }

template<class T>
struct SegmentTree {
    int n;
    T init_v;
    vector<T> dat;

    SegmentTree(int _n, T _init_v) : init_v(_init_v) {
        n = 1;
        while (n < _n) n *= 2;
        dat.assign(n, init_v);
    }

    //dat[k] := v
    void update(int k, T v) {
        k += n - 1;
        dat[k] = v;
        while (k > 0) {
            k = (k - 1) / 2;
            dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
        }
    }

    T sub_query(int a, int b, int k, int l, int r) const {
        if (r <= a || b <= l) return init_v;
        if (a <= l && r <= b) return dat[k];

        T vl = sub_query(a, b, k * 2 + 1, l, (l + r) / 2);
        T vr = sub_query(a, b, k * 2 + 2, (l + r) / 2, r);
        return min(vl, vr);
    }
    //[a, b)の最小値    
    T query(int a, int b) const { return sub_query(a, b, 0, 0, n); }
};

int main() {
    int n, q;
    cin >> n >> q;
    SegmentTree<int> st(n, n + 1);
    vector<int> idx(n + 1);
    rep(i, n) {
        int a;
        cin >> a;
        st.update(i, a);
        idx[a] = i;
    }
    
    auto change = [&](int i, int j) {
        int a = st.query(i, i + 1);
        int b = st.query(j, j + 1);
        swap(idx[a], idx[b]);
        st.update(i, b);
        st.update(j, a);
    };
    
    rep(i, n) {
        int k, l, r;
        cin >> k >> l >> r;
        l--; r--;
        if (k == 1) change(l, r);
        else cout << idx[st.query(l, r + 1)] + 1 << endl;
    }
}