#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>


#pragma GCC optimize("Ofast,no-stack-protector")
#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")


#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;

struct help {
    int max, ind;
    help(int max_, int ind_) {
        max = max_;
        ind = ind_;
    }
    help() {
        max = -1;
        ind = -2;
    }
};

help merge(help a, help b) {
    help c;
    if (a.max > b.max) {
        c.max = a.max;
        c.ind = a.ind;
    } else if (a.max < b.max) {
        c.max = b.max;
        c.ind = b.ind;
    } else {
        c.max = a.max;
        c.ind = min(a.ind, b.ind);
    }
    return c;
}

vector<help> t;
vector<int> a;

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

help get_ans(int v, int l, int r, int pos, int val) {
    if (r - l == 1) {
        if (t[v].max >= val && l >= pos) {
            return t[v];
        } else {
            return help(-1, -2);
        }
    }
    if (r <= pos) {
        return help(-1, -2);
    }
    int m = (l + r) / 2;
    help first = get_ans(2 * v + 1, l, m, pos, val), second = get_ans(2 * v + 2, m, r, pos, val);
    if (first.ind == -2) {
        return second;
    }
    return first;
}

void update(int v, int l, int r, int pos, int val) {
    if (r - l == 1) {
        t[v].max = val;
        t[v].ind = pos;
        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] = merge(t[2 * v + 1], t[2 * v + 2]);
}

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