# include <bits/stdc++.h>

using namespace std;

const int Nmax = 100000 + 5;

int n, m, i, v[Nmax], arb[Nmax * 3], op, a, b;

void build (int node, int left, int right) {

    if (left == right) {
        arb[node] = v[left];
        return ;
    }

    int mid = (left + right) / 2;

    build (node * 2, left, mid);
    build (node * 2 + 1, mid + 1, right);

    arb[node] = max(arb[node * 2], arb[node * 2 + 1]);

}

void lazy(int node, int left, int right, int pos, int x) {

    if (left == right) {
        arb[node] = x;
        return ;
    }

    int mid = (left + right) / 2;

    if (pos <= mid) lazy (node * 2, left, mid, pos, x);
        else lazy (node * 2 + 1 , mid + 1, right, pos, x);

    arb[node] = max( arb[node * 2], arb[node * 2 + 1] );

}

int query(int node, int left, int right, int a, int b) {

    if (a <= left && right <= b) return arb[node];

    int mid = (left + right) / 2;

    int Max = 0;

    if (a <= mid) Max = max(Max, query(node * 2, left, mid, a, b) );
    if (b > mid) Max = max (Max, query(node * 2 + 1, mid + 1, right, a, b) );

    return Max;

}

int main ()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);

    scanf("%d %d\n", &n, &m);

    for (i = 1; i <= n; ++i)
        scanf("%d ", &v[i]);

    build (1, 1, n);

    for (i = 1; i <= m; ++i)
    {
        scanf("%d %d %d\n", &op, &a, &b);
        if (!op) printf("%d\n", query(1, 1, n, a, b));
        else lazy(1, 1, n, a, b);
    }


    return 0;
}