#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
//#pragma GCC optimize("O0")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

int n, m;
vector<int> a, t;

void build(int v, int l, int r) {
    if (r - l == 1) {
        t[v] = a[l];
        return;
    }
    int m = (l + r) / 2;
    build(2 * v + 1, l, m);
    build(2 * v + 2, m, r);
    t[v] = max(t[2 * v + 1], t[2 * v + 2]);
}

void update(int v, int l, int r, int pos, int val) {
    if (r - l == 1) {
        t[v] = val;
        return;
    }
    int m = (l + r) / 2;
    if (pos < m) update(2 * v + 1, l, m, pos, val);
    else update(2 * v + 2, m, r, pos, val);
    t[v] = max(t[2 * v + 1], t[2 * v + 2]);
}

int get_max(int v, int l, int r, int askl, int askr) {
    if (l >= askr || r <= askl) return 0;
    if (l >= askl && r <= askr) return t[v];
    int m = (l + r) / 2;
    return max(get_max(2 * v + 1, l, m, askl, askr), get_max(2 * v + 2, m, r, askl, askr));
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    freopen("nearandmore.in", "r", stdin);
    freopen("nearandmore.out", "w", stdout);
    cin >> n >> m;
    a.resize(n);
    t.resize(4 * n);
    for (auto& k : a) cin >> k;
    build(0, 0, n);
    int l, r, mid, t, pos, val;
    for (int i = 0; i < m; i++) {
        cin >> t >> pos >> val;
        pos--;
        if (!t) {
            update(0, 0, n, pos, val);
        } else {
            if (get_max(0, 0, n, pos, n) < val) {
                cout << -1 << "\n";
                continue;
            }
            l = pos;
            r = n;
            while (r - l > 1) {
                mid = (l + r) / 2;
                if (get_max(0, 0, n, pos, mid) >= val) r = mid;
                else l = mid;
            }
            cout << r << "\n";
        }
    }
}
/*
 4 5
 1 2 3 4
 1 1 1
 1 1 3
 1 1 5
 0 2 3
 1 1 3
 -> 1 3 -1 2
*/