UVa540

#include<queue>
#include<cstdio>
#include<map>
using namespace std;
const int maxn=1005;



int main(){
	freopen("UVa540.in","r",stdin);
	freopen("UVa540.out","w",stdout);
	int kase=0;int n;
	while(scanf("%d",&n)==1&&n!=0){
		++kase;
		printf("Scenario #%d",kase);
		queue<int> q1,q2[maxn];
		map<int,int> tea;
		for(int i=1;i<=n;i++){
			int nn;
			scanf("%d",&nn);
			for(int j=0;j<nn;j++){
				int k;
				scanf("%d",&k);
				tea[k]=i;
			} 
		}
		
		char zhiling[8];
		for(;;){
		scanf("%s",zhiling);
		if(zhiling[0]=='S')break;
		else if(zhiling[0]=='D'){
			int t=q1.front();
			printf("\n%d",q2[t].front());
			q2[t].pop();
			if(q2[t].empty())q1.pop();
		}
		else if(zhiling[0]=='E'){
			int xx;
			scanf("%d",&xx); 
			int tt;
			tt=tea[xx];
			if(q2[tt].empty())q1.push(tt);
			q2[tt].push(xx);			 
		}
	}
	printf("\n\n");
}
fclose(stdin);
fclose(stdout);
return 0;
}