#include <bits/stdc++.h>
using namespace std;

#define int long long

template <typename T>
struct SegmentTree{
  using F = function<T(T,T)>;
  int n;
  F f;
  T ti;
  vector<T> dat;
  SegmentTree(){};
  SegmentTree(F f,T ti):f(f),ti(ti){}
  void init(int n_){
    n=1;
    while(n<n_) n<<=1;
    dat.assign(n<<1,ti);
  }
  void build(const vector<T> &v){
    int n_=v.size();
    init(n_);
    for(int i=0;i<n_;i++) dat[n+i]=v[i];
    for(int i=n-1;i;i--)
      dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
  }
  void set_val(int k,T x){
    dat[k+=n]=x;
    while(k>>=1)
      dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|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);
  }
  template<typename C>
  int find(int st,C &check,T &acc,int k,int l,int r){
    if(l+1==r){
      acc=f(acc,dat[k]);
      return check(acc)?k-n:-1;
    }
    int m=(l+r)>>1;
    if(m<=st) return find(st,check,acc,(k<<1)|1,m,r);
    if(st<=l&&!check(f(acc,dat[k]))){
      acc=f(acc,dat[k]);
      return -1;
    }
    int vl=find(st,check,acc,(k<<1)|0,l,m);
    if(~vl) return vl;
    return find(st,check,acc,(k<<1)|1,m,r);
  }
  template<typename C>
  int find(int st,C &check){
    T acc=ti;
    return find(st,check,acc,1,0,n);
  }
};

signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  int N, Q;
  cin >> N >> Q;

  using P = pair<int, int>;
  int INF = 1e9;  
  auto f=[](P a, P b){return min(a,b);};
  SegmentTree<P> rmq(f, P(INF, INF));  
  rmq.init(N);

  vector<P> v;  
  for ( int i = 0; i < N; i++ ) {
    int a;
    cin >> a;
    v.emplace_back(P(a, i+1));    
  }

  rmq.build(v);

  for ( int i = 0; i < Q; i++ ) {
    int q, l, r;
    cin >> q >> l >> r;
    l--; r--;    
    if ( q == 1 ) {
      P a = rmq.query(l, l+1);    
      P b = rmq.query(r, r+1);      
      rmq.set_val(l, P(b.first, a.second));
      rmq.set_val(r, P(a.first, b.second));
    } else {
      cout << rmq.query(l, r+1).second << endl;      
    }
  }
  
  return 0;
}