import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.15f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

struct SegTree
{
	long delegate(long, long) f;
	long[] data;
	long init;
    this(in long[] _data, long delegate(long, long) _f, long _init)
    {
		f = _f; init = _init;
		size_t n = 1; while (n < _data.length) n *= 2; data.length = n*2-1;
		foreach (i; 0.._data.length) data[i+n-1] = _data[i];
		foreach (i; _data.length..n) data[i+n-1] = _init;
		foreach_reverse (i; 0..n-1) data[i] = f(data[i*2+1], data[i*2+2]);
	}
    long query(size_t l, size_t r) const
	{
        size_t n = (data.length+1) / 2; long res = init; l += n-1; r += n-1;
        while (l < r)
		{
            if ((l & 1) == 0) res = f(res, data[l]);
            if ((r & 1) == 0) res = f(res, data[r-1]);
            l = l >> 1; r = (r-1) >> 1;
        }
        return res;
    }
	void update(size_t i, long v)
	{
		i += (data.length+1) / 2 - 1; data[i] = v;
		while (i != 0) { i >>= 1; data[i] = f(data[i*2+1], data[i*2+2]); }
    }
}

void main()
{
	auto N = RD;
	auto Q = RD;
	auto a = RDA;

	a ~= long.max;
	auto pos = MIN_POS!("a > b")(a);
	auto b = new long[](N+1);
	foreach (i; 0..b.length) b[i] = i;
	auto st = SegTree(b, (long x, long y) => a[x] < a[y] ? x : y, N);

	long[] ans;
	foreach (i; 0..Q)
	{
		auto x = RD;
		auto l = RD-1;
		auto r = RD-1;
		if (x == 1)
		{
			swap(a[l], a[r]);
			st.update(l, l);
			st.update(r, r);
		}
		else
		{
			ans ~= st.query(l, r+1);
		}
		debug writeln(st.data);
	}

	foreach (e; ans)
		writeln(e+1);
	stdout.flush();
	debug readln();
}