#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "arbint";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

class SegmentTree
{

public:
    SegmentTree(int left, int right);
    void update(int a, int b, int value);
    int query(int a, int b);

protected:
    void update(int nod, int a, int b, int left, int right, int value);
    int query(int nod, int a, int b, int left, int right);
private:
    vector<int> _data;
    int _left;
    int _right;
};

SegmentTree::SegmentTree(int left, int right)
{
    this->_left = left;
    this->_right = right;
    int size = right - left + 1;
    int c = 1;
    while( c < size)
        c <<= 1;
    c <<= 1;
    c++;
    _data.resize(c);
}

void SegmentTree::update(int a, int b, int value)
{
    update(1, a, b, _left, _right, value);
}
int SegmentTree::query(int a, int b)
{
    return query(1, a, b, _left, _right);
}

void SegmentTree::update(int nod, int a, int b, int left, int right, int value)
{
    if(a <= left && right <= b)
    {
        _data[nod] = value;
        return;
    }
    int mid = (left + right)/2;

    if( a <= mid)
    {
        update(nod * 2, a, b, left , mid, value);
    }
    if(mid + 1 <= b)
    {
        update(nod * 2 + 1, a, b, mid + 1, right, value);
    }
    _data[nod] = max(_data[nod*2], _data[nod*2+1]);

}

int SegmentTree::query(int nod, int a, int b, int left, int right)
{
    if(a <= left && right <= b)
    {
        return _data[nod];
    }
    int mid = (left + right) / 2;
    int result = -INF;
    if( a <= mid)
    {
        int c = query(nod * 2, a, b, left, mid);
        result = max(result, c);
    }
    if( mid + 1 <= b)
    {
        int c = query(nod * 2 + 1, a, b, mid + 1, right);
        result = max(result, c);
    }
    return result;
}

const int BUFFER_SIZE = 1024;
char buffer[BUFFER_SIZE];
int p = 0;
int nextInt(fstream& fin)
{
    int res = 0;
    while(!('0' <= buffer[p] && buffer[p] <= '9'))
    {
        p++;
        if(p == BUFFER_SIZE)
        {
            fin.read(buffer, BUFFER_SIZE);
            p = 0;
        }
    }
    while('0' <= buffer[p] && buffer[p] <= '9')
    {
        res = res * 10 + buffer[p] - '0';
        p++;
        if(p == BUFFER_SIZE)
        {
            fin.read(buffer, BUFFER_SIZE);
            p = 0;
        }
    }
    return res;
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in | ios::binary);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin.read(buffer, BUFFER_SIZE);
    N = nextInt(fin);
    M = nextInt(fin);
    SegmentTree tree(0, N - 1);
    for(int i = 0; i < N; i++)
    {
        int c;
        c = nextInt(fin);
        tree.update(i, i, c);
    }
    for(int i = 0; i < M; i++)
    {
        int op, x, y;
        op = nextInt(fin);
        x = nextInt(fin);
        y = nextInt(fin);
        if(op == 0)
        {
            fout << tree.query(x - 1, y - 1) << "\n";
        }
        else
        {
            tree.update(x - 1, x - 1, y);
        }
    }

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}