#include<cstdio>
#include<cctype>
#define MAX_N 100000
#define BUF_SIZE 1 << 18
#define oo 0x3f3f3f3f
using namespace std;

int v[MAX_N+1], segTree[4*MAX_N+1], n, m, poz = BUF_SIZE;
char buf[BUF_SIZE];

inline int maxim(int x, int y) {
    if(x >= y) return x;
    return y;
}

inline char getChar(FILE* fin) {
    if(poz == BUF_SIZE) {
        fread(buf,1,BUF_SIZE,fin);
        poz = 0;
    }
    return buf[poz++];
}

inline int read(FILE* fin) {
    int res = 0;
    char ch;
    do {
        ch = getChar(fin);
    }while(!isdigit(ch));
    do {
        res = 10*res + ch - '0';
        ch = getChar(fin);
    }while(isdigit(ch));
    return res;
}

void buildSegmentTree(int low, int high, int pos) {
    if(low == high) {
        segTree[pos] = v[low];
    } else {
        int mid = (low + high) >> 1;
        buildSegmentTree(low,mid,2*pos);
        buildSegmentTree(mid+1,high,2*pos+1);
        segTree[pos] = maxim(segTree[2*pos],segTree[2*pos+1]);
    }
}

void updateSegmentTree(int low, int high, int pos, int a, int b) {
    if(low == high) {
        segTree[pos] = b;
    } else {
        int mid = (low + high) >> 1;
        if(a <= mid)
            updateSegmentTree(low,mid,2*pos,a,b);
        else updateSegmentTree(mid+1,high,2*pos+1,a,b);
        segTree[pos] = maxim(segTree[2*pos],segTree[2*pos+1]);
    }

}

int maxQuery(int low, int high, int pos, int qlow, int qhigh) {
    if(qlow <= low && high <= qhigh)
        return segTree[pos];
    if(qlow > high || qhigh < low)
        return -oo;
    int mid = (low + high) >> 1;
    return maxim(maxQuery(low,mid,2*pos,qlow,qhigh),maxQuery(mid+1,high,2*pos+1,qlow,qhigh));
}

int main() {
    int i, op, x, y;
    FILE* fin, *fout;
    fin = fopen("arbint.in","r");
    fout = fopen("arbint.out","w");
    n = read(fin); m = read(fin);
    for(i = 1; i <= n; i++)
        v[i] = read(fin);
    buildSegmentTree(1,n,1);
    for(i = 1; i <= m; i++) {
        op = read(fin);
        x = read(fin);
        y = read(fin);
        if(!op)
            fprintf(fout,"%d\n",maxQuery(1,n,1,x,y));
        else updateSegmentTree(1,n,1,x,y);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}