# https://atcoder.jp/contests/abc014/submissions/3935971

class SegmentTree(object):

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



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

        from math import ceil, log

        real_size = len(a)

        self.elem_size = elem_size = 1 << ceil(log(real_size, 2))

        self.tree = tree = [default] * (elem_size * 2)

        tree[elem_size:elem_size + real_size] = a

        self.default = default

        self.op = op



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

            tree[i] = op(tree[i << 1], tree[(i << 1) + 1])



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

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

        tree, result, op = self.tree, self.default, self.op

        while l < r:

            if l & 1:

                result = op(tree[l], result)

                l += 1

            if r & 1:

                r -= 1

                result = op(tree[r], result)

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



        return result



    def set_value(self, i: int, value: int) -> None:

        k = self.elem_size + i

        self.tree[k] = value

        self.update(k)



    def update(self, i: int) -> None:

        op, tree = self.op, self.tree

        while i > 1:

            i >>= 1

            tree[i] = op(tree[i << 1], tree[(i << 1) + 1])



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

seg = SegmentTree([(1<<31)-1]*n, (1<<31)-1, min)

for _ in range(q):

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

    if c == 0:

        seg.set_value(x, y)

    else:

        print((seg.get_value(x, y+1)))



class Rmq:

    # 平方分割

    # 値を変更すると元のリストの値も書き換わる

    # 検証: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3990652#1

    def __init__(self, a, sqrt_n=150, inf=(1<<31)-1):

        self.sqrt_n = sqrt_n

        if hasattr(a, "__iter__"):

            from itertools import zip_longest

            self.n = len(a)

            self.layer0 = [min(values) for values in zip_longest(*[iter(a)]*sqrt_n, fillvalue=inf)]

            self.layer1 = a

        elif isinstance(a, int):

            self.n = a

            self.layer0 = [inf] * ((a - 1) // sqrt_n + 1)

            self.layer1 = [inf] * a

        else:

            raise TypeError



    def get_min(self, l, r):

        sqrt_n = self.sqrt_n

        parent_l, parent_r = l//sqrt_n+1, (r-1)//sqrt_n

        if parent_l < parent_r:

            return min(min(self.layer0[parent_l:parent_r]),

                       min(self.layer1[l:parent_l*sqrt_n]),

                       min(self.layer1[parent_r*sqrt_n:r]))

        else:

            return min(self.layer1[l:r])



    def set_value(self, idx, val):

        self.layer1[idx] = val

        idx0 = idx // self.sqrt_n

        idx1 = idx0 * self.sqrt_n

        self.layer0[idx0] = min(self.layer1[idx1:idx1+self.sqrt_n])



    def chmin(self, idx, val):

        if self.layer1[idx] > val:

            self.layer1[idx] = val

            idx //= self.sqrt_n

            self.layer0[idx] = min(self.layer0[idx], val)



    def debug(self):

        print(("layer0=", self.layer0))

        print(("layer1=", self.layer1))



    def __getitem__(self, item):

        return self.layer1[item]



    def __setitem__(self, key, value):

        self.set_value(key, value)





def main():

    N, Q, *queries = list(map(int, open(0).read().split()))

    seg = Rmq(N)

    Ans = []

    for com, x, y in zip(*[iter(queries)]*3):

        if com==0:

            seg.set_value(x, y)

        else:

            Ans.append(seg.get_min(x, y+1))

    print(("\n".join(map(str, Ans))))





main()



# https://atcoder.jp/contests/abc014/submissions/3935971
class SegmentTree(object):
    __slots__ = ["elem_size", "tree", "default", "op"]

    def __init__(self, a: list, default: int, op):
        from math import ceil, log

        real_size = len(a)
        self.elem_size = elem_size = 1 << ceil(log(real_size, 2))
        self.tree = tree = [default] * (elem_size * 2)
        tree[elem_size : elem_size + real_size] = a
        self.default = default
        self.op = op
        for i in range(elem_size - 1, 0, -1):
            tree[i] = op(tree[i << 1], tree[(i << 1) + 1])

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

    def set_value(self, i: int, value: int) -> None:
        k = self.elem_size + i
        self.tree[k] = value
        self.update(k)

    def update(self, i: int) -> None:
        op, tree = self.op, self.tree
        while i > 1:
            i >>= 1
            tree[i] = op(tree[i << 1], tree[(i << 1) + 1])


n, q = list(map(int, input().split()))
seg = SegmentTree([(1 << 31) - 1] * n, (1 << 31) - 1, min)
for _ in range(q):
    c, x, y = list(map(int, input().split()))
    if c == 0:
        seg.set_value(x, y)
    else:
        print((seg.get_value(x, y + 1)))

class Rmq:
    # 平方分割
    # 値を変更すると元のリストの値も書き換わる
    # 検証: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3990652#1
    def __init__(self, a, sqrt_n=150, inf=(1 << 31) - 1):
        self.sqrt_n = sqrt_n
        if hasattr(a, "__iter__"):
            from itertools import zip_longest

            self.n = len(a)
            self.layer0 = [
                min(values)
                for values in zip_longest(*[iter(a)] * sqrt_n, fillvalue=inf)
            ]
            self.layer1 = a
        elif isinstance(a, int):
            self.n = a
            self.layer0 = [inf] * ((a - 1) // sqrt_n + 1)
            self.layer1 = [inf] * a
        else:
            raise TypeError

    def get_min(self, l, r):
        sqrt_n = self.sqrt_n
        parent_l, parent_r = l // sqrt_n + 1, (r - 1) // sqrt_n
        if parent_l < parent_r:
            return min(
                min(self.layer0[parent_l:parent_r]),
                min(self.layer1[l : parent_l * sqrt_n]),
                min(self.layer1[parent_r * sqrt_n : r]),
            )
        else:
            return min(self.layer1[l:r])

    def set_value(self, idx, val):
        self.layer1[idx] = val
        idx0 = idx // self.sqrt_n
        idx1 = idx0 * self.sqrt_n
        self.layer0[idx0] = min(self.layer1[idx1 : idx1 + self.sqrt_n])

    def chmin(self, idx, val):
        if self.layer1[idx] > val:
            self.layer1[idx] = val
            idx //= self.sqrt_n
            self.layer0[idx] = min(self.layer0[idx], val)

    def debug(self):
        print(("layer0=", self.layer0))
        print(("layer1=", self.layer1))

    def __getitem__(self, item):
        return self.layer1[item]

    def __setitem__(self, key, value):
        self.set_value(key, value)


def main():
    N, Q, *queries = list(map(int, open(0).read().split()))
    seg = Rmq(N)
    Ans = []
    for com, x, y in zip(*[iter(queries)] * 3):
        if com == 0:
            seg.set_value(x, y)
        else:
            Ans.append(seg.get_min(x, y + 1))
    print(("\n".join(map(str, Ans))))


main()

-# https://atcoder.jp/contests/abc014/submissions/3935971 -class SegmentTree(object): -    __slots__ = ["elem_size", "tree", "default", "op"] +class Rmq: +    # 平方分割 +    # 値を変更すると元のリストの値も書き換わる +    # 検証: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3990652#1 +    def __init__(self, a, sqrt_n=150, inf=(1 << 31) - 1): +        self.sqrt_n = sqrt_n +        if hasattr(a, "__iter__"): +            from itertools import zip_longest -    def __init__(self, a: list, default: int, op): -        from math import ceil, log +            self.n = len(a) +            self.layer0 = [ +                min(values) +                for values in zip_longest(*[iter(a)] * sqrt_n, fillvalue=inf) +            ] +            self.layer1 = a +        elif isinstance(a, int): +            self.n = a +            self.layer0 = [inf] * ((a - 1) // sqrt_n + 1) +            self.layer1 = [inf] * a +        else: +            raise TypeError -        real_size = len(a) -        self.elem_size = elem_size = 1 << ceil(log(real_size, 2)) -        self.tree = tree = [default] * (elem_size * 2) -        tree[elem_size : elem_size + real_size] = a -        self.default = default -        self.op = op -        for i in range(elem_size - 1, 0, -1): -            tree[i] = op(tree[i << 1], tree[(i << 1) + 1]) +    def get_min(self, l, r): +        sqrt_n = self.sqrt_n +        parent_l, parent_r = l // sqrt_n + 1, (r - 1) // sqrt_n +        if parent_l < parent_r: +            return min( +                min(self.layer0[parent_l:parent_r]), +                min(self.layer1[l : parent_l * sqrt_n]), +                min(self.layer1[parent_r * sqrt_n : r]), +            ) +        else: +            return min(self.layer1[l:r]) -    def get_value(self, x: int, y: int) -> int: -        l, r = x + self.elem_size, y + self.elem_size -        tree, result, op = self.tree, self.default, self.op -        while l < r: -            if l & 1: -                result = op(tree[l], result) -                l += 1 -            if r & 1: -                r -= 1 -                result = op(tree[r], result) -            l, r = l >> 1, r >> 1 -        return result +    def set_value(self, idx, val): +        self.layer1[idx] = val +        idx0 = idx // self.sqrt_n +        idx1 = idx0 * self.sqrt_n +        self.layer0[idx0] = min(self.layer1[idx1 : idx1 + self.sqrt_n]) -    def set_value(self, i: int, value: int) -> None: -        k = self.elem_size + i -        self.tree[k] = value -        self.update(k) +    def chmin(self, idx, val): +        if self.layer1[idx] > val: +            self.layer1[idx] = val +            idx //= self.sqrt_n +            self.layer0[idx] = min(self.layer0[idx], val) -    def update(self, i: int) -> None: -        op, tree = self.op, self.tree -        while i > 1: -            i >>= 1 -            tree[i] = op(tree[i << 1], tree[(i << 1) + 1]) +    def debug(self): +        print(("layer0=", self.layer0)) +        print(("layer1=", self.layer1)) + +    def __getitem__(self, item): +        return self.layer1[item] + +    def __setitem__(self, key, value): +        self.set_value(key, value) -n, q = list(map(int, input().split())) -seg = SegmentTree([(1 << 31) - 1] * n, (1 << 31) - 1, min) -for _ in range(q): -    c, x, y = list(map(int, input().split())) -    if c == 0: -        seg.set_value(x, y) -    else: -        print((seg.get_value(x, y + 1))) +def main(): +    N, Q, *queries = list(map(int, open(0).read().split())) +    seg = Rmq(N) +    Ans = [] +    for com, x, y in zip(*[iter(queries)] * 3): +        if com == 0: +            seg.set_value(x, y) +        else: +            Ans.append(seg.get_min(x, y + 1)) +    print(("\n".join(map(str, Ans)))) + + +main()