#include <bits/stdc++.h>

using namespace std;

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

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

  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  REP (i, n) cin >> a[i];
  vector<int> bucket(333, -1);

  REP (i, n) {
    int j = i/333;
    if (bucket[j] == -1 || a[bucket[j]] > a[i])
      bucket[j] = i;
  }
  
  while (q--) {
    int type, l, r;
    cin >> type >> l >> r;
    if (type == 1) {
      --l, --r;
      swap(a[l], a[r]);
      for (int x : { l, r }) {
        int j = x/333;
        for (int i = j * 333; i < (j + 1) * 333; i++) {
          if (a[i] < a[bucket[j]])
            bucket[j] = i;
        }
      }
    } else {
      --l;
      int p = -1;
      while (l < r && l % 333) {
        if (p == -1 || a[l] < a[p]) p = l;
        ++l;
      }
      while (l + 333 <= r) {
        if (p == -1 || a[bucket[l/333]] < a[p]) p = bucket[l/333];
        l += 333;
      }
      while (l < r) {
        if (p == -1 || a[l] < a[p]) p = l;
        ++l;
      }
      cout << p+1 << endl;
    }
  }
  
  return 0;
}