#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":" "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
    is>>p.first>>p.second; return is; }
template <class T> bool chmax(T &a,const T &b) {if(a<b) {a=b;return 1;} return 0;}
template <class T> bool chmin(T &a,const T &b) {if(b<a) {a=b;return 1;} return 0;}
template <class T> using heap = priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

template <class Monoid>
struct SegmentTree {
    int size;
    vector<Monoid> data;
    function<Monoid(Monoid, Monoid)> updater;
    SegmentTree(int n, function<Monoid(Monoid, Monoid)> update_func): updater(update_func) {
        size = 1;
        while (size < n) size <<= 1;
        data.resize(size * 2 - 1, Monoid::e());
    }
    void update(int i, const Monoid x) {
        i += size - 1;
        data[i] = updater(data[i], x);
        while (i > 0) {
            i = (i - 1) / 2;
            data[i] = Monoid::op(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }
    Monoid query(int wishL, int wishR, int watchL = 0, int watchR = -1, int k = 0) {
        if(watchR == -1) watchR = size;
        if(watchR <= wishL || wishR <= watchL) return Monoid::e();
        if(wishL <= watchL && watchR <= wishR) return data[k];
        Monoid ld = query(wishL, wishR, watchL, (watchL + watchR) / 2, k * 2 + 1);
        Monoid rd = query(wishL, wishR, (watchL + watchR) / 2, watchR, k * 2 + 2);
        return Monoid::op(ld, rd);
    }
    Monoid at(int i) {
        return data[i + size - 1];
    }
};

struct rmq_node {
    int value;
    rmq_node(int x): value(x) {}
    static rmq_node e() {
        return rmq_node((1LL<<31)-1);
    }
    static rmq_node op(const rmq_node &l, const rmq_node &r) {
        return (l.value < r.value ? l : r);
    }
};
signed main() {
    int n,q;
    cin>>n>>q;
    auto update=[](rmq_node l, rmq_node r) { return r; };
    SegmentTree<rmq_node> seg(n,update);
    while(q--) {
        int com;
        cin>>com;
        int x,y;
        cin>>x>>y;
        if(com==0) {
            seg.update(x, rmq_node(y));
        } else {
            cout<<seg.query(x,y + 1).value<<endl;
        }
    }
    return 0;
}

Measured memory_bytes: 4916