{-# LANGUAGE DataKinds #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE BangPatterns#-}
{-# OPTIONS_GHC -O2 #-}

import GHC.TypeLits

import Data.Int
import Data.Proxy
import qualified Data.Map.Lazy as Map
import Data.List
import Data.Bits
import Data.Maybe
import qualified Data.ByteString.Char8 as BS
import qualified Data.Vector as V
import qualified Data.Vector.Mutable as VM
import qualified Data.Vector.Unboxed as VU
import qualified Data.Vector.Unboxed.Mutable as VUM
import qualified Data.Array.IArray as Array
import Data.Array.MArray
import Data.Array.ST
import Data.Monoid
import Data.Semigroup

import Control.Applicative
import Control.Monad
import Control.Monad.ST
--import Control.Monad.Primitive
import Control.Monad.State

import Debug.Trace


getInts :: IO [Int]
getInts = map (fst . fromJust . BS.readInt) . BS.words <$> BS.getLine

main :: IO ()
main = do
  [n,q] <- getInts
  a <- getInts
  q <- replicateM q $ getInts

  let f = runST $ do
        seg <- newSegmentTree n :: ST s (SegmentTree s (Min (Int, Int)))
    
        forM_ (zip [0..] a) $ \(i, x) -> updateSegmentTree seg i (Min (x, i))

        forM q $ \[i, l, r] -> do
          if
            | i == 1 -> do
                (Min (x, _)) <- getSegmentTree seg (l-1) l
                (Min (y, _)) <- getSegmentTree seg (r-1) r

                updateSegmentTree seg (l-1) (Min (y, l-1))
                updateSegmentTree seg (r-1) (Min (x, r-1))

                return Nothing
            | i == 2 -> return . Just =<< getSegmentTree seg (l-1) r
          

  mapM_ print $ map ((+1) . snd . getMin) . catMaybes $ f

  return ()



data SegmentTree s m = SegmentTree {segmentTree :: VM.MVector s m}

newSegmentTree :: Monoid m => Int -> ST s (SegmentTree s m)
newSegmentTree n = return . SegmentTree =<< VM.replicate (2 * size) mempty
  where
    size = head [m | i <- [0..], let m = 2 ^ i, m >= n]

updateSegmentTree :: Monoid m => SegmentTree s m -> Int -> m -> ST s ()
updateSegmentTree seg i val = do
  VM.write s (n + i) val
  aux $ (n + i) `div` 2

  where
    s = segmentTree seg
    n = (VM.length s) `div` 2

    aux i = do
      when (i >= 1) $ do
        VM.read s (i * 2 + 0) >>= \a -> do
          VM.read s (i * 2 + 1) >>= \b -> do
            VM.write s i (a <> b) >> aux (i `div` 2)


getSegmentTree :: Monoid m => SegmentTree s m -> Int -> Int -> ST s m
getSegmentTree seg x y = do
  aux 1 0 n
  where
    s = segmentTree seg
    n = (VM.length s) `div` 2

    aux i l r
      | r <= x || y <= l = return mempty
      | x <= l && r <= y = VM.read s i
      | otherwise =
        aux (i * 2 + 0) l ((l + r) `div` 2) >>= \a -> do
          aux (i * 2 + 1) ((l + r) `div` 2) r >>= \b -> do
            return $ a <> b