#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};
const int MAX_N = 200000;

template<typename T> class RMQ {
    public:
    int n;
    T inf = INT_MAX;
    T data[4*MAX_N];
    T data_idx[4*MAX_N];

    RMQ(int m, T init_value=INT_MAX){
        // 2のべき乗にする
        n = 1;
        while(n < m) n <<= 1;
        inf = init_value;
        for(int i=0;i<2*n-1;++i){
            data[i] = init_value;
            data_idx[i] = i;
        }
    }

    void update(int i, T x){
        i += n-1;
        data[i] = x;
        data_idx[i] = i;
        while(i){
            i = (i-1)/2;
            if(data[2*i+1] < data[2*i+2]) {
                data[i] = data[2*i+1];
                data_idx[i] = data_idx[2*i+1];
            } else {
                data[i] = data[2*i+2];
                data_idx[i] = data_idx[2*i+2];
            }
        }
        // for(int i=0;i<2*n-1;++i) {
        //     printf("%4d", (data[i] == inf)?-1:data[i]);
        // }
        // printf("\n");
        // for(int i=0;i<2*n-1;++i) {
        //     printf("%4d", data_idx[i]);
        // }
        // printf("\n\n");
    }

    T find(int s, int t, int k, int kl, int kr){
        if(kr <= s || t <= kl) return 2*n-2;
        if(s <= kl && kr <= t) return data_idx[k];
        int kc = (kl+kr)/2;
        T vl = find(s, t, 2*k+1, kl, kc);
        T vr = find(s, t, 2*k+2, kc, kr);
        if(data[vl] < data[vr]) {
            // cerr << "find(" << kl << ", " << kr << ") = " << vl << endl;
            return vl;
        } else {
            // cerr << "find(" << kl << ", " << kr << ") = " << vr << endl;
            return vr;
        }
    }

    // [s, t) の最小値
    T find(int s, int t) {
        return find(s, t, 0, 0, n);
    }
};

int main() {
    std::ios::sync_with_stdio(false); cin.tie(0);
    int n, q, a, query, l, r;
    cin >> n >> q;
    RMQ<int> tree(n+3);
    for(int i=0;i<n;++i) {
        cin >> a;
        tree.update(i, a);
    }
    tree.update(n, INT_MAX);

    for(int i=0;i<q;++i) {
        cin >> query >> l >> r;
        --l; --r;
        if(query == 1) {
            int tmp = tree.data[tree.find(l, l+1)];
            tree.update(l, tree.data[tree.find(r, r+1)]);
            tree.update(r, tmp);
        } else {
            cout << tree.find(l, r+1) - tree.n + 1 + 1 << endl;
        }
    }
}