/* -*- coding: utf-8 -*-
 *
 * 1558.cc:  No.1558 Derby Live - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 18;
const int MAX_M = 10000;
const int MAX_E2 = 1 << 15; // = 32768

/* typedef */

typedef int vec[MAX_N];

struct Elm {
  vec ps;
  Elm(): ps() {}

  void init(int n) {
    iota(ps, ps + n, 0);
    fill(ps + n, ps + MAX_N, -1);
  }

  Elm operator+(const Elm &e) const {
    Elm r;
    for (int i = 0; i < MAX_N; i++)
      r.ps[i] = (ps[i] >= 0) ? e.ps[ps[i]] : -1;
    return r;
  }
};

Elm fop(Elm a, Elm b) { return a + b; }

template <typename T, T (*fop)(T,T), const int MAX_E2>
struct SegTreeOp {
  int e2;
  T nodes[MAX_E2], defv;
  SegTreeOp() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    fill(nodes, nodes + MAX_E2, defv);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = fop(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = fop(nodes[j * 2 + 1], nodes[j * 2 + 2]);
    }
  }

  T op_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = op_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = op_range(r0, r1, k * 2 + 2, im, i1);
    return fop(v0, v1);
  }
  T op_range(int r0, int r1) { return op_range(r0, r1, 0, 0, e2); }
};

/* global variables */

SegTreeOp<Elm,fop,MAX_E2> st;

/* subroutines */

void printvec(int n, vec v) {
  for (int i = 0; i < n; i++)
    printf("%d%c", v[i] + 1, (i + 1 < n) ? ' ' : '\n');
}

/* main */

int main() {
  int n, m, qn;
  scanf("%d%d%d", &n, &m, &qn);

  Elm e0; e0.init(n);
  st.init(m, e0);

  while (qn--) {
    int op;
    scanf("%d", &op);

    if (op == 1) {
      int d;
      scanf("%d", &d), d--;

      Elm e;
      for (int i = 0; i < n; i++) scanf("%d", e.ps + i), e.ps[i]--;
      fill(e.ps + n, e.ps + MAX_N, -1);

      st.set(d, e);
    }
    else if (op == 2) {
      int s;
      scanf("%d", &s);

      Elm e = st.op_range(0, s);
      vec v;
      for (int i = 0; i < n; i++) v[e.ps[i]] = i;
      printvec(n, v);
    }
    else {
      int l, r;
      scanf("%d%d", &l, &r), l--;

      Elm e = st.op_range(l, r);

      int sum = 0;
      for (int i = 0; i < n; i++) sum += abs(i - e.ps[i]);
      printf("%d\n", sum);
    }
  }
  return 0;
}