#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4");
//#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 = 1e17;
//const int mod = 2600000069;
//const int p = 179;
const int MAXN = 1e4 + 1;

mt19937 my_rand(1329);

struct node {
    int y = my_rand(), size = 0, val = 0;
    node *l = nullptr;
    node *r = nullptr;
    node *nxt = nullptr;
    node() {
        size = 1;
    }
};

typedef node* pnode;
typedef pair<pnode, pnode> Pair;

pnode root = nullptr;
vector<node> a(MAXN);
vector<pnode> p(MAXN);

int gs(pnode a) {
    if (a) return a->size;
    return 0;
}

void update(pnode a) {
    a->size = 1 + gs(a->l) + gs(a->r);
}

pnode merge(pnode a, pnode b) {
    if (!a) return b;
    if (!b) return a;
    if (a->y > b->y) {
        a->r = merge(a->r, b);
        update(a);
        return a;
    } else {
        b->l = merge(a, b->l);
        update(b);
        return b;
    }
}

void split(pnode a, int k, pnode &l, pnode &r) {
    if (!a) {
        l = r = nullptr;
        return;
    }
    if (gs(a->l) >= k) {
        split(a->l, k, l, r);
        a->l = r;
        update(a);
        r = a;
    } else {
        split(a->r, k - gs(a->l) - 1, l, r);
        a->r = l;
        update(a);
        l = a;
    }
}

pnode left_most(pnode a) {
    if (!a) return nullptr;
    if (a->l) return left_most(a->l);
    return a;
}

pnode right_most(pnode a) {
    if (!a) return nullptr;
    if (a->r) return right_most(a->r);
    return a;
}

void ch(int l1, int r1, int l2, int r2) {
    Pair p1, p2, p3, p4;
    split(root, r2, p4.first, p4.second);
    split(p4.first, l2 - 1, p3.first, p3.second);
    split(p3.first, r1, p2.first, p2.second);
    split(p2.first, l1 - 1, p1.first, p1.second);
    pnode q = right_most(p1.first);
    if (q) q->nxt = left_most(p3.second);
    q = right_most(p1.second);
    if (q) q->nxt = left_most(p4.second);
    q = right_most(p3.second);
    if (p2.second) {
        q->nxt = left_most(p2.second);
        q = right_most(p2.second);
        q->nxt = left_most(p1.second);
    } else {
        q->nxt = left_most(p1.second);
    }
    root = merge(merge(p1.first, p3.second), merge(merge(p2.second, p1.second), p4.second));
}

int x, first, second, third;

void ans() {
    pnode q = p[x - 1];
    first = second = third = -1;
    if (q->nxt) {
        first = q->nxt->val;
        if (q->nxt->nxt) {
            second = q->nxt->nxt->val;
            if (q->nxt->nxt->nxt) {
                third = q->nxt->nxt->nxt->val;
            }
        }
    }
    cout << first << " " << second << " " << third << "\n";
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    pnode q = nullptr, lst = nullptr;
    for (int i = 0; i < n; i++) {
        cin >> x;
        q = &a[x - 1];
        q->val = x;
        p[x - 1] = q;
        if (lst) lst->nxt = q;
        root = merge(root, q);
        lst = q;
    }
    int t, l1, r1, l2, r2;
    for (int i = 0; i < m; i++) {
        cin >> t;
        if (t == 2) {
            cin >> x;
            ans();
        } else {
            cin >> l1 >> r1 >> l2 >> r2;
            ch(l1, r1, l2, r2);
        }
    }
}
/*

*/