#include<iostream>
#include<cstdio>
#include<map>
#include<queue>
using namespace std;
const int maxt = 1000+10;
int main()
{
int t,cas=1;
while(scanf("%d",&t)&&t!=0){
printf("Scenario #%d\n",cas++);
//记录
map<int,int>team; //team[x]表示编号为x的人所在的团队编号
for(int i=0;i<t;i++){
int n,x;
scanf("%d",&n);
while(n--){scanf("%d",&x);team[x]=i;}
}
//模拟
queue<int>q,q2[maxt];//q2[i]是team[i]成员的队列 ,q是team的队列
for(;;){
int x;
char cmd[10];
scanf("%s",cmd);
if(cmd[0]=='S')break;
else if(cmd[0]=='D'){
int t=q.front();
printf("%d\n",q2[t].front());
q2[t].pop();
if(q2[t].empty()) q.pop();
}
else if(cmd[0]=='E'){
scanf("%d",&x);
int t=team[x];
if(q2[t].empty()) q.push(t);//团队t进入队列
q2[t].push(x);
}
}
printf("\n");
}
return 0;
}