#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)

// #define rep(i,...) for(auto i:range(__VA_ARGS__)) 
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
#if __cplusplus>=201703L
    template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#endif
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
#if __cplusplus>=201703L
    constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#endif

template<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}
template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}
template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}
template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}
#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);
#line 3 "cpplib/alga/maybe.hpp"

/**
 * @brief Maybe
 * @see https://ja.wikipedia.org/wiki/%E3%83%A2%E3%83%8A%E3%83%89_(%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0)#Maybe%E3%83%A2%E3%83%8A%E3%83%89
 */

template<typename T>
struct maybe{
    bool _is_none;
    T val;
    maybe():_is_none(true){}
    maybe(T val):_is_none(false),val(val){}
    T unwrap()const{
        assert(!_is_none);
        return val;
    }
    T unwrap_or(T e)const{
        return _is_none?e:val;
    }
    bool is_none()const{return _is_none;}
    bool is_some()const{return !_is_none;}
};

template<typename T,typename F>
auto expand(F op){
    return [&op](const maybe<T>& s,const maybe<T>& t)->maybe<T>{
        if(s.is_none())return t;
        if(t.is_none())return s;
        return maybe<T>(op(s.unwrap(),t.unwrap()));
    };
}
#line 4 "cpplib/segment_tree/segment_tree.hpp"

/**
 * @brief セグメント木
 * @see https://en.wikipedia.org/wiki/Segment_tree
 */

template<typename T,typename F>
class segment_tree{
    using i64=long long;
    struct node;
    using np=node*;
    struct node{
        maybe<T>val;
        np ch[2]={nullptr,nullptr};
        node(maybe<T> val=maybe<T>()):val(val){}
    };
    np root=new node();
    i64 n=1;
    i64 sz;
    F op;
	public:
    segment_tree(){}
	segment_tree(i64 sz,F op=F()):sz(sz),op(op){
		while(n<=sz)n<<=1;
	}
    maybe<T> get(i64 a,i64 b){
        return get(a,b,0,n,root);
    }
    void apply(i64 x,T val){
        apply(x,val,0,n,root);
    }
    void apply_left(i64 x,T val){
        apply_left(x,val,0,n,root);
    }
    void change(i64 x,T val){
        change(x,val,0,n,root);
    }
    maybe<T> get(i64 a,i64 b,i64 l,i64 r,np t){
        if(!t)return maybe<T>();
        auto f=expand<T,F>(op);
        if(r<=a||b<=l)return maybe<T>();
        if(a<=l&&r<=b){
            return t->val;
        }
        const i64 m=(l+r)/2;
        return f(get(a,b,l,m,t->ch[0]),get(a,b,m,r,t->ch[1]));
    }
    void apply(i64 x,T val,i64 l,i64 r,np t){
        auto f=expand<T,F>(op);
        if(!t->ch[0])t->ch[0]=new node();
        if(!t->ch[1])t->ch[1]=new node();
        if(l<=x&&x<r){
            t->val=f(t->val,val);
            const i64 m=(l+r)/2;
            if(r-l>1){
                apply(x,val,l,m,t->ch[0]);
                apply(x,val,m,r,t->ch[1]);
            }
        }
    }
    void apply_left(i64 x,T val,i64 l,i64 r,np t){
        if(!t->ch[0])t->ch[0]=new node();
        if(!t->ch[1])t->ch[1]=new node();
        auto f=expand<T,F>(op);
        if(l<=x&&x<r){
            t->val=f(val,t->val);
            i64 m=(l+r)/2;
            if(r-l>1){
                apply_left(x,val,l,m,t->ch[0]);
                apply_left(x,val,m,r,t->ch[1]);
            }
        }
    }
    maybe<T> change(i64 x,const T& val,i64 l,i64 r,np t){
        if(!t->ch[0])t->ch[0]=new node();
        if(!t->ch[1])t->ch[1]=new node();
        auto f=expand<T,F>(op);
        if(l<=x&&x<r){
            if(r-l>1){
                const i64 m=(l+r)/2;
                auto p=change(x,val,l,m,t->ch[0]);
                auto q=change(x,val,m,r,t->ch[1]);
                return t->val=f(p,q);
            }else{
                return t->val=val;
            }
        }
        return t->val;
    }
};

template<typename T>
struct MAX_F{
    T operator()(const T& s,const T& t){
        return max(s,t);
    }
};
template<typename T>using max_seg=segment_tree<T,MAX_F<T>>;
#line 3 "code.cpp"

int main(){
    lint n,m,q;
    cin>>n>>m>>q;
    auto f=[&](const auto& s,const auto& t){
        vec res(s.size());
        rep(i,s.size())res[i]=s[t[i]];
        return res;
    };
    segment_tree<vec,decltype(f)>seg(m,f);
    vec a(n);
    rep(j,n)a[j]=j;
    rep(i,q){
        lint que;
        cin>>que;
        if(que==1){
            lint pos;
            cin>>pos;
            pos--;
            vec b(n);
            rep(j,n){
                lint x;
                cin>>x;
                x--;
                b[x]=j;
            }
            seg.change(pos,b);
            rep(j,m){
                auto res=seg.get(0,j+1).unwrap_or(a);
            }
        }else if(que==2){
            lint pos;
            cin>>pos;
            auto res=seg.get(0,pos).unwrap_or(a);
            rep(j,n){
                res[j]++;
            }
            output(res);
        }else if(que==3){
            lint l,r;
            cin>>l>>r;
            l--;
            vec a(n);
            rep(j,n)a[j]=j;
            auto res=seg.get(l,r).unwrap_or(a);
            lint ans=0;
            rep(j,n)ans+=abs(res[j]-j);
            cout<<ans<<endl;
        }
    }
}