#include using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return std::vector(arg, init); else return std::vector(arg, vec(init, args...)); } template auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template > T &chmin(T &l, T r, Compare &&f = less()) { return l = min(l, r, f); } template > T &chmax(T &l, T r, Compare &&f = less()) { return l = max(l, r, f); } #include using rep = array; rep op(rep x, rep y) { rep z = {}; for (int i = 0; i < size(x); ++i) { z[i] = y[x[i]]; } return z; } rep elem() { constexpr auto e = [] { rep r = {}; for (int i = 0; i < size(r); ++i) { r[i] = i; } return r; }(); return e; } using segtree = atcoder::segtree; int main() { int n, m, q; cin >> n >> m >> q; segtree seg(m); while (q--) { int t; cin >> t; if (t == 1) { int d; cin >> d; --d; auto r = elem(); for (int i = 0; i < n; ++i) { int p; cin >> p; r[i] = p - 1; } seg.set(d, r); continue; } if (t == 2) { int s; cin >> s; auto r = seg.prod(0, s); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (r[j] == i) { cout << (i != 0 ? " " : "") << j + 1; } } } cout << endl; continue; } if (t == 3) { int s, t; cin >> s >> t; --s; auto r = seg.prod(s, t); int ans = 0; for (int i = 0; i < n; ++i) { ans += abs(i - r[i]); } cout << ans << endl; continue; } } }