#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,pair<int,int>>>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 1000000000

int n=1;
vector<vector<int>> order;
vector<int> order_base;
vector<int> solve(int a,int b,int i,int left,int right){
  if(a<=left&&right<=b){
    return order[i];
  }
  if(b<=left||right<=a){
    return order_base;
  }
  vector<int> vec1=solve(a,b,2*i+1,left,(left+right)/2);
  vector<int> vec2=solve(a,b,2*i+2,(left+right)/2,right);
  int N=order[i].size();
  vector<int> ret(N);
  for(int j=0;j<N;j++){
    ret[j]=vec2[vec1[j]];
  }
  return ret;
}
void update(int d,vector<int> &P){
  d+=n-1;
  for(int j=0;j<P.size();j++){
    order[d][j]=P[j];
  }
  while(d>0){
    d=(d-1)/2;
    for(int j=0;j<P.size();j++){
      order[d][j]=order[2*d+2][order[2*d+1][j]];
    }
  }
}

int main(){
  int N,M,Q;
  cin>>N>>M>>Q;
  while(n<M){
    n<<=1;
  }
  order.resize(2*n-1);
  for(int i=0;i<2*n-1;i++){
    order[i].resize(N);
    for(int j=0;j<N;j++){
      order[i][j]=j;
    }
  }
  order_base.resize(N);
  for(int j=0;j<N;j++){
    order_base[j]=j;
  }

  for(int i=0;i<Q;i++){
    int q;
    cin>>q;
    if(q==1){
      int D;
      vector<int> P(N);
      cin>>D;
      D--;
      for(int j=0;j<N;j++){
        cin>>P[j];
        P[j]--;
      }
      update(D,P);
    }else if(q==2){
      int S;
      cin>>S;
      vector<int> P=solve(0,S,0,0,n);
      for(int j=0;j<N;j++){
        for(int k=0;k<N;k++){
          if(P[k]==j){
            cout<<k+1<<" ";
            break;
          }
        }
      }
      cout<<endl;
    }else{
      int L,R;
      cin>>L>>R;
      L--;
      vector<int> P=solve(L,R,0,0,n);
      int ans=0;
      for(int i=0;i<N;i++){
        ans+=abs(i-P[i]);
      }
      cout<<ans<<endl;
    }
  }
}