#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <numeric>
#include <vector>
#include <climits>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

using S = pair<int,int>;

S op(S a, S b) {
    if(a.second > b.second) return a;
    else b;
}

S e(){
    return make_pair(0, 0);
}

int main() {
    int n, q;
    cin >> n >> q;

    vector<pair<int,int>> a;

    rep(i, n) {
        int x;
        cin >> x;
        a.emplace_back(i + 1, x);
    }

    segtree<S , op, e> seg(a);

    cout << "~~~~~~~~~~~~~a" << endl;
    for(auto [i, j] : a) {
        cout << i << " " << j << endl;
    }

    cout << "~~~~~~~~~~~~~a" << endl;
    vector<int> ans;

    rep(i, q) {
        int j, l, r;
        cin >> j >> l >> r;
        cout << "~~~~~~~~~~~~~~~" << endl;
        rep(j, n + 1) {
            cout << seg.get(j).first << " " << seg.get(j).second << endl;
        }
        cout << "~~~~~~~~~~~~~~~" << endl;
        cout << "all : " << seg.all_prod().first << " " << seg.all_prod().second << endl;
        if(j == 1) {
            l--;
            r--;
            auto a = seg.get(l);
            auto b = seg.get(r);
            a.first = r + 1;
            b.first = l + 1;
            seg.set(l, b);
            seg.set(r, a);
        }else{
            l--;
            ans.push_back(seg.prod(l, r).first);
        }
    }

    for(auto i : ans) cout << i << endl;


    return 0;
}