#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 SegTree
{
    public:
        SegTree(int left, int right);
        void update(int nod, int a, int b, int left, int right, int val);
        void update(int a, int b, int val);

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


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

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

void SegTree::update(int nod, int a, int b, int left, int right, int val)
{
    if(a <= left && right <= b)
    {
        _data[nod] = val;
        return;
    }

    int mid = (left + right)/2;

    if(a <= mid)
    {
        update(nod * 2, a, b, left, mid, val);
    }
    if(mid + 1 <= b)
    {
        update(nod * 2 + 1, a, b, mid + 1, right, val);
    }

    _data[nod] = max(_data[nod*2], _data[nod*2+1]);
}

int SegTree::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 res = -INF;
    if(a <= mid)
    {
        res = max(res, query(nod*2, a, b, left, mid));
    }
    if(mid + 1 <= b)
    {
        res = max(res, query(nod*2 + 1, a, b, mid + 1, right));
    }
    return res;
}

const int BUFLEN = 4096;
char BUF[BUFLEN];
int p;

int nextInt(istream& fin)
{
    int res = 0;
    while(!('0' <= BUF[p] && BUF[p] <= '9'))
    {
        p++;
        if(p == BUFLEN)
        {
            fin.read(BUF, BUFLEN);
            p = 0;
        }
    }
    while('0' <= BUF[p] && BUF[p] <= '9')
    {
        res *= 10;
        res += BUF[p] -'0';
        p++;
        if(p == BUFLEN)
        {
            fin.read(BUF, BUFLEN);
            p = 0;
        }
    }
    return res;
}

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

    fin.read(BUF, BUFLEN);

    int N, M;
    N = nextInt(fin);
    M = nextInt(fin);
    SegTree tree(0, N - 1);
    for(int i = 0; i < N; i++)
    {
        int x;
        x = nextInt(fin);
        tree.update(i, i, x);
    }

    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 if(op == 1)
        {
            tree.update(x - 1, x - 1, y);
        }
    }

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