#ifndef ONLINE_JUDGE
#include "header.hpp"
#else
#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/multiprecision/cpp_int.hpp>
using cpp_int=boost::multiprecision::cpp_int;
#include <boost/multiprecision/cpp_dec_float.hpp>
template<unsigned size>using cpp_float=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<size>>;
template<unsigned size>using cpp_double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<size,long long>>;
#endif

using namespace std;
using ll=long long;
inline void yn(bool x){if(x){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}
#define double_out(x) fixed << setprecision(x)
template<class T> inline void erase_duplicate(vector<T>& A){sort(A.begin(),A.end());A.erase(unique(A.begin(),A.end()),A.end());}
inline ll powll(ll x,ll n){ll r=1;while(n>0){if(n&1){r*=x;};x*=x;n>>=1;};return r;}

struct S{
    ll val;
    ll index;
};

S op(S a, S b){
    if(a.val>b.val){
        return b;
    }else{
        return a;
    }
}

S e(){
    return S{(ll)1e9,-1};
}

int main(){
    ll N,Q;
    cin>>N>>Q;
    vector<S> A(N);
    for(ll i=0;i<N;i++){
        cin>>A[i].val;
        A[i].index=i;
    }
    atcoder::segtree<S,op,e> seg(A);
    for(ll i=0;i<Q;i++){
        ll t,l,r;
        cin>>t>>l>>r;
        l--;
        r--;
        if(t==1){
            S L=seg.get(l);
            S R=seg.get(r);
            seg.set(l,S{R.val,l});
            seg.set(r,S{L.val,r});
        }else{
            cout<<seg.prod(l,r+1).index+1<<endl;
        }
    }
}