////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// ?????¢
// XCode??§???EOF??\??????Ctrl+D
// ?\???Alt+\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long long?????£???????????????????????????
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////



////////////////////////////////////////
//RMQ (Range Minimum Query)
//??????????????§?????§?????????????????°???????????¨(?????¨????????¨)??§????????£?????????
////////////////////////////////////////

//#define debug //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <iostream>
#include <algorithm> // next_permutation
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstring> //memcpy
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric> //accumulate
//#include <map>
//#include <unordered_map> //hash func.
#include <fstream> //ifstream, ofstream
#include <iterator> //insert_iterator::inserter


//#define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;


#define dout cout
//If u wanna output to a text file instead of standard output, plz define OUTPUTFILE.
//#define OUTPUTFILE "output.txt" //*******************************************************************************************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif


#define din cin
//If u wanna input from a text file instead of standard input, plz define INPUTFROMTEXTFILE???.
//#define INPUTFILE "input.txt" //*******************************************************************************************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
//#define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) << A[j] << " ";} cout << endl

#define sign(x) ((x)>0)-((x)<0) //x<0: -1, x=0: 0, x>0: +1
#define p(i) (i)/2
#define l(i) (i)*2
#define r(i) (i)*2+1

int dx[] = {1,-1, 0, 0, 1, 1,-1,-1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0,-1, 1,-1, 1, 1,-1};

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (1<<31)-1;
const ll INF_LL = (ll)9e18-1LL; //Be careful for overflow.
const ull INF_ULL = (ull)1e19-1ULL;
const int NONE = -1;
const ll MOD = (ll)1e9+7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = 100010; //num of vertex or element
const int M_MAX = 100010; //num of edge
const int DATA_MAX = 1010;

int N;
int a[N_MAX*4];

int k;
int pow2k; //N????????§??????????°????2????????????


void initialize() {
    
    k = 0;
    pow2k = 1;
    
    while(pow2k<N) {
        pow2k *= 2;
        k++;
    }
    
    rep(i,0,2*pow2k) {
        a[i] = INF;
    }
    
#ifdef debug
    disp(k);
    disp(pow2k);
#endif
    
}



int find_recursive(int begin, int end, int node_id, int left, int right) {
    //????????????[begin,end)???????°????????±????????????°??¢??°
    //?????????node_id??????????????????????????????[left,right)??§????????¨?????°??§??????????????????
    //
    //main()???????????¶??¨?????????find_recursive(from, to+1, 1, 0, pow2k) *N????????????????????¨?????¨???!!
    
#ifdef debug
    dout << "--- find_recursive( begin=" << begin << ", end=" << end << ", node_id=" << node_id << ", l=" << left << ", r=" << right << " )\n";
#endif
    
    
    if( right<=begin or end<=left ) { //????±???????[begin,end)??????node_id???????????????????????????[left,right)??¨?????£???????¢????????????´???
#ifdef debug
        dout << "????±???????[begin,end)??????node_id???????????????????????????[left,right)??¨?????£???????¢???????????????§\n";
        dout << INF << endl;
#endif
        return INF; //??¢??????????????§??¨?????????????????????????????????
    }
    
    
    if( begin<=left and right<=end ) { //????±???????[begin,end)??????node_id???????????????????????????[left,right)????????¨?????????????????´???
#ifdef debug
        dout << "????±???????[begin,end)??????node_id???????????????????????????[left,right)????????¨????????????????????§\n";
        dout << a[node_id] << endl;
#endif
        return a[node_id]; //node_id???????????????????????????????°?????????????????????????
    }
    
    //????????\????????´???????????????????±???????[begin,end)??¨???node_id???????????????????????????[left,right)????????¨????????????????????´???
    //node_id??????????????¨??????????????????????????????????????°??????????????????????°????????????????????????????
#ifdef debug
    dout << "????±???????[begin,end)??¨???node_id???????????????????????????[left,right)????????¨???????????????????????§?????\???2???????????°??????????????????\n";
    dout << "( begin=" << begin << ", end=" << end << ", node_id=" << l(node_id) << ", l=" << left << ", r=" << (left+right)/2 << " )\n";
    dout << "( begin=" << begin << ", end=" << end << ", node_id=" << r(node_id) << ", l=" << (left+right)/2 << ", r=" << right << " )\n";
#endif

    int min_left = find_recursive(begin, end, l(node_id), left, (left+right)/2);
    int min_right = find_recursive(begin, end, r(node_id), (left+right)/2, right);
    
    
#ifdef debug
    dout << "-- ????£??????????????????????????????°??£?????????!! find_recursive( begin=" << begin << ", end=" << end << ", node_id=" << node_id << ", l=" << left << ", r=" << right << " )\n";
    disp(min( min_left, min_right ));
#endif
    
    return min( min_left, min_right );
    
}




int find(int from, int to) {
    
#ifdef debug
    dout << "------ find( " << from << ", " << to << ")\n";
#endif
    
    assert(from<=to);
    assert(to<N);
    
    
    int i = from + pow2k;
    int j = to + pow2k;
    
    int ans = INF;
    
    int limit = pow2k;
    
#ifdef debug
    disp(i);
    disp(j);
    disp(limit);
    disp(ans);
#endif
    while( i<j and limit<=i and j<2*limit ) {
        
        if( i==r(p(i)) ) ans = min(ans, a[i]), i = p(i) + 1;
        else i = p(i);
        
        if( j==l(p(j)) ) ans = min(ans, a[j]), j = p(j) - 1;
        else j = p(j);
        
        limit /= 2;
        
#ifdef debug
        dout << "--- while-loop --- \n";
        disp(i);
        disp(j);
        disp(limit);
        disp(ans);
#endif
    }
    
    if( i==j and limit<=i and j<2*limit ) {
#ifdef debug
        dout << "--- last check --- \n";
        dout << "check a[" << i << "] = " << a[i] << endl;
#endif
        assert(i==j);
        ans = min( ans, a[i] );
    }
    
#ifdef debug
    dout << "--- FINAL --- \n";
    disp(i);
    disp(j);
    disp(limit);
    disp(ans);
#endif
    return ans;
    
}


void update(int i, int x) {
#ifdef debug
    dout << "------ update( i=" << i << ", x=" << x << ")\n";
#endif
    
    i = i + pow2k;
    a[i] = x;
    
    i = p(i);
    while(i>0) {
        a[i] = min( a[l(i)], a[r(i)] );
        i = p(i);
    }
}


void display() {
#ifdef debug
    dout << "---------------------\n";
    dout << "i = ";
    rep(i,0,2*pow2k) {
        disP(i);
    }
    dout << endl;
    dout << "a = ";
    rep(i,0,2*pow2k) {
        disP(a[i]==INF?999:a[i]);
    }
    dout << endl;
    dout << "---------------------\n";
    dout << endl;
#endif
}



int main() {
    
    //cin, cout????????????  ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
    cin.tie(0); //cin??¨cout??????????????????
    ios::sync_with_stdio(false); //iostream??¨stdio??????????????????
    
    //read input data
    scand(N);
    int Q; scand(Q);
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //start timer
    auto startTime = chrono::system_clock::now();
#endif
    //------------------------------------------------------------------------------------------
    
    initialize();
    display();
    
    int command, x, y;
    rep(i,0,Q) {
        scanf("%d%d%d", &command, &x, &y);
        
        if(command) {
            int ans_a = find_recursive(x, y+1, 1, 0, pow2k);
//            int ans_b = find(x,y);
            printf("%d\n", ans_a);
//            printf("right answer = %d\n-----\n", ans_b);
//            if(ans_a!=ans_b) dout << "/////////////////////////////////////////////////////////////////////////////////////////////////////////////////// WRONG ANSWER!!\n";
        }
        else {
            update(x,y);
        }
        display();
    }
    
    
    
    
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //stop timer
    auto endTime = chrono::system_clock::now();
    auto dur = endTime - startTime;
    auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
    dout << fixed << setprecision(4) << (double)msec/1000 << " sec \n";
#endif
    //------------------------------------------------------------------------------------------
    
#ifdef INPUTFILE
    inputfile.close();
#endif
    
#ifdef OUTPUTFILE
    outputfile.close();
    cout << "\"" << OutputFilePath << "\"" << endl;
#endif
    
    return 0;
}

Measured memory_bytes: 4252