using System; using System.Collections.Generic; using System.Linq; using System.IO; using static System.Console; using static System.Convert; using static System.Math; //using static System.Globalization.CultureInfo; using System.Text; class Program { public static bool chmin(ref T num, T val) where T : IComparable { if (num.CompareTo(val) == 1) { num =val; return true; } return false; } public static bool chmax(ref T num, T val) where T : IComparable { if (num.CompareTo(val) == -1) { num = val; return true; } return false; } public static void swap(ref T v1, ref T v2) { var t = v2; v2 = v1; v1 = t; } static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); new Program().Solve(); Console.Out.Flush(); } void Solve() { int num, q; Input.Make(out num, out q); var seg = new SegmentTree>(num, new Pair(int.MaxValue, -1), (a, b) => a.v1 > b.v1 ? b : a); for (var i = 0; i < num; i++) seg[i] = new Pair(Input.Next(), i+1); seg.All_Update(); while(q-->0) { var inp = Input.ar; if (inp[0] == 1) { var t = seg[inp[1] - 1]; seg.Update(inp[1] - 1, new Pair(seg[inp[2] - 1].v1, inp[1])); seg.Update(inp[2] - 1, new Pair(t.v1, inp[2])); } else WriteLine(seg.Query(inp[1] - 1, inp[2]).v2); } } } public class LazySegmentTree : SegmentTree where T : IComparable { protected T e, min; protected T[] lazy; protected Func lazyFunc; protected Func lazyUpdateFunc; public LazySegmentTree(int num, T init, T e, Func func, Func updateFunc = null, Func lazyFunc = null, Func lazyUpdateFunc = null, T min = default(T)) : base(num, init, func, updateFunc) { this.e = e; this.min = min; if (min.CompareTo(default(T)) == 0) this.min = init; this.lazyFunc = lazyFunc ?? ((a, b) => b); this.lazyUpdateFunc = lazyUpdateFunc ?? ((a, b) => a); lazy = Enumerable.Repeat(0, 2 * this.num + 1).Select(_ => e).ToArray(); } protected void eval(int len, int k) { if (lazy[k].CompareTo(e) == 0) return; if (Right(k) < num * 2) { lazy[Left(k)] = lazyFunc(lazy[Left(k)], lazy[k]); lazy[Right(k)] = lazyFunc(lazy[Right(k)], lazy[k]); } item[k] = updateFunc(item[k], lazyUpdateFunc(lazy[k], len)); lazy[k] = e; } public override void Update(int left, int right, T value) => Update(left, right, 0, 0, num, value); protected override void Update(int left, int right, int k, int l, int r, T value) { eval(r - l, k); if (r <= left || right <= l) return; if (left <= l && r <= right) { lazy[k] = lazyFunc(lazy[k], value); eval(r - l, k); } else { Update(left, right, Left(k), l, (l + r) >> 1, value); Update(left, right, Right(k), (l + r) >> 1, r, value); item[k] = func(item[Left(k)], item[Right(k)]); } } public override T Query(int left, int right) => Query(left, right, 0, 0, num); protected override T Query(int left, int right, int k, int l, int r) { if (r <= left || right <= l) return min; eval(r - l, k); if (left <= l && r <= right) return item[k]; else return func(Query(left, right, Left(k), l, (l + r) >> 1), Query(left, right, Right(k), (l + r) >> 1, r)); } } public class SegmentTree { protected readonly T[] item; protected readonly int num; protected readonly Func func; protected readonly Func updateFunc; protected readonly T init; protected int Parent(int index) => (index - 1) >> 1; protected int Left(int index) => (index << 1) + 1; protected int Right(int index) => (index + 1) << 1; public T this[int i] { get { return item[i + num - 1]; } set { item[i + num - 1] = value; } } public SegmentTree(int num, T init, Func func, Func updateFunc = null) { this.func = func; this.num = 1; this.init = init; this.updateFunc = updateFunc ?? ((T val1, T val2) => val2); while (this.num <= num) this.num *= 2; item = new T[2 * this.num - 1]; for (var i = 0; i < 2 * this.num - 1; i++) item[i] = init; } public void Update(int index, T value) { index += num - 1; item[index] = updateFunc(item[index], value); while (index > 0) { index = Parent(index); item[index] = func(item[Left(index)], item[Right(index)]); } } public virtual void Update(int left, int right, T value) => Update(left, right, 0, 0, num, value); protected virtual void Update(int left, int right, int k, int l, int r, T value) { if (r <= left || right <= l) return; if (left <= l && r <= right) item[k] = updateFunc(item[k], value); else { Update(left, right, Left(k), l, (l + r) >> 1, value); Update(left, right, Right(k), (l + r) >> 1, r, value); } } public void All_Update() { for (int i = num - 2; i >= 0; i--) item[i] = func(item[Left(i)], item[Right(i)]); } public T Query(int index) { index += num - 1; var value = func(init, item[index]); while (index > 0) { index = Parent(index); value = func(value, item[index]); } return value; } //[left,right) public virtual T Query(int left, int right) => Query(left, right, 0, 0, num); protected virtual T Query(int left, int right, int k, int l, int r) { if (r <= left || right <= l) return init; if (left <= l && r <= right) return item[k]; else return func(Query(left, right, Left(k), l, (l + r) >> 1), Query(left, right, Right(k), (l + r) >> 1, r)); } } public class Input { public static string read => ReadLine().Trim(); public static int[] ar => read.Split(' ').Select(int.Parse).ToArray(); public static int num => ToInt32(read); public static long[] arL => read.Split(' ').Select(long.Parse).ToArray(); public static long numL => ToInt64(read); public static T[] create(int n, Func f) => Enumerable.Repeat(0, n).Select(f).ToArray(); public static char[][] grid(int h) => create(h, _ => read.ToCharArray()); public static int[] ar1D(int n) => create(n, _ => num); public static long[] arL1D(int n) => create(n, _ => numL); public static string[] strs(int n) => create(n, _ => read); public static int[][] ar2D(int n) => create(n, _ => ar); public static long[][] arL2D(int n) => create(n, _ => arL); public static List[] edge(int n) => create(n, _ => new List()); public static T GetValue(string g) { var t = typeof(T); if (t == typeof(int)) return (T)(object)int.Parse(g); if (t == typeof(long)) return (T)(object)long.Parse(g); if (t == typeof(string)) return (T)(object)g; if (t == typeof(char)) return (T)(object)char.Parse(g); if (t == typeof(double)) return (T)(object)double.Parse(g); if (t == typeof(bool)) return (T)(object)bool.Parse(g); return default(T); } public static void Make(out T1 v1, out T2 v2) { v1 = Next(); v2 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next(); } private static Queue sc; public static T Next() { sc = sc ?? new Queue(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return GetValue(sc.Dequeue()); } public static void Next(ref T val) => val = Next(); public const long Inf = (long)1e18; public const double eps = 1e-6; public const string Alfa = "abcdefghijklmnopqrstuvwxyz"; public const int MOD = 1000000007; } public class Pair : IComparable> { public T1 v1 { get; set; } public T2 v2 { get; set; } public Pair() { v1 = Input.Next(); v2 = Input.Next(); } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(Pair p) { var c = Comparer.Default.Compare(v1, p.v1); if (c == 0) c = Comparer.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public override bool Equals(object obj) => this == (Pair)obj; public override int GetHashCode() => v1.GetHashCode() ^ v2.GetHashCode(); public static bool operator ==(Pair p1, Pair p2) => p1.CompareTo(p2) == 0; public static bool operator !=(Pair p1, Pair p2) => p1.CompareTo(p2) != 0; public static bool operator >(Pair p1, Pair p2) => p1.CompareTo(p2) == 1; public static bool operator >=(Pair p1, Pair p2) => p1.CompareTo(p2) != -1; public static bool operator <(Pair p1, Pair p2) => p1.CompareTo(p2) == -1; public static bool operator <=(Pair p1, Pair p2) => p1.CompareTo(p2) != 1; } public class Pair : Pair, IComparable> { public T3 v3 { get; set; } public Pair() : base() { v3 = Input.Next(); } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } public int CompareTo(Pair p) { var c = base.CompareTo(p); if (c == 0) c = Comparer.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; }