#define _CRT_SECURE_NO_WARNINGS
#ifdef __GNUC__
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define unordered_map __fast_unordered_map
template<class Key, class Value, class Hash = std::hash<Key>>
using unordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;
#else
#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <list>
#include <array>
#include <cstdlib>
#include <stack>
#include <string>
#include <queue>
#include <chrono>
#include <functional>
#include <limits>
#include <cmath>
#include <algorithm>
#include <random>
#include <regex>
#include <tuple>
#include <numeric>
#include <cassert>
#include <utility>
#include <bitset>
#include <complex>
#include <iomanip>
#include <ostream>
#include <sstream>
#include <ctime>
unsigned int __builtin_popcount(unsigned int x)
{
int ret = 0;
while(x)
{
ret += x & 1;
x >>= 1;
}
return ret;
}
unsigned long long __builtin_popcountll(unsigned long long x)
{
int ret = 0;
while(x)
{
ret += x & 1LL;
x >>= 1LL;
}
return ret;
}
long long __gcd(long long a, long long b)
{
assert(a >= 0);
assert(b >= 0);
if (b == 0) return a;
long long ret = __gcd(b, a % b);
assert(ret);
return ret;
}
int __gcd(int a, int b)
{
assert(a >= 0);
assert(b >= 0);
if (b == 0) return a;
int ret = __gcd(b, a % b);
assert(ret);
return ret;
}
bool __builtin_sadd_overflow(int a, int b, int *res) { return false; }
bool __builtin_saddll_overflow(long long int a, long long int b, long long int *res) { return false; }
bool __builtin_ssub_overflow(int a, int b, int *res) { return false; }
bool __builtin_ssubll_overflow(long long int a, long long int b, long long int *res) { return false; }
bool __builtin_smul_overflow(int a, int b, int *res) { return false; }
bool __builtin_smulll_overflow(long long int a, long long int b, long long int *res) { return false; }
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned short ushort;
const ll INFLL = 2 * (ll)1e18 + 100;
#define for0(i, n) for(int i = 0; i < n; ++i)
#define for1(i, n) for(int i = 1; i <= n; ++i)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define index INDEX
template<class T> ostream &operator<<(ostream& os, const vector<T>& v) {
if (v.empty()) return os;
for (std::size_t i = 0; i < v.size() - 1; ++i) os << v[i] << ' ';
return os << v.back();
}
template<class T> ostream &operator<<(ostream& os, const deque<T>& v) {
if (v.empty()) return os;
for (std::size_t i = 0; i < v.size() - 1; ++i) os << v[i] << ' ';
return os << v.back();
}
template<class T> ostream &operator<<(ostream& os, const set<T>& v) {
if (v.empty()) return os;
auto aux = v.end(); --aux;
for(auto it = v.begin(); it != aux; ++it)
{
os << *it << ' ';
}
return os << *aux;
}
template<class T> ostream &operator<<(ostream& os, const multiset<T>& v) {
if (v.empty()) return os;
auto aux = v.end(); --aux;
for (auto it = v.begin(); it != aux; ++it)
{
os << *it << ' ';
}
return os << *aux;
}
template<class L, class R> ostream &operator<<(ostream &os, const pair<L, R>& P) {
return os << P.first << " " << P.second;
}
template<class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << " = " << h << '\n'; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',') cerr << *sdbg++;
cerr << " = " << h << ','; _dbg(sdbg + 1, a...);
}
#ifdef AJECC
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
auto rng = mt19937_64(chrono::steady_clock::now().time_since_epoch().count());
int generate_random() {
const int MAX_RANDOM = (int)20;
return uniform_int_distribution<unsigned int>(1, MAX_RANDOM)(rng);
}
#define int ll /// might modify this sometimes
#ifdef int
const int INFINT = INFLL;
#else
const int INFINT = 2 * (int)1e9 + 100;
#endif
const double PI = atan(1) * 4;
const double EPS = 1e-6;
const int SEED = (int)1e3 + 7;
const int MOD = (int)1e9 + 7;
const int NMAX = (int)2 * 1e5 + 5;
template<typename T>
class segment_tree
{
public:
size_t size = 0;
T init_value = {};
std::vector<T> tree = {};
segment_tree(const size_t& size, const T& init_value)
{
this->size = size;
this->tree.resize((size + 1) * 4, {});
this->init_value = init_value;
}
void update(const size_t& pos, const T& val)
{
update_aux(pos, val, 1, 1, size);
}
T query(const size_t& left, const size_t& right)
{
return query_aux(left, right, 1, 1, size);
}
private:
T func(const T& lhs, const T& rhs)
{
return std::max(lhs, rhs);
}
void update_aux(const size_t& pos, const T& val,
const size_t& node, const size_t& left, const size_t& right)
{
if (left == right)
{
tree[node] = val;
return;
}
size_t middle = (left + right) / 2;
if (pos <= middle)
{
update_aux(pos, val, 2 * node, left, middle);
}
else
{
update_aux(pos, val, 2 * node + 1, middle + 1, right);
}
tree[node] = func(tree[2 * node], tree[2 * node + 1]);
}
T query_aux(const size_t& start, const size_t& finish,
const size_t& node, const size_t& left, const size_t& right)
{
if (start <= left && finish >= right)
{
return tree[node];
}
if (left > finish || right < start)
{
return init_value;
}
size_t middle = (left + right) / 2;
T left_query = query_aux(start, finish, 2 * node, left, middle);
T right_query = query_aux(start, finish, 2 * node + 1, middle + 1, right);
return func(left_query, right_query);
}
};
int32_t main() {
FASTIO; /// disable for interactive
#ifdef AJECC
double START_PROGRAM = clock();
#endif
#ifndef AJECC
freopen("arbint.in", "w", stdin);
freopen("arbint.out", "w", stdout);
#endif
int n, t;
cin >> n >> t;
segment_tree<int> seg_tree(n, 0);
for1(i, n)
{
int val;
cin >> val;
seg_tree.update(i, val);
}
while (t--)
{
int q, a, b;
cin >> q >> a >> b;
if (q == 0)
{
cout << seg_tree.query(a, b) << '\n';
}
else
{
seg_tree.update(a, b);
}
}
#ifdef AJECC
double END_PROGRAM = clock();
double ELAPSED_TIME = (END_PROGRAM - START_PROGRAM) / CLOCKS_PER_SEC;
cerr << "\n\nElapsed Time: " << ELAPSED_TIME * 1000 << "\n";
#endif
return 0;
}