//  ____            _                  _                       _       _
// |  _ \ _   _ ___| |_    ___ _ __   | |_ ___ _ __ ___  _ __ | | __ _| |_ ___
// | |_) | | | / __| __|  / __| '_ \  | __/ _ \ '_ ` _ \| '_ \| |/ _` | __/ _ \
// |  _ <| |_| \__ \ |_  | (__| |_) | | ||  __/ | | | | | |_) | | (_| | ||  __/
// |_| \_\\__,_|___/\__|  \___| .__/___\__\___|_| |_| |_| .__/|_|\__,_|\__\___|
//                            |_| |_____|               |_|

//https://github.com/manta1130/Competitive_Programming_Template_Rust

#[macro_use]
mod input {

    use std;
    use std::io;

    const SPLIT_DELIMITER: char = ' ';

    #[macro_export]
    #[allow(unused_macros)]
    macro_rules! input {
    ( $($x:expr ),*) => {
        {
            let temp_str = input_line_str();
            let mut split_result_iter = temp_str.split_whitespace();
                $(
                let buf_split_result = split_result_iter.next();
                let buf_split_result = buf_split_result.unwrap();
                    ($x) = buf_split_result.parse().unwrap();
                )*
        }
    };
}

    #[allow(dead_code)]
    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn p<T>(t: T)
    where
        T: std::fmt::Display,
    {
        println!("{}", t);
    }

    #[allow(dead_code)]
    pub fn input_vector2d<T>(line: usize) -> Vec<Vec<T>>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<Vec<T>> = Vec::new();

        for _ in 0..line {
            let vec_line = input_vector();
            v.push(vec_line);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}

use input::*;

fn getmin(l: usize, r: usize, a: &Vec<usize>, b: &Vec<(usize, usize)>, s: usize) -> usize {
    let mut i = l;
    let mut res = 999999_usize;
    while i < r {
        if i % s == 0 && i + s < r {
            if res == 999999 || a[res] > b[i / s].1 {
                res = b[i / s].0;
            }
            i += s;
        } else {
            if res == 999999 || a[res] > a[i] {
                res = i;
            }
            i += 1;
        }
    }
    res
}

fn main() {
    let (n, q): (usize, usize);
    input!(n, q);
    let mut a = input_vector::<usize>();
    let s = (n as f64).sqrt() as usize;
    let mut b = vec![(999999, 999999999_usize); n];
    for i in 0..n {
        if b[i / s].1 > a[i] {
            b[i / s] = (i, a[i]);
        }
    }

    for _ in 0..q {
        let (k, l, r): (usize, usize, usize);
        input!(k, l, r);
        let bufl = a[l - 1];
        let bufr = a[r - 1];
        if k == 1 {
            a[l - 1] = bufr;
            a[r - 1] = bufl;

            let buf = (l - 1) / s;
            if b[buf].0 == l - 1 || b[buf].1 > a[l - 1] {
                b[buf] = (999999, 999999);
                for i in buf * s..std::cmp::min((buf + 1) * s, n) {
                    if b[buf].0 == 999999 || b[buf].1 > a[i] {
                        b[buf] = (i, a[i]);
                    }
                }
            }

            let buf = (r - 1) / s;
            if b[buf].0 == r - 1 || b[buf].1 > a[r - 1] {
                b[buf] = (999999, 999999);
                for i in buf * s..std::cmp::min((buf + 1) * s, n) {
                    if b[buf].0 == 999999 || b[buf].1 > a[i] {
                        b[buf] = (i, a[i]);
                    }
                }
            }
        } else {
            p(getmin(l - 1, r, &a, &b, s) + 1);
        }
        //println!("{:?}",&a);
        //println!("{:?}",&b);
    }
}