#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
#define debug(v,n) for (int i = 1; i <= (n); ++i) cout << v[i] << " ";
#define next cout << '\n'
using namespace std;

const int N = 1e5;
int n, m;
int v[N];
vector<int> graf[N];

int main() {
    //ifstream fin("date.in.txt");
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        graf[i].push_back(v[i]);
    }

    /*
    1 -> 2 || 1 -> 3 || 1 -> 4 || 1 -> 5
    2 -> 3 || 2 -> 4 || 2 -> 5 ||
    3 -> 4 || 3 -> 5 ||
    4 -> 5 ||
    */

    for (int lg = 1; lg * lg <= n; ++lg) {
        for (int i = 1; i <= n - lg; ++i) {
            graf[i].push_back(max(graf[i][lg - 1], v[i + lg]));
        }
    }

    while(--m) {
        int q, a, b;
        fin >> q >> a >> b;
        if(q == 0) {
        }
        else {

        }
    }

    return 0;
}