#ifndef LOCAL
#include <bits/stdc++.h>

using namespace std;

#define debug(...) (void(0))
#else
#include "algo/debug.h"
#endif

#include <atcoder/segtree>
void solve() {
    int N, Q;
    cin >> N >> Q;
    vector<pair<int, int>> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i].first;
        A[i].second = i;
    }
    atcoder::segtree<pair<int, int>, [](const pair<int, int>& a, const pair<int, int>& b) -> pair<int, int> { return min(a, b); }, []() -> pair<int, int> { return {1e9, 1e9}; }>
        seg(A);
    while (Q--) {
        int t;
        cin >> t;
        int l, r;
        cin >> l >> r;
        if (t == 1) {
            l--; r--;
            pair<int, int> L = seg.get(l);
            pair<int, int> R = seg.get(r);
            swap(L.second, R.second);
            seg.set(l, R);
            seg.set(r, L);
        } else {
            l--;
            auto ans = seg.prod(l, r);
            cout << ans.second + 1 << endl;
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int tt = 1;
    // std::cin >> tt;
    while (tt--) {
        solve();
    }
}