import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// T: monoid
// op: T * T -> T
// query(a, b): returns t_a ... t_{b-1}
class SegmentTree(T, alias op) {
  import std.functional : binaryFun;
  alias opFun = binaryFun!op;
  T idT;

  int n;
  T[] ts;
  this(int n_, T idT) {
    this.idT = idT;
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[] = idT;
  }
  /*
  this(inout(T)[] ts_, const(T) idT) {
    this.idT = idT;
    const n_ = cast(int)(ts_.length);
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[0 .. n] = idT;
    ts[n .. n + n_] = ts_[];
    ts[n + n_ .. n << 1] = idT;
    build();
  }
  */
  ref T at(int a) {
    return ts[n + a];
  }
  void build() {
    foreach_reverse (a; 1 .. n) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]);
  }
  void set(int a, T val) {
    ts[a += n] = val;
    for (; a >>= 1; ) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]);
  }
  /*
  void mulL(int a, const(T) val) {
    set(a, opFun(val, ts[a + n]));
  }
  void mulR(int a, const(T) val) {
    set(a, opFun(ts[a + n], val));
  }
  */
  T query(int a, int b) {
    T prodL = idT, prodR = idT;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) prodL = opFun(prodL, ts[a++]);
      if (b & 1) prodR = opFun(ts[--b], prodR);
    }
    return opFun(prodL, prodR);
  }
}


struct T {
  int sum;
  int[] perm;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const Q = readInt();
      
      T idT;
      idT.perm = iota(N).array;
      
      T opTT(const(T) t0, const(T) t1) {
        T tt;
        tt.perm = new int[N];
        foreach (u; 0 .. N) {
          tt.perm[u] = t1.perm[t0.perm[u]];
        }
        debug {
          writeln(t0, " * ", t1, " = ", tt);
        }
        return tt;
      }
      
      auto seg = new SegmentTree!(T, opTT)(M, idT);
      
      foreach (q; 0 .. Q) {
        const typ = readInt();
        final switch (typ) {
          case 1: {
            const d = readInt() - 1;
            T t;
            t.perm = new int[N];
            foreach (u; 0 .. N) {
              t.perm[u] = readInt() - 1;
            }
            seg.set(d, t);
            debug {
              writeln("seg.ts = ", seg.ts);
            }
          } break;
          case 2: {
            const s = readInt();
            const T res = seg.query(0, s);
            auto ans = new int[N];
            foreach (u; 0 .. N) {
              ans[res.perm[u]] = u;
            }
            foreach (u; 0 .. N) {
              if (u > 0) write(" ");
              write(ans[u] + 1);
            }
            writeln;
          } break;
          case 3: {
            const l = readInt() - 1;
            const r = readInt();
            const T res = seg.query(l, r);
            int ans;
            foreach (u; 0 .. N) {
              ans += abs(u - res.perm[u]);
            }
            writeln(ans);
          } break;
        }
      }
    }
  } catch (EOFException e) {
  }
}