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

#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;

class UnionFind
{
public:
    vector<ll> par;
    vector<ll> siz;

    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL)
    {
        for (ll i = 0; i < sz_; ++i)
            par[i] = i;
    }
    void init(ll sz_)
    {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i)
            par[i] = i;
    }

    ll root(ll x)
    {
        while (par[x] != x)
        {
            x = par[x] = par[par[x]];
        }
        return x;
    }

    bool merge(ll x, ll y)
    {
        x = root(x);
        y = root(y);
        if (x == y)
            return false;
        if (siz[x] < siz[y])
            swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y)
    {
        return root(x) == root(y);
    }

    ll size(ll x)
    {
        return siz[root(x)];
    }
};

ll modpow(ll a, ll p)
{
    if (p == 0)
        return 1;
    if (!(p % 2))
    {
        ll halfP = p / 2;
        ll half = modpow(a, halfP);
        return half * half % mod;
    }
    else
    {
        return a * modpow(a, p - 1) % mod;
    }
}

ll comb(int a, int b)
{
    if (b > a - b)
        return comb(a, a - b);
    ll ansMul = 1;
    ll ansDiv = 1;
    for (int i = 0; i < b; i++)
    {
        ansMul *= a - i;
        ansDiv *= i + 1;
        ansMul %= mod;
        ansDiv %= mod;
    }
    ll ans = ansMul * modpow(ansDiv, mod - 2) % mod;
    return ans;
}

/*
int num = 200010;
vector<ll> fact(num), ifact(num);
fact[0] = 1;
fact[1] = 1;
for (int i = 2; i < num; i++) {
    fact[i] = fact[i-1] * i;
    fact[i] %= mod;
}
for (int i = 0; i < num; i++) {
    ifact[i] = modpow(ifact[i], mod-2);
    ifact[i] %= mod;
}
*/

int const inf = INT_MAX;

struct SegmentTree {
private:
    int n;
    vector<pair<int, int>> node;
public:
    SegmentTree(vector<pair<int, int>> v) {
        int sz = v.size();
        n = 1;
        // 2の累乗の大きさにする
        while (n < sz) n *= 2;
        // 余りをinfで埋める
        //node.resize(2*n-1, inf);
        node.resize(2*n-1);
        rep(i, 2*n-1) {
            node[i].first = inf;
            node[i].second = -1;
        }
        // 葉を構築
        for (int i = 0; i < sz; i++) {
            node[i+n-1].first = v[i].first;
            node[i+n-1].second = v[i].second;
        }
        // 親を構築
        for (int i = n - 2; i >= 0; i--) {
            if (node[2*i+1].first < node[2*i+2].first) {
                node[i].first = node[2*i+1].first;
                node[i].second = node[2*i+1].second;
            } else {
                node[i].first = node[2*i+2].first;
                node[i].second = node[2*i+2].second;
            }
            //node[i].first = min(node[2*i+1].first, node[2*i+2].first);
        }
    }

    void update(int x, int val, int ind) {
        x += (n - 1);
        node[x].first = val;
        node[x].second = ind;
        while (x > 0) {
            x = (x - 1) / 2;
            if (node[2*x+1].first < node[2*x+2].first) {
                node[x].first = node[2*x+1].first;
                node[x].second = node[2*x+1].second;
            } else {
                node[x].first = node[2*x+2].first;
                node[x].second = node[2*x+2].second;
            }
            //node[x].first = min(node[2*x+1].first, node[2*x+2].first);
        }
    }

    pair<int, int> getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0) r = n;
        if (r <= a || b <= l) {
            pair<int, int> c = make_pair(inf, -1);
            return c;
        }
        if (a <= l && r <= b) return node[k];
        pair<int, int> vl = getmin(a, b, 2*k+1, l, (l+r) / 2);
        pair<int, int> vr = getmin(a, b, 2*k+2, (l+r) / 2, r);
        if (vl.first > vr.first) {
            return vr;
        } else {
            return vl;
        }
    }
};

int main() {
    int N, Q; cin >> N >> Q;
    vector<pair<int, int>> a(N);
    rep(i, N) {
        int x; cin >> x;
        a[i] = make_pair(x, i+1);
    }
    SegmentTree seg(a);
    rep(_, Q) {
        int k, l, r; cin >> k >> l >> r;
        if (k == 1) {
            seg.update(l, a[r].first, r);
            seg.update(r, a[l].first, l);
        } else {
            pair<int, int> z = seg.getmin(l, r+1);
            cout << z.second << endl;
        }
    }
    return 0;
}