import math





class SegmentTree:

    __slots__ = ["elem_size", "tree_size", "tree"]



    def __init__(self, a: list, default: int):

        real_size = len(a)

        self.elem_size = 1 << math.ceil(math.log2(real_size))

        self.tree_size = 2 * self.elem_size

        self.tree = [default]*self.elem_size + a + [default]*(self.elem_size - real_size)

        self.init_tree()



    def init_tree(self):

        tree = self.tree

        for i in range(self.elem_size-1, 0, -1):

            left, right = tree[i << 1], tree[(i << 1)+1]

            # ===== ??????????????´???????????? =====

            tree[i] = left if left < right else right



    def get_range_indexes(self, x: int, y: int):

        '''[x, y), tree[k], [l_end, r_end)'''

        l, r = x+self.elem_size, y+self.elem_size

        indexes = []

        append = indexes.append

        while l < r:

            if l & 1:

                append(l)

                l += 1

            if r & 1:

                r -= 1

                append(r)

            l, r = l >> 1, r >> 1



        return indexes



    def get_value(self, x: int, y: int):

        tree = self.tree

        index_list = self.get_range_indexes(x, y)



        # ===== ??????????????´???????????? =====

        return min(tree[n] for n in index_list)



    def update_tree(self, k: int):

        tree = self.tree



        while k > 1:

            k >>= 1

            left, right = tree[k << 1], tree[(k << 1)+1]

            # ===== ??????????????´???????????? =====

            tree[k] = left if left < right else right



    def set_value(self, i: int, value: int, op: str):

        k = self.elem_size + i

        if op == "=":

            self.tree[k] = value

        elif op == "+":

            self.tree[k] += value

        self.update_tree(k)





n, q = list(map(int, input().split()))

rmq = SegmentTree([2**31-1]*n, 2**31-1)

ans = []

for _ in [0]*q:

    c, x, y = list(map(int, input().split()))

    if c == 0:

        rmq.set_value(x, y, "=")

    else:

        ans.append(rmq.get_value(x, y+1))

print(("\n".join([str(n) for n in ans])))
import math

class SegmentTree:

    __slots__ = ["elem_size", "tree_size", "tree", "default"]



    def __init__(self, a: list, default: int):

        real_size = len(a)

        self.elem_size = 1 << math.ceil(math.log2(real_size))

        self.tree_size = 2 * self.elem_size

        self.tree = [default] * self.elem_size + a + [default] * (self.elem_size - real_size)

        self.default = default

        self.init_tree()



    def init_tree(self) -> None:

        tree = self.tree

        for i in range(self.elem_size - 1, 0, -1):

            left, right = tree[i << 1], tree[(i << 1) + 1]

            # ===== change me =====

            tree[i] = left if left < right else right



    def get_value(self, x: int, y: int):

        l, r = x + self.elem_size, y + self.elem_size

        tree, result = self.tree, self.default

        while l < r:

            if l & 1:

                # ===== change me =====

                result = tree[l] if tree[l] < result else result

                l += 1

            if r & 1:

                r -= 1

                # ===== change me =====

                result = tree[r] if tree[r] < result else result

            l, r = l >> 1, r >> 1



        return result



    def set_value(self, i: int, value: int, op: str = "="):

        tree = self.tree

        k = self.elem_size + i

        if op == "=":

            tree[k] = value

        elif op == "+":

            tree[k] += value

        elif op == "?":

            # ===== change me =====

            tree[k] = value if value < tree[k] else tree[k]



        while k > 1:

            k >>= 1

            left, right = tree[k << 1], tree[(k << 1) + 1]

            # ===== change me =====

            tree[k] = left if left < right else right



import sys

n, q = map(int, input().split())

tree = SegmentTree([2**31-1]*n, 2**31-1)

ans = []

append = ans.append

for com, x, y in (map(int, l.split()) for l in sys.stdin.readlines()):

    if com == 0:

        tree.set_value(x, y)

    else:

        append(tree.get_value(x, y+1))

print(*ans, sep="\n")

import math


class SegmentTree:
    __slots__ = ["elem_size", "tree_size", "tree"]

    def __init__(self, a: list, default: int):
        real_size = len(a)
        self.elem_size = 1 << math.ceil(math.log2(real_size))
        self.tree_size = 2 * self.elem_size
        self.tree = (
            [default] * self.elem_size + a + [default] * (self.elem_size - real_size)
        )
        self.init_tree()

    def init_tree(self):
        tree = self.tree
        for i in range(self.elem_size - 1, 0, -1):
            left, right = tree[i << 1], tree[(i << 1) + 1]
            # ===== ??????????????´???????????? =====
            tree[i] = left if left < right else right

    def get_range_indexes(self, x: int, y: int):
        """[x, y), tree[k], [l_end, r_end)"""
        l, r = x + self.elem_size, y + self.elem_size
        indexes = []
        append = indexes.append
        while l < r:
            if l & 1:
                append(l)
                l += 1
            if r & 1:
                r -= 1
                append(r)
            l, r = l >> 1, r >> 1
        return indexes

    def get_value(self, x: int, y: int):
        tree = self.tree
        index_list = self.get_range_indexes(x, y)
        # ===== ??????????????´???????????? =====
        return min(tree[n] for n in index_list)

    def update_tree(self, k: int):
        tree = self.tree
        while k > 1:
            k >>= 1
            left, right = tree[k << 1], tree[(k << 1) + 1]
            # ===== ??????????????´???????????? =====
            tree[k] = left if left < right else right

    def set_value(self, i: int, value: int, op: str):
        k = self.elem_size + i
        if op == "=":
            self.tree[k] = value
        elif op == "+":
            self.tree[k] += value
        self.update_tree(k)


n, q = list(map(int, input().split()))
rmq = SegmentTree([2**31 - 1] * n, 2**31 - 1)
ans = []
for _ in [0] * q:
    c, x, y = list(map(int, input().split()))
    if c == 0:
        rmq.set_value(x, y, "=")
    else:
        ans.append(rmq.get_value(x, y + 1))
print(("\n".join([str(n) for n in ans])))

import math


class SegmentTree:
    __slots__ = ["elem_size", "tree_size", "tree", "default"]

    def __init__(self, a: list, default: int):
        real_size = len(a)
        self.elem_size = 1 << math.ceil(math.log2(real_size))
        self.tree_size = 2 * self.elem_size
        self.tree = (
            [default] * self.elem_size + a + [default] * (self.elem_size - real_size)
        )
        self.default = default
        self.init_tree()

    def init_tree(self) -> None:
        tree = self.tree
        for i in range(self.elem_size - 1, 0, -1):
            left, right = tree[i << 1], tree[(i << 1) + 1]
            # ===== change me =====
            tree[i] = left if left < right else right

    def get_value(self, x: int, y: int):
        l, r = x + self.elem_size, y + self.elem_size
        tree, result = self.tree, self.default
        while l < r:
            if l & 1:
                # ===== change me =====
                result = tree[l] if tree[l] < result else result
                l += 1
            if r & 1:
                r -= 1
                # ===== change me =====
                result = tree[r] if tree[r] < result else result
            l, r = l >> 1, r >> 1
        return result

    def set_value(self, i: int, value: int, op: str = "="):
        tree = self.tree
        k = self.elem_size + i
        if op == "=":
            tree[k] = value
        elif op == "+":
            tree[k] += value
        elif op == "?":
            # ===== change me =====
            tree[k] = value if value < tree[k] else tree[k]
        while k > 1:
            k >>= 1
            left, right = tree[k << 1], tree[(k << 1) + 1]
            # ===== change me =====
            tree[k] = left if left < right else right


import sys

n, q = map(int, input().split())
tree = SegmentTree([2**31 - 1] * n, 2**31 - 1)
ans = []
append = ans.append
for com, x, y in (map(int, l.split()) for l in sys.stdin.readlines()):
    if com == 0:
        tree.set_value(x, y)
    else:
        append(tree.get_value(x, y + 1))
print(*ans, sep="\n")

-    __slots__ = ["elem_size", "tree_size", "tree"] +    __slots__ = ["elem_size", "tree_size", "tree", "default"] +        self.default = default -    def init_tree(self): +    def init_tree(self) -> None: -            # ===== ??????????????´???????????? ===== +            # ===== change me ===== -    def get_range_indexes(self, x: int, y: int): -        """[x, y), tree[k], [l_end, r_end)""" +    def get_value(self, x: int, y: int): -        indexes = [] -        append = indexes.append +        tree, result = self.tree, self.default -                append(l) +                # ===== change me ===== +                result = tree[l] if tree[l] < result else result -                append(r) +                # ===== change me ===== +                result = tree[r] if tree[r] < result else result -        return indexes +        return result -    def get_value(self, x: int, y: int): +    def set_value(self, i: int, value: int, op: str = "="): -        index_list = self.get_range_indexes(x, y) -        # ===== ??????????????´???????????? ===== -        return min(tree[n] for n in index_list) - -    def update_tree(self, k: int): -        tree = self.tree +        k = self.elem_size + i +        if op == "=": +            tree[k] = value +        elif op == "+": +            tree[k] += value +        elif op == "?": +            # ===== change me ===== +            tree[k] = value if value < tree[k] else tree[k] -            # ===== ??????????????´???????????? ===== +            # ===== change me ===== -    def set_value(self, i: int, value: int, op: str): -        k = self.elem_size + i -        if op == "=": -            self.tree[k] = value -        elif op == "+": -            self.tree[k] += value -        self.update_tree(k) +import sys -n, q = list(map(int, input().split())) -rmq = SegmentTree([2**31 - 1] * n, 2**31 - 1) +n, q = map(int, input().split()) +tree = SegmentTree([2**31 - 1] * n, 2**31 - 1) -for _ in [0] * q: -    c, x, y = list(map(int, input().split())) -    if c == 0: -        rmq.set_value(x, y, "=") +append = ans.append +for com, x, y in (map(int, l.split()) for l in sys.stdin.readlines()): +    if com == 0: +        tree.set_value(x, y) -        ans.append(rmq.get_value(x, y + 1)) -print(("\n".join([str(n) for n in ans]))) +        append(tree.get_value(x, y + 1)) +print(*ans, sep="\n")