#if !__INCLUDE_LEVEL__

#include __FILE__
using S = pair<ll,ll>;
S op(S x, S y) { return min(x, y); }
S e() { return { INF, -1 }; }
//構築
//segtree<ll,op,e> seg(A);
//メソッド
//seg.set(i,x);A[i]=x
//seg.get(i);A[i]を取得
//seg.prod(l,r);op(A[l]~A[r-1])を取得
//seg.all_prod();op(A[0]~A[N-1])を取得。
//l=seg.min_left<fmin>(i);i~Nでにぶたん
//r=seg.max_right<fmin>(i);0~iでにぶたん
int main()
{
    ll N,Q;cin >> N >> Q;
    vl A(N);rep(i,N)cin >> A[i];
    vector<S> Ap(N);
    rep(i,N)Ap[i] = {A[i],i};
    segtree<S,op,e> seg(Ap);
    rep(q,Q){
        int t;cin >> t;
        ll l,r;
        if(t==1){
            cin >> l >> r;
            l-=1;
            r-=1;
            auto al = seg.get(l);
            auto ar = seg.get(r);
            seg.set(l,{ar.first,l});
            seg.set(r,{al.first,r});
        }
        else{
            cin >> l >> r;
            l-=1;
            cout << seg.prod(l,r).second+1 << endl;
        }
    }
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define range(i, m, n) for(int i = m; i < n; i++)
#define fore(i,a) for(auto &i:a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Sum(v) accumulate(all(v),0)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
const ll INF = 1e16;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
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; }
ll SN(char s){return ll(s-'0');}
ll SN(string s){return stoll(s);}
int alpN(char s){return int(s-'a');}
int AlpN(char s){return int(s-'A');}
using Graph = vector<vector<ll>>;
using GraphCost = vector<vector<pair<ll,ll>>>;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using pll = pair<long long, long long>;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力
ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1
ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}
template<class T> bool contain(const std::string& s, const T& v) {
    return s.find(v) != std::string::npos;
}

#endif