#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr<<#x<<": "<<x<<endl

class segtree{
public:
    segtree(ll size, vector<ll> &v){
        n = 1;
        while(n < size){n *= 2;}
        data = vector<ll>(2*n-1, MAX_NUM);
        build(v);
    }
    void build(vector<ll> &v){
        for(int i = 0; i < v.size(); i++){
            data[n-1+i] = v[i];
        }
        for(int i = n-2; i >= 0; i--){
            data[i] = min(data[2*i+1], data[2*i+2]);
        }
    }
    void update(ll k, ll a){
        k += n-1;
        data[k] = a;
        while(k>0){
            k = (k-1)/2;
            data[k] = min(data[2*k+1], data[2*k+2]);
        }
    }
    ll getSize(){return n;}
    ll getData(ll num){return data[n-1+num];}
    ll query(ll a, ll b, ll k, ll l, ll r){
        if(r <= a || b <= l){return MAX_NUM;}   
        if(a <= l && r <= b){return data[k];}
        else{
            ll vl = query(a, b, 2*k+1, l, (l+r)/2);
            ll vr = query(a, b, 2*k+2, (l+r)/2, r);
            return min(vl, vr);
        }
    }
    void print_all_tree(){
        ll cnt = 0;
        ll br = 1;
        for(int i = 0; i < data.size(); i++){
            cout << data[i] << " ";
            cnt++;
            if(cnt == br){
                cout << endl;
                cnt = 0;
                br *= 2;
            }
        }
    }
private:
    ll n;
    vector<ll> data;
    ll MAX_NUM = 1LL << 60;
};


int main(){
    ll n, q;
    cin >> n >> q;
    vector<ll> a(n);
    map<ll,ll> pos;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        pos[a[i]] = i;
    }
    segtree st(n, a);
    ll init = st.getSize() - 1;

    for(int i = 0; i < q; i++){
        ll ta, tl, tr;
        cin >> ta >> tl >> tr;
        tl--; tr--;
        if(ta==1){
            ll al = st.getData(tl);
            ll ar = st.getData(tr);
            pos[al] = tr;
            pos[ar] = tl;

            st.update(tl, ar);
            st.update(tr, al);
        }else{
            ll ret = st.query(tl, tr+1, 0, 0, st.getSize());
            cout << pos[ret]+1 << endl;
        }
    }
    return 0;
}