#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define ln '\n'
const long long MOD = 1000000007LL;
//const long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull; 
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
///////////////////////////////////////////////////////////////////////////////////////////////////

template<typename T, typename Monoid>
struct SegmentTree {
    T unity;
    Monoid merge;
    int N;
    vector<T> node;

    SegmentTree(Monoid f, T id) : merge(f), unity(id) {}

    void init(int sz) {
        N = 1;
        while (N < sz) N *= 2;
        node.assign(2*N,unity);
    }

    void set(int k, const T &val) {node[k+N] = val;}

    void build() {
        for (int i = N-1; i > 0; --i) {
            node[i] = merge(node[i<<1|0], node[i<<1|1]);
        }
    }

    // (0-indexed)
    void update(int x, T val) {
        x += N;
        node[x] = val;
        while (x > 1) {
            x >>= 1;
            node[x] = merge(node[x<<1|0], node[x<<1|1]);
        }
    }

    // [l, r) (0-indexed)
    T get(int l, int r) {
        if (l >= r) return unity;
        T resl = unity, resr = unity;
        l += N; r += N;
        while (l < r) {
            if (l & 1) resl = merge(resl, node[l++]);
            l >>= 1;
            if (r & 1) resr = merge(node[--r], resr);
            r >>= 1;
        }
        return merge(resl, resr);
    }

    T operator[](int x) {return node[x+N];}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
	int N,Q; cin >> N >> Q;
	vector<int> A(N);
	rep(i,N) cin >> A[i];
	
	auto f=[] (pii a, pii b) {return min(a,b);};
	const pii id = pii(1e9,0);
	SegmentTree<pii, decltype(f)> seg(f,id);
	seg.init(N);
	rep(i,N) seg.set(i,pii(A[i],i+1));
	seg.build();

	while (Q--) {
		int com,l,r; cin >> com >> l >> r;
		if (com==1) {
			--l; --r;
			pii L = seg[l];
			seg.update(l,pii(seg[r].first, l+1));
			seg.update(r,pii(L.first, r+1));
		} else {
			--l;
			cout << seg.get(l,r).second << ln;
		}
	}
}