#include <iostream>
#include <vector>
#include <functional>
using namespace std;


template <typename T>
struct SegmentTree{
private:
  using F = function<T(T,T)>;
  int n;
  F f;
  T ti;
  vector<T> dat;
public:
  SegmentTree(){};
  SegmentTree(F f,T ti) : f(f),ti(ti) {}
  void build(int n_){
    n = n_;
    dat.assign(2*n,ti);
  }
  void build(const vector<T> &v){
    int n_ = v.size();
    build(n_);
    for(int i = 0; i < n; ++i) dat[n+i]=v[i];
    for(int i = n-1; i >= 0; --i)
      dat[i]=f(dat[2*i+0],dat[2*i+1]);
  }
  void set_val(int k,T x){
    dat[k+=n] = x;
    while(k > 0){
      k = k/2;
      dat[k]=f(dat[2*k+0],dat[2*k+1]);
    }
  }
  T query(int a,int b){
    T vl = ti, vr = ti;
    for(int l = a+n, r = b+n; l < r; l >>= 1, r >>= 1){
      if(l&1) vl = f(vl,dat[l++]);
      if(r&1) vr = f(dat[--r],vr);
    }
    return f(vl,vr);
  }
};

int main(){
  int N, Q;
  cin >> N >> Q;
  vector<pair<int,int>> A(N);
  for(int i = 0; i < N; ++i) cin >> A[i].first, A[i].second = i+1;
  int INF = 1e9;
  using T = pair<int,int>;
  T ti(INF,-1);
  function<T(T,T)> f = [](T a, T b){return min(a,b);};
  
  SegmentTree<T> st(f,ti);
  st.build(A);
  while(Q--){
    int t, l, r;
    cin >> t >> l >> r;
    if(t == 1){
      T vl = st.query(l-1,l), vr = st.query(r-1,r);
      swap(vl.first,vr.first);
      st.set_val(l-1,vl);
      st.set_val(r-1,vr);
    }else{
      cout << st.query(l-1,r).second << endl;
    }
  }
}