import Data.List
import Control.Monad
import Control.Applicative

data Segtree = Leaf Int
             | Node Segtree Int Segtree Int
               deriving (Show, Eq)

size (Leaf _) = 1
size (Node _ _ _ n) = n

point (Leaf x) = x
point (Node _ x _ _) = x

mkNode lch rch = Node lch rootPoint rch rootSize
    where rootPoint = point lch `min` point rch
          rootSize = size lch + size rch

update leaf@(Leaf x) k x'
    | k == 0 = Leaf x'
    | otherwise = leaf
update node@(Node lch _ rch _) k x'
    | k < size lch = mkNode (update lch k x') rch
    | otherwise = mkNode lch $ update rch (k - size lch) x'

minQuery (Leaf x) a b
    | a <= 0 && b > 0 = x
    | otherwise = 2 ^ 31 - 1
minQuery (Node lch x rch n) a b
    | a <= 0 && n <= b = x
    | b <= 0 || n <= a = 2 ^ 31 - 1
    | otherwise =
        minQuery lch a b `min` minQuery rch (a - size lch) (b - size lch)

buildSegtree n
    | n < 1 = error "Invalid size of Segtree"
    | n == 1 = Leaf $ 2 ^ 31 - 1
    | otherwise = mkNode (buildSegtree lSize) (buildSegtree (n - lSize))
        where lSize = n `div` 2

processQuery n = foldl' process ([], buildSegtree n)
    where process (out, root) [0, x, y] = (out, update root x y)
          process (out, root) [1, x, y] = (minQuery root x (y + 1) : out, root)

splitRead = map read . words <$> getLine

main = do
    [n, q] <- splitRead
    qs <- replicateM q splitRead
    let (result, _) = processQuery n qs
    mapM_ print $ reverse result