表模板

#include <bits/stdc++.h>

#define x first
#define y second
#define all(x) x.begin(), x.end()

using namespace std;
using i128 = __int128;
using u128 = unsigned __int128;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using PLD = pair<LD, LD>;

const int N = 30, MOD = 998244353;
const int INF = 1e9;
const LL LL_INF = 1e18;
const LD EPS = 1e-8;
const int dx4[] = {-1, 0, 1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};

istream &operator>>(istream &is, i128 &val) {
    string str;
    is >> str;
    val = 0;
    bool flag = false;
    if (str[0] == '-') flag = true, str = str.substr(1);
    for (char &c: str) val = val * 10 + c - '0';
    if (flag) val = -val;
    return is;
}

ostream &operator<<(ostream &os, i128 val) {
    if (val < 0) os << "-", val = -val;
    if (val > 9) os << val / 10;
    os << static_cast<char>(val % 10 + '0');
    return os;
}

struct Hash {
    vector<int> h, p;
    int B = 131;
    Hash (const string &s) {
        int n = s.size();
        h.resize(n + 1, 0);
        p.resize(n + 1, 1);
        for (int i = 0; i < n; ++i) {
            p[i + 1] = p[i] * B % MOD;
            h[i + 1] = (h[i] * B + s[i]) % MOD;
        }
    }

    LL get_hash(int l, int r) {
        LL v = h[r] - h[l - 1] * p[r - l + 1] % MOD;
        v = (v % MOD + MOD) % MOD;
        return v;
    }
};

bool cmp(LD a, LD b) {
    if (fabs(a - b) < EPS) return 1;
    return 0;
}

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    vector<vector<int>> st1(n, vector<int>(N, INF));
    vector<vector<int>> st2(n, vector<int>(N, -INF));
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        st1[i][0] = st2[i][0] = a[i];
    }

    vector<int> lg(n + 1);
    for (int i = 2; i <= n; i++) lg[i] = lg[i / 2] + 1;

    for (int k = 1; k < N; ++k) {
        for (int i = 0; i + (1 << k) - 1 < n; ++i) {
            st1[i][k] = min(st1[i][k - 1], st1[i + (1 << (k - 1))][k - 1]);
            st2[i][k] = max(st2[i][k - 1], st2[i + (1 << (k - 1))][k - 1]);
        }
    }

    auto query_mx = [&](int l, int r) {
        int k = lg[r - l + 1];
        return max(st2[l][k], st2[r - (1 << k) + 1][k]);
    };

    auto query_mn = [&](int l, int r) {
        int k = lg[r - l + 1];
        return min(st1[l][k], st1[r - (1 << k) + 1][k]);
    };

    while (q--) {
        int op;
        cin >> op;
        int l, r;
        cin >> l >> r;
        l--, r--;
        if (op == 1) {
            cout << query_mn(l, r) << '\n';
        }
        else {
            cout << query_mx(l, r) << '\n';
        }
    }
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int T = 1;
    while (T--) solve();
    cout << fixed << setprecision(15);

    return 0;
}