#include <stdio.h>

#define MAXN 100001

int tree[4 * MAXN];
int n, m;

void build(int node, int l, int r, int arr[]) {
    if (l == r) {
        tree[node] = arr[l];
        return;
    }
    int mid = (l + r) / 2;
    build(2*node,   l,     mid, arr);
    build(2*node+1, mid+1, r,   arr);
    tree[node] = tree[2*node] > tree[2*node+1] ? tree[2*node] : tree[2*node+1];
}

void update(int node, int l, int r, int pos, int val) {
    if (l == r) {
        tree[node] = val;
        return;
    }
    int mid = (l + r) / 2;
    if (pos <= mid) update(2*node,   l,     mid, pos, val);
    else            update(2*node+1, mid+1, r,   pos, val);
    tree[node] = tree[2*node] > tree[2*node+1] ? tree[2*node] : tree[2*node+1];
}

int query(int node, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) return tree[node];
    int mid = (l + r) / 2;
    int res = 0;
    if (ql <= mid) {
        int v = query(2*node,   l,     mid, ql, qr);
        if (v > res) res = v;
    }
    if (qr > mid) {
        int v = query(2*node+1, mid+1, r,   ql, qr);
        if (v > res) res = v;
    }
    return res;
}

int arr[MAXN];

int main() {
    FILE *fin  = fopen("arbint.in",  "r");
    FILE *fout = fopen("arbint.out", "w");

    fscanf(fin, "%d %d", &n, &m);
    for (int i = 1; i <= n; i++)
        fscanf(fin, "%d", &arr[i]);

    build(1, 1, n, arr);

    for (int i = 0; i < m; i++) {
        int op, a, b;
        fscanf(fin, "%d %d %d", &op, &a, &b);
        if (op == 0)
            fprintf(fout, "%d\n", query(1, 1, n, a, b));
        else
            update(1, 1, n, a, b);
    }

    fclose(fin);
    fclose(fout);
    return 0;
}