#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

template <typename Monoid> class SegmentTree{
private:
  int size;
  vector<Monoid> vec;
  
  inline Monoid aux(int x, int y, int i, int l, int r){
    if(r<=x || y<=l) return Monoid::identity();
    else if(x<=l && r<=y) return vec[i];
    else return Monoid::op(aux(x,y,i*2+1,l,(l+r)/2), aux(x,y,i*2+2,(l+r)/2,r));
  };

public:
  SegmentTree(int n){
    size = 1;
    while(size < n) size *= 2;
    size = size*2-1;
    vec = vector<Monoid>(size, Monoid::identity());
  }

  inline void update(int i, const Monoid &x){
    int j = i+(size+1)/2-1;
    vec[j] = x;
    --j;
    while(j>=0){
      vec[j/2] = Monoid::op(vec[(j/2)*2+1], vec[(j/2)*2+2]);
      (j /= 2) -= 1;
    }
  }

  inline Monoid at(int i){
  	return vec[(size+1)/2 + i - 1];
  }

  inline Monoid get(int x, int y){ // [x,y)
    return aux(x,y,0,0,(size+1)/2);
  }
};



template <typename T> struct MinMonoid{
  T value;

  using M = MinMonoid;
  static T INF;
  constexpr inline static M identity(){return M({INF});}
  constexpr inline static M op(const M &a, const M &b){return M({min(a.value, b.value)});}

  MinMonoid(T value): value(value){}
};

template <typename T>
struct WithIndex{
  T value;
  int index;

  WithIndex(): value(T()), index(-1){}
  WithIndex(T value, int index): value(value), index(index){}

  friend bool operator<(const WithIndex &a, const WithIndex &b){
    return a.value < b.value;
  }
};

using Monoid = MinMonoid<WithIndex<int>>;
template<> WithIndex<int> Monoid::INF = WithIndex(INT_MAX, -1);

int main(){
  int N,Q; cin >> N >> Q;

  SegmentTree<Monoid> seg(N);

  REP(i,N){
    int a; cin >> a;
    seg.update(i, Monoid(WithIndex<int>(a, i)));
  }


  REP(i,Q){
    int c; cin >> c;
    int l,r; cin >> l >> r;
    --l, --r;

    if(c == 1){
      auto a = seg.at(l).value;
      auto b = seg.at(r).value;

      seg.update(l, Monoid(WithIndex<int>(b.value, l)));
      seg.update(r, Monoid(WithIndex<int>(a.value, r)));
    }else{
      auto ans = seg.get(l,r+1);
      cout << ans.value.index+1 << endl;
    }
  }
}