// g++ -std=c++17 -DLOCAL a.cpp -o ex && ./ex >tst.out 2>&1
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
    return '"' + s + '"';
}
 
string to_string(const char* s) {
    return to_string((string) s);
}
 
string to_string(bool b) {
    return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
    bool first = true;
    string res = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(v[i]);
    }
    res += "}";
    return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
    string res = "";
    for (size_t i = 0; i < N; i++) {
        res += static_cast<char>('0' + v[i]);
    }
    return res;
}
 
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << "   "; }
void debug_out_nl() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

template <typename Head, typename... Tail>
void debug_out_nl(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out_nl(T...);
}
 
#ifdef LOCAL
#define dbg(...) cerr << "#" << #__VA_ARGS__ << ":", debug_out(__VA_ARGS__)
#define nl(...) cerr << "#" << #__VA_ARGS__ << ":", debug_out_nl(__VA_ARGS__)
#else
#define dbg(...) 69
#define nl(...) 42
#endif

#define ll long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll random(ll st, ll dr) {
    assert(st <= dr);
    return st + rng() % (dr - st + 1);
}

const int MOD = 1e9 + 7;
const int N = 2e5 + 10;

template<typename T, typename U>
struct LazySegTree {
    int N;
    vector<T> data; 
    vector<U> lazy;
    vector<int> lazyFlag;
    T inf; // 0, T_MAX, T_MIN etc

    // In loc de 0 trebuie constructor pentru T, U
    LazySegTree(int _N = 0, T _inf = 0) : N(_N), data(4 * _N + 1, 0), lazy(4 * _N + 1, 0), lazyFlag(4 * _N + 1, 0), inf(_inf) {}

    // change accordingly (min, max, sum, xor etc)
    T merge(const T &x, const T &y) {
        return max(x, y);
    }

    // change accordingly (=, += etc), logic if T != U
    void apply(int node, U lazyValue, int flag) {
        if (flag) {
            lazy[node] = lazyValue; // careful
        } else {
            data[node] = lazyValue; // careful
        }

        lazyFlag[node] = flag;
    }

    // change logic if T != U
    void push(int st, int dr, int node) {
        if (!lazyFlag[node] || st > dr) {
            return;
        }

        int flag = lazyFlag[node];
        apply(node, lazy[node], 0); // atentie la update de tip set cand facem sum pe interval

        if (st < dr) {
            apply(node << 1, lazy[node], flag);
            apply(node << 1 | 1, lazy[node], flag);
        }

        lazy[node] = 0;
    }

    void update(int st, int dr, int node, int l, int r, U val) {
        push(st, dr, node);

        if (st > dr || r < st || l > dr) {
            return;
        }

        if (l <= st && dr <= r) {
            apply(node, val, 1);
            push(st, dr, node);
            return; 
        }

        int mid = (st + dr) >> 1;
        update(st, mid, node << 1, l, r, val);
        update(mid + 1, dr, node << 1 | 1, l, r, val);

        data[node] = merge(data[node << 1], data[node << 1 | 1]);
    }

    T query(int st, int dr, int node, int l, int r) {
        push(st, dr, node);

        if (st > dr || r < st || l > dr) {
            return inf;
        }

        if (l <= st && dr <= r) {
            return data[node];
        }

        int mid = (st + dr) >> 1;
        T left = query(st, mid, node << 1, l, r);
        T right = query(mid + 1, dr, node << 1 | 1, l, r);

        return merge(left, right);
    }

    void update(int l, int r, U val) {
        update(1, N, 1, l, r, val);
    }

    T query(int l, int r) {
        return query(1, N, 1, l, r);
    }
};


void solve(int test, istream &cin, ostream &cout) {
    int n, q;
    cin >> n >> q;

    LazySegTree<int, int> aint(n, INT_MIN);

    for (int i = 1, x; i <= n; i++) {
        cin >> x;
        aint.update(i, i, x);
    }

    for (int op, l, r; q--; ) {
        cin >> op >> l >> r;
        if (op) {
            aint.update(l, l, r);
        } else {
            cout << aint.query(l, r) << '\n';
        }
    }

    // cerr << "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms" << '\n';
}

int main() {
    ifstream cin("arbint.in");
    ofstream cout("arbint.out");
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    bool multiTest = false;

    int t;    
    if (multiTest) {
        cin >> t;
    } else {
        t = 1;
    }

    for (int test = 1; test <= t; test++) {
        solve(test, cin, cout);
    }

    return 0;
}