#include <iostream>
#include <vector>
#include "testlib.h"
using namespace std;

template <typename T>
struct SegTree {
    const T INF = numeric_limits<T>::max();
    int n, m;
    vector<vector<T>> dat;
    SegTree(int n_, int m_) : dat(n_ * 4, vector<T>(m_, 0)) {
        int x = 1;
        while (n_ > x) {
            x *= 2;
        }
        n = x;
        m = m_;
    }
    void init() {
        for (int i = 0; i < 2 * n - 1; i++) {
            for (int j = 0; j < m; j++) {
                dat[i][j] = j;
            }
        }
    }
    void update(int i, vector<T> x) {
        i += n - 1;
        for (int j = 0; j < m; j++) dat[i][j] = x[j];
        while (i > 0) {
            i = (i - 1) / 2;
            for (int j = 0; j < m; j++) dat[i][j] = dat[i * 2 + 2][dat[i * 2 + 1][j]];
        }
    }
    vector<T> query(int a, int b) {
        return query_sub(a, b, 0, 0, n);
    }
    vector<T> query_sub(int a, int b, int k, int l, int r) {
        vector<T> x(m);
        if (r <= a || b <= l) {
            for (int i = 0; i < m; i++) x[i] = i;
        }
        else if (a <= l && r <= b) {
            for (int i = 0; i < m; i++) x[i] = dat[k][i];
        }
        else {
            vector<T> vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
            vector<T> vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
            for (int i = 0; i < m; i++) x[i] = vr[vl[i]];
        }
        return x;
    }
};

int main() {
    registerValidation();
    long long N = inf.readLong((long long)2, (long long)18, "N");
    inf.readSpace();
    long long M = inf.readLong((long long)2, (long long)10000, "M");
    inf.readSpace();
    long long Q = inf.readLong((long long)2, (long long)50000, "Q");
    inf.readEoln();
    SegTree<long long> Seg(M, N);
    Seg.init();
    long long max_ = -1;
    for (int i = 0; i < Q; i++) {
        int com = inf.readInt(1, 3);
        if (com == 1) {
            inf.readSpace();
            long long B = inf.readLong((long long)1, M, "B");
            if (B > max_ + 2) cout << -1 << endl;
            else max_ = max(max_, B - 1);
            vector<long long> P(N);
            for (int j = 0; j < N; j++) {
                inf.readSpace();
                P[j] = inf.readLong((long long)1, N, "P");
            }
            for (int j = 0; j < N; j++) P[j]--;
            vector<bool> flag(N, false);
            for (int j = 0; j < N; j++) {
                if (flag[P[j]]) cout << -1 << endl;
                else flag[P[j]] = true;
            }
            Seg.update(B - 1, P);
        }
        if (com == 2) {
            inf.readSpace();
            long long S = inf.readLong((long long)1, M, "S");
            if (S - 1 > max_) cout << -1 << endl;
            auto x = Seg.query(0, S);
            vector<long long> y(N);
            for (int j = 0; j < N; j++) y[x[j]] = j;
            cout << y[0] + 1;
            for (int j = 1; j < N; j++) cout << " " << y[j] + 1;
            cout << endl;
        }
        if (com == 3) {
            inf.readSpace();
            long long a = inf.readLong((long long)1, M, "L");
            inf.readSpace();
            long long b = inf.readLong(a, M, "R");
            if (b - 1 > max_) cout << -1 << endl;
            auto x = Seg.query(a - 1, b);
            long long count = 0;
            for (int j = 0; j < N; j++) count += abs(x[j] - j);
            cout << count << endl;
        }
        inf.readEoln();
    }
    inf.readEof();
}