#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 short
#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 = 2e9;
//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;
    bitset<10000> sub = 0;
    node *l, *r;
    node() {
        size = 1;
    }
};

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

vector<node> a(MAXN);
//int ind = 0;

pnode root = nullptr;

void update(pnode a) {
    a->size = 1;
    a->sub = 0;
    a->sub[a->val - 1] = 1;
    if (a->l) {
        a->sub |= a->l->sub;
        a->size += a->l->size;
    }
    if (a->r) {
        a->sub |= a->r->sub;
        a->size += a->r->size;
    }
}

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

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;
    }
}

void swap(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);
    root = merge(merge(p1.first, p3.second), merge(p2.second, merge(p1.second, p4.second)));
}

int x;

int gt(pnode a, int k) {
    if (a->val == x) return k + gs(a->l);
    if (a->l && a->l->sub[x - 1]) return gt(a->l, k);
    if (a->r && a->r->sub[x - 1]) return gt(a->r, k + gs(a->l) + 1);
}

int leftt;

void print(pnode a) {
    if (!a) return;
    print(a->l);
    cout << a->val << " ";
    --leftt;
    print(a->r);
}

void ans() {
    int k = gt(root, 0);
    Pair p1, p2;
    split(root, k + 4, p2.first, p2.second);
    split(p2.first, k + 1, p1.first, p1.second);
    leftt = 3;
    print(p1.second);
    for (int i = 0; i < leftt; i++) {
        cout << "-1 ";
    }
    cout << "\n";
    root = merge(merge(p1.first, p1.second), p2.second);
}

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

*/