#include <bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}

using S = pair<ll, ll>;
struct F {
    ll a, b;
};

S op(S l, S r) { 
    if (l.first < r.first)return l;
    else return r;
}


S e() { return S{ ll(1e15), 0 }; }



int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N,Q;
    cin >> N>>Q;
    vll A(N);
    rep(i, N)cin >> A[i];
    segtree<S, op, e> seg(N);
    rep(i, N) {
        seg.set(i, S{ A[i],i });
    }
    
    rep(q, Q) {
        ll T, L, R;
        cin >> T >> L >> R;
        L--; R--;
        if (T == 1) {
            auto lp = seg.get(L);
            auto rp = seg.get(R);
            seg.set(L, { rp.first,L });
            seg.set(R, { lp.first,R });
        }
        else {
            auto an = seg.prod(L, R + 1);
            cout << an.second + 1 << endl;
        }
    }
}