#include <bits/stdc++.h>
using namespace std;

const int MAXN = 200001;

int arr[MAXN];
int tree[MAXN];
int n;

#define LSB(x) ((x) & -(x))

void update(int index) {
    int i = index + 1;
    while (i <= n) {
        int v = arr[i - 1];
        int k = LSB(i);
        int ch = i - k;
        while (k > 1) {
            k /= 2;
            ch |= k;
            v = min(v, tree[ch]);
        }
        tree[i] = v;
        i += LSB(i);
    }
}

int range_min(int l, int r) {
    int ans = min(arr[l], arr[r]); // boundary elements
    l += 1;
    r += 1;
    while (l < r) {
        int nr = r - LSB(r);
        if (nr < l) {
            ans = min(ans, arr[r - 1]);
            r--;
        } else {
            ans = min(ans, tree[r]);
            r = nr;
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int q;
    cin >> n >> q;
    for (int i = 0; i < n; i++) cin >> arr[i];

    fill(tree, tree + n + 1, INT_MAX);
    for (int i = 0; i < n; i++) update(i);

    while (q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int k, u;
            cin >> k >> u;
            k--;
            arr[k] = u;
            update(k);
        } else {
            int a, b;
            cin >> a >> b;
            cout << range_min(a - 1, b - 1) << "\n";
        }
    }

    return 0;
}