#include <cmath>
#include <fstream>
#include <vector>

using namespace std;

inline int Log(int n)
{
    return log(n) / log(2);
}

void Update(vector<int> &vec, int ind, int l, int r, int pos, int val)
{
    if (l == r) {
        vec[ind] = val;
        return;
    }

    int mid = l + (r - l) / 2;
    if (pos <= mid) {
        Update(vec, 2 * ind, l, mid, pos, val);
    } else {
        Update(vec, 2 * ind + 1, mid + 1, r, pos, val);
    }
    vec[ind] = max(vec[2 * ind], vec[2 * ind + 1]);
}

int Query(const vector<int> &aint, int ind, int l, int r, int x, int y)
{
    if (x <= l && y >= r) {
        return aint[ind];
    }

    int mid = l + (r - l) / 2;
    int res = 0;

    if (x <= mid) {
        res = max(res, Query(aint, 2 * ind, l, mid, x, y));
    }
    if (y >= mid + 1) {
        res = max(res, Query(aint, 2 * ind + 1, mid + 1, r, x, y));
    }
    return res;
}

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");

    int n, m;
    fin >> n >> m;

    vector<int> aint(n * Log(n) + 1, 0);
    for (int i = 1; i <= n; ++i) {
        int x;
        fin >> x;
        Update(aint, 1, 1, n, i, x);
    }

    while (m--) {
        int r, x, y;
        fin >> r >> x >> y;
        if (r == 0) {
            fout << Query(aint, 1, 1, n, x, y) << "\n";
        } else {
            Update(aint, 1, 1, n, x, y);
        }
    }

    return 0;
}