#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(0); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;


// getmaxrange
// setval
class segtree_sparse {
    // ???????????¨?¨????????????????begin????????????end??????????????????begin<end????????????
    typedef ll T;
    static const T init = -((1ll << 31) - 1);

public:
    class Node {
        unique_ptr<Node> childlen[2];
    public:
        const ll begin;
        const ll end;
        T val;
        Node(ll b, ll e) :begin(b), end(e), val(init) {  }

        inline ll center() const {return (begin + end) / 2;
        }

        // Node????????°??????????????????????????????
        inline bool cover(ll be, ll en) const {
            return begin <= be && en <= end;
        }
        // Node????????°?????????????????????
        inline bool cover(ll i) const {
            return begin <= i && i <= end;
        }
        // Node????????°????????????????????????????????????
        inline bool covered_by(ll be, ll en) const {
            return be <= begin && end <= en;
        }

        // ??????????????????
        inline Node& child(int idx) {
            if (!childlen[idx]) {
                if (idx == 0)
                    childlen[idx].reset(new Node(begin, center()));
                else
                    childlen[idx].reset(new Node(center(), end));
            }
            return *childlen[idx];
        }

        inline Node& nextnode(ll i) {
            return child((begin + end) / 2 <= i);
        }
    };
private:
    inline void updatenode(Node& node) {
        // if (node.end - node.begin <= 1)return;
        node.val = max(node.child(0).val, node.child(1).val);
    }
public:

    Node root;

    segtree_sparse(ll begin, ll end) :root(begin, end) {}

    const Node& getmaxrange(ll begin, ll end, Node& node) const {
        if (node.covered_by(begin, end))
            return node;
        if (node.center() <= begin)
            return getmaxrange(begin, end, node.child(1));
        if (end <= node.center())
            return getmaxrange(begin, end, node.child(0));

        const Node& left = getmaxrange(begin, end, node.child(1));
        const Node& right = getmaxrange(begin, end, node.child(0));
        return (left.val < right.val) ? right : left;
    }
    const Node& getmaxrange(ll begin, ll end) {
        return getmaxrange(begin, end, root);
    }

    const Node& setval(ll idx, T val, Node& node) {
        if (node.begin != idx || node.end != idx+1) {
            auto& term = setval(idx, val, node.nextnode(idx));
            updatenode(node);
            return term;
        }
        node.val = val;
        return node;
    }

    const Node& setval(ll idx, T val) {
        return setval(idx, val, root);
    }

};



ll m, n, kei;

int main() {

    scanner >> n >> m;

    segtree_sparse seg(0, n);

    repeat(lop, m) {
        int c, x, y;
        scanner >> c >> x >> y;
        if (c == 0) {
            seg.setval(x, -y);
        }
        else {
            auto& nd = seg.getmaxrange(x, y+1);
            printf("%d\n", -nd.val);
        }
    }

    return 0;
}

Measured memory_bytes: 11628