#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int>ev;
vector<int> op(vector<int> a, vector<int> b) {
	vector<int>v(a.size());
	rep(i, a.size()) v[i] = b[a[i]];
	return v;
}
vector<int> e() {
	return ev;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, q; cin >> n >> m >> q;
	ev.resize(n);
	rep(i, n)ev[i] = i;
	segtree<vector<int>, op, e>seg(m);

	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			int d; cin >> d; d--;
			vector<int>v(n);
			rep(i, n) { cin >> v[i]; v[i]--; }
			seg.set(d, v);
		}
		else if (2 == t) {
			int s; cin >> s; s--;
			auto v = seg.prod(0, s + 1);
			vector<int>ans(n);
			rep(i, n)ans[v[i]] = i;
			rep(i, n) {
				cout << ans[i] + 1;
				if (i != n - 1)cout << " ";
				else cout << endl;
			}
		}
		else {
			int l, r; cin >> l >> r; l--; r--;
			auto v = seg.prod(l, r + 1);
			int ans = 0;
			rep(i, n)ans += abs(i - v[i]);
			cout << ans << endl;
		}
	}
	return 0;
}