#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 T, typename Func>
class SegmentTree{
protected:
  const int depth, size, hsize;
  const T e;
  const Func f;
  std::vector<T> data;

public:
  SegmentTree(int n, const T &e, const Func &f):
    depth(n > 1 ? 32-__builtin_clz(n-1) + 1 : 1),
    size((1 << depth) - 1),
    hsize(size / 2 + 1),
    e(e),
    f(f),
    data(size + 1, e)
  {}

  inline T operator[](int i) const {
    return at(i);
  }

  inline T at(int i) const {
  	return data[hsize + i];
  }

  inline T get(int x, int y) const { // [x,y)
    int l = x + hsize, r = y + hsize;
    T ret = e;

    // must be commutative
    while(l < r){
      if(r & 1) ret = f(ret, data[--r]);
      if(l & 1) ret = f(ret, data[l++]);
      l >>= 1, r >>= 1;
    }
    
    return ret;
  }

  inline void update(int i, const T &x){
    i += hsize;
    data[i] = x;
    while(i > 1){
      i >>= 1;
      data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
    }
  }

  inline void init(const T &val){
    data.assign(size + 1, e);
    for(int i = 0; i < hsize; ++i) data[hsize + i] = val;

    for(int i = hsize-1; i >= 1; --i){
      data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
    }
  }

  inline void init_with_vector(const std::vector<T> &val){
    data.assign(size + 1, e);
    for(int i = 0; i < (int)val.size(); ++i) data[hsize + i] = val[i];
    
    for(int i = hsize-1; i >= 1; --i){
      data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
    }
  }

  void debug(){
#ifdef DEBUG
    std::cerr << "{";
    for(int i = 0; i < hsize; ++i){
      if(i) std::cerr << ",";
      std::cerr << data[hsize + i];
    }
    std::cerr << "}" << std::endl;
#endif
  }
};



template <typename T, typename Func>
class SegmentTreeRangeArgmin : public SegmentTree<std::pair<T, int>, Func>{
  using super = SegmentTree<std::pair<T, int>, Func>;

public:
  SegmentTreeRangeArgmin(int n, const std::pair<T, int> &e, const Func &f): super(n, e, f){}

  inline void update(int i, const T &val){
    super::update(i, std::make_pair(val, i));
  }
};



template <typename T>
auto make_segment_tree_range_argmin(int size, const T &e){
  auto f =
    [](const auto &a, const auto &b){
      if(a.first == b.first){
        return std::make_pair(std::min(a.first, b.first), std::min(a.second, b.second));
      }else{
        return std::min(a, b);
      }
    };
  
  return SegmentTreeRangeArgmin<T, decltype(f)>(size, std::make_pair(e, INT_MAX), f);
}



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

  auto seg = make_segment_tree_range_argmin(N, INT_MAX);

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


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

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

      seg.update(l, b);
      seg.update(r, a);
    }else{
      auto ans = seg.get(l,r+1);
      cout << ans.second+1 << endl;
    }
  }
}