#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

template<typename T>
class SegTree {
  int n;
  vector<T> seg;
  
  // irrelevant value for query
  const T NIL = {1<<30, -1};
  
  // binary operator for query
  T binop(T a, T b) {
    return min(a, b);
  }
  
  void update(int k, int l, int r, int p, T x) {
    if (p < l || r <= p)
      return;
    if (r - l == 1)
      seg[k] = x;
    else {
      update(2*k+1, l, (l+r)/2, p, x);
      update(2*k+2, (l+r)/2, r, p, x);
      seg[k] = binop(seg[2*k+1], seg[2*k+2]);
    }
  }

  T query(int k, int l, int r, int a, int b) {
    if (b <= l || r <= a)
      return NIL;
    if (a <= l && r <= b)
      return seg[k];
    else {
      T ret = NIL;
      ret = binop(ret, query(2*k+1, l, (l+r)/2, a, b));
      ret = binop(ret, query(2*k+2, (l+r)/2, r, a, b));
      return ret;
    }
  }
public:
  SegTree(int n): n(n), seg(4*n) {}
  void init() {
    for (int i = 0; i < 4*n; i++)
      seg[i] = NIL;
  }
  // update p-th value to x
  void update(int p, T x) {
    update(0, 0, n, p, x);
  }
  // query for range [l, r)
  T query(int l, int r) {
    return query(0, 0, n, l, r);
  }
};

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, q;
  cin >> n >> q;
  SegTree<pair<int, int> > tree(n);
  
  REP (i, n) {
    int a;
    cin >> a;
    tree.update(i, {a, i});
  }

  while (q--) {
    int type, l, r;
    cin >> type >> l >> r;
    if (type == 1) {
      --l, --r;
      int lv = tree.query(l, l+1).first;
      int rv = tree.query(r, r+1).first;
      tree.update(l, {rv, l});
      tree.update(r, {lv, r});
    } else {
      cout << tree.query(--l, r).second + 1 << endl;
    }
  }
  
  return 0;
}