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

void solve(){
    long int n, q, x, index, menor;
    cin >> n >> q;
    vector<int> v;
    for(int i = 0; i < n; i++){
        cin >> x;
        v.push_back(x);
    }
    for(int j = 0; j < q; j++){
        int query, r, l;
        cin >> query >> l >> r;
        if(query == 1){
            swap(v[l - 1], v[r - 1]);
        } else{
            index = l - 1;
            menor = v[l - 1];
            for(int i = l - 1; i < r; i++){
                if(v[i] < menor){
                    menor = v[i];
                    index = i + 1;
                }
            }
            cout << index << endl;
        }
    }
}

int main(){
    solve();
    return 0;
}