#include using namespace std; template struct SegTree { const T INF = numeric_limits::max(); int n, m; vector> dat; SegTree(int n_, int m_) : dat(n_ * 4, vector(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 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 query(int a, int b) { return query_sub(a, b, 0, 0, n); } vector query_sub(int a, int b, int k, int l, int r) { vector 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 vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2); vector 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() { long long N, M, Q; cin >> N >> M >> Q; SegTree Seg(M, N); Seg.init(); for (int i = 0; i < Q; i++) { int com; cin >> com; if (com == 1) { long long B; cin >> B; vector P(N); for (int j = 0; j < N; j++) cin >> P[j]; for (int j = 0; j < N; j++) P[j]--; Seg.update(B - 1, P); } if (com == 2) { long long S; cin >> S; auto x = Seg.query(0, S); vector 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) { long long a, b; cin >> a >> b; 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; } } }