#include <bits/stdc++.h>
using namespace std;
#define pb push_back

const int N=205;
const char st[7]={'L','O','W','I','E','C','R'};
int n,m,K,cnt=0,t[N][2],idx=0;
struct Nod{
  int op,h,x,y;
}a[N*N*N];
vector<int> G[N];
string T;

int Op(string T){
  for(int i=0;i<7;i++) if(T[1]==st[i]) return i;
  return -1;
}

int readin(){
  Nod &v=a[++idx];
  int nw=idx;
  cin>>T;v.op=Op(T);
  if(v.op==1) cin>>v.h>>v.x;
  else if(v.op==2) cin>>v.h>>v.x>>v.y,--v.x,--v.y;
  else if(v.op==3) cin>>v.h>>v.x,--v.x;
  else if(v.op==4){
    cin>>v.h>>v.x;--v.x;
    v.y=readin();
  }else if(v.op==5) cin>>v.h;
  else if(v.op==6){
    cin>>T;
    v.h=Op(T),v.x=readin();
  }
  return nw;
}

void init(){
  for(int i=0;i<n;i++){
    cin>>t[i][0]>>t[i][1];
    for(int j=0;j<m;j++) G[i].pb(readin());
  }
}

void rev(int &id){
  if(a[id].op!=6){
    a[++idx]=a[id];
    a[idx].h^=1;
  }else{
    a[++idx]=a[a[id].x];
    a[idx].h^=1;
    a[++idx]=a[id];
    a[idx].x=idx-1;
  }
  id=idx;
}

bool DO(int id);

bool wrk(int id,Nod v,int tp=0){
  if(cnt>=K) return false;
  if(v.op==6) return true;
  bool fl=true;
  
  int op=v.op,h=v.h,x=v.x,y=v.y;
  
  assert(op>=0&&op<6);
  
  ++cnt;
  
  if(op==0) cout<<"Robot "<<id<<" slacks off.\n";
  else if(op==1){
    t[id][h]=(t[id][h]+x)%n;
    cout<<"Robot "<<id<<" moves its "<<(h==0?"left":"right")<<" hand towards Robot "<<t[id][h]<<".\n";
  }else if(op==2){
    swap(G[id][y],G[t[id][h]][x]);
    cout<<"Robot "<<id<<" swaps a line of command with Robot "<<t[id][h]<<".\n";
  }else if(op==3){
    rev(G[t[id][h]][x]);
    cout<<"Robot "<<id<<" modifies a line of command of Robot "<<t[id][h]<<".\n";
  }else if(op==4){
    G[t[id][h]][x]=y;
    cout<<"Robot "<<id<<" replaces a line of command of Robot "<<t[id][h]<<".\n";
  }else if(op==5){
    cout<<"Robot "<<id<<" activates Robot "<<t[id][h]<<".\n";
    fl&=DO(t[id][h]);
  }
  
  int to=t[id][1];
  if(to==id) return fl;
  
  for(int i=0;i<m;i++) if(a[G[to][i]].op==6){
    if(a[G[to][i]].h==op||(a[G[to][i]].h==6&&tp)){
      fl&=wrk(to,a[a[G[to][i]].x],1);
      break;
    }
  } 
  return fl;
}

bool DO(int id){
  for(int i=0;i<m;i++)
    if(!wrk(id,a[G[id][i]])) return false;
  return true;
}

int main(){
  /*2024.10.24 H_W_Y P9966 [THUPC 2024 初赛] 机器人 大模拟*/ 
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  cin>>n>>m>>K;init();
  
  int id=0;
  while(DO(id)) id=(id+1)%n;

  return 0;
}