#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

template < typename T >
struct Monoid;

template < typename T, typename M, typename = typename std::enable_if< std::is_base_of< Monoid< T >, M >::value > >
class SegmentTree
{
	const int N;
	std::vector< T > data;

public:
	SegmentTree( const int n ) : N( n ), data( 4 * N, M::identity() )
	{
		return;
	}

	SegmentTree( const std::vector< M > &src ) : N( src.size(), M::identity() )
	{
		init( src, 0, N );
		return;
	}

public:
	void update( const int p, const T &a )
	{
		return update( p, a, 0, 0, N );
	}

	T query( const int a, const int b )
	{
		return query( a, b, 0, 0, N );
	}

private:
	void init( const std::vector< T > &src, const int k, const int l, const int r )
	{
		if ( l + 1 == r )
		{
			data[k] = src[l];
			return;
		}

		const int mid = ( l + r ) / 2;
		init( src, k * 2 + 1, l, mid );
		init( src, k * 2 + 2, mid, r );
		data[k] = M::operation( data[ k * 2 + 1 ], data[ k * 2 + 2 ] );
		return;
	}

	void update( const int p, const T &a, const int k, const int l, const int r )
	{
		if ( !( l <= p && p < r ) )
		{
			return;
		}
		if ( l + 1 == r && l == p )
		{
			data[k] = a;
			return;
		}

		const int mid = ( l + r ) / 2;
		update( p, a, k * 2 + 1, l, mid );
		update( p, a, k * 2 + 2, mid, r );
		data[k] = M::operation( data[ k * 2 + 1 ], data[ k * 2 + 2 ] );
		return;
	}

	T query( const int a, const int b, const int k, const int l, const int r )
	{
		if ( a <= l && r <= b )
		{
			return data[k];
		}
		if ( b <= l || r <= a )
		{
			return M::identity();
		}

		const int mid = ( l + r ) / 2;
		return M::operation(
				query( a, b, k * 2 + 1, l, mid ),
				query( a, b, k * 2 + 2, mid, r )
				);
	}
};

template < typename T >
struct Monoid
{
	static T identity();
	static T operation( const T, const T );
};

struct RMQ : Monoid< int >
{
	static int identity()
	{
		return ( 1LL << 31 ) - 1;
	}

	static int operation( const int &a, const int &b )
	{
		return min( a, b );
	}
};

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, Q );

	SegmentTree< int, RMQ > segtree( N );

	REP( Q )
	{
		IN( int, T, x, y )

		if ( T == 0 )
		{
			segtree.update( x, y );
		}
		else
		{
			cout << segtree.query( x, y + 1 ) << '\n';
		}
	}

	cout << flush;

	return 0;
}


Measured memory_bytes: 4312