#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";}

using F=vector<int>;
F e={};//単位元
int MAX_N=131072;
std::vector<F> segment(MAX_N*2-1);

F segment_function(F a,F b){
	int n=a.size();
    vector<int> p(n);
	rep(i,n){
		p[i]=b[a[i]];
	}
	return p;
}
void pu_fanction(F &a,F b){
    a=b;
}

namespace po167{
F get(int k){return segment[k+MAX_N-1];}
F qu_sub(int a,int b,int l,int r,int k){
    if(b<=l||r<=a) return e;
    if(a<=l&&r<=b) return segment[k];
    else{
        F X=qu_sub(a,b,l,(r+l)/2,k*2+1);
        F Y=qu_sub(a,b,(l+r)/2,r,k*2+2);
        return segment_function(X,Y);
    }
}
F qu(int a,int b){return qu_sub(a,b,0,MAX_N,0);}
// get(k)=a
void replace(int k,F a){
    k+=(MAX_N-1);
    segment[k]=a;
    while(k>0){
        k--;
        k/=2;
        segment[k]=segment_function(segment[k*2+1],segment[k*2+2]);
    } 
}
//get(k) ◯ a
void pu(int k,F a){
    k+=(MAX_N-1);
    pu_fanction(segment[k],a);
    while(k>0){
        k--;
        k/=2;
        segment[k]=segment_function(segment[k*2+1],segment[k*2+2]);
    }
}
};
using namespace po167;


//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int N,M,T;
	cin>>N>>M>>T;
	rep(i,N) e.push_back(i);
	rep(i,MAX_N*2-1) segment[i]=e;
	rep(i,T){
		int t;
		cin>>t;
		if(t==1){
			vector<int> q(N);
			int x;
			cin>>x;
			rep(i,N) cin>>q[i],q[i]-=1;
			pu(x-1,q);
		}
		if(t==2){
			vector<int> ans(N);
			int x;
			cin>>x;
			auto q=qu(0,x);
			rep(i,N){
				ans[q[i]]=i;
			}
			rep(i,N){
				if(i!=0) cout<<" ";
				cout<<ans[i]+1;
			}
			cout<<"\n";
		}
		if(t==3){
			int l,r;
			cin>>l>>r;
			auto q=qu(l-1,r);
			int ans=0;
			rep(i,N) ans+=abs(q[i]-i);
			cout<<ans<<"\n";
		}
	}
	return 0;
}