#include <iostream>
#include <iomanip>
#include <fstream>

#include <algorithm>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#if __cplusplus > 199711L
#include <unordered_map>
#include <unordered_set>
#endif

#include <cstdio>
#include <ctime>
#include <cmath>
#include <cstring>
#include <cstdlib>

using namespace std;

typedef long long int64;

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

const int NMAX = 100010, inf = 0x3f3f3f3f;

int N, M, value, pos, start, finish, res, a, b;
int tree[4 * NMAX];

void update(int node, int left, int right)
{
    if (left == right)
    {
        tree[node] = b;
        return;
    }

    int div = (left + right) / 2;
    if (a <= div) update(node * 2, left, div);
    else update(node * 2 + 1, div + 1, right);

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

void query(int node, int left, int right)
{
    if (left >= a && b >= right)
    {
        res = max(res, tree[node]);
        return;
    }

    int div = (left + right) / 2;
    if (a <= div) query(node * 2, left, div);
    if (b > div) query(node * 2 + 1, div + 1, right);
}

int main()
{
    int i, x;

    fin >> N >> M;

    for (i = 1; i <= N; ++i)
    {
        fin >> a;
        b = i;
        update(1, 1, N);
    }

    while(M--)
    {
        fin >> x >> a >> b;

        if (x == 0)
        {
            res = -inf;
            query(1, 1, N);
            fout << res << '\n';
        }
        else update(1, 1, N);
    }

    fin.close();
    fout.close();
    return 0;
}