#include <bits/stdc++.h>

#define MAXN 1 << 17
#define max(x, y) x > y ? x : y

int N, M, values[MAXN], tree[MAXN], op, x, y;

void update(int node, int left, int right, int x, int y, int value) {
    if (left == right) {
        tree[node] = value;
    } else {
        int middle = left + (right - left) / 2;
        if (x <= middle) {
            update(2 * node + 1, left, middle, x, y, value);
        }
        if (y > middle) {
            update(2 * node + 2, middle + 1, right, x, y, value);
        }
        tree[node] = max(tree[2 * node + 1], tree[2 * node + 2]);
    }
}

int read(int node, int left, int right, int x, int y) {
    int first = 0, second = 0;

    if (x <= left && right <= y) {
        return tree[node];
    } else {
        int middle = left + (right - left) / 2;
        if (x <= middle) {
            first = read(2 * node + 1, left, middle, x, y);
        }
        if (y > middle) {
            second = read(2 * node + 2, middle + 1, right, x, y);
        }
        return max(first, second);
    }
}

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

    scanf("%d%d", &N, &M);

    for (int it = 0; it < N; ++it) {
        scanf("%d", &values[it]);
        update(0, 0, N - 1, it, it, values[it]);
    }

    for (int it = 0; it < M; ++it) {
        scanf("%d%d%d", &op, &x, &y);
        if (op == 0) {
            printf("%d\n", read(0, 0, N - 1, x - 1, y - 1));
        } else {
            update(0, 0, N - 1, x - 1, x - 1, y);
        }
    }

    return 0;
}