use std::collections::{HashMap, HashSet};

fn main() {
    proconio::input! {
        n: usize,
        q: usize,
        mut a: [u64; n],
        queries: [(u64, usize, usize); q],
    }
    for (q, l, r) in queries {
        if q == 1 {
            let l = l - 1;
            let r = r - 1;
            a.swap(l, r);
        } else if q == 2 {
            let l = l - 1;
            let r = r - 1;
            let mut min_index = a[l..=r]
                .iter()
                .enumerate()
                .min_by_key(|(_, &a)| a)
                .unwrap()
                .0;
            println!("{}", l + min_index + 1);
        }
    }
}