#include<bits/stdc++.h>
using namespace std;
int n,m,q,l,C[105][105],now_player=1;
struct player{long long money;int where;};
struct node{int building_level,a,d,whose;};
player p[3];
node Map[105];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n>>m>>q>>l;
for(int i=1;i<=n;i++)
for(int j=0;j<l;j++) cin>>C[i][j];
for(int i=1;i<=n;i++) cin>>Map[i].d;
p[1].money=p[2].money=m;
p[1].where=p[2].where=1;
int temp,k,hh=0;
while(cin>>temp>>k)
{
if(temp==1)
{
for(int i=1;i<=k;i++)
{
p[now_player].where=p[now_player].where%n+1;
int pos=p[now_player].where;
if(Map[pos].whose==now_player) p[now_player].money+=Map[pos].a;
else if(Map[pos].whose!=0)
{
p[now_player].money-=Map[pos].a;
p[3-now_player].money+=Map[pos].a;
}
for(int i=1;i<=2;i++)
{
if(p[i].money<0)
{
cout<<((i==1)?"Renko":"Merry");
return 0;
}
}
}
hh++;
if(hh%2==0)
{
for(int i=1;i<=n;i++) if(Map[i].whose) p[Map[i].whose].money+=Map[i].d;
for(int i=1;i<=2;i++)
{
if(p[i].money<0)
{
cout<<((i==1)?"Renko":"Merry");
return 0;
}
}
}
now_player=3-now_player;
}
else
{
int pos=p[now_player].where;
if(Map[pos].whose==now_player||Map[pos].whose==0)
{
for(int i=1;i<=k&&Map[pos].building_level<l;i++)
{
if(p[now_player].money>=C[pos][Map[pos].building_level])
{
Map[pos].whose=now_player;
p[now_player].money-=C[pos][Map[pos].building_level];
Map[pos].a+=C[pos][Map[pos].building_level];
Map[pos].building_level++;
for(int i=1;i<=2;i++)
{
if(p[i].money<0)
{
cout<<((i==1)?"Renko":"Merry");
return 0;
}
}
}
else break;
}
}
}
}
cout<<p[1].money<<' '<<p[2].money;
return 0;
}