#include<cstdio>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<queue>

#include<map>

using namespace std;

int read(){

    char ch=getchar();int f=,t=;

    while (ch<''||ch>'') {if (ch=='-') f=-;ch=getchar();}

    while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}

    return t*f;

}

int main(){

    int n,T=;

    while (scanf("%d",&n)!=EOF&&n!=){

        printf("Scenario #%d\n",++T);

        map<int,int>mp;

        for (int i=;i<=n;i++){

            int x=read();

            while (x--){

                mp[read()]=i;

            }

        }

        queue<int> qAll,qTeam[];

        char s[];

        scanf("%s",s);

        while (s[]!='S'){

            if (s[]=='E'){

                int x=read();

                int y=mp[x];

                if (qTeam[y].empty()) qAll.push(y);

                qTeam[y].push(x);

            }else if (s[]=='D'){

                int x=qAll.front();

                printf("%d\n",qTeam[x].front());qTeam[x].pop();

                if (qTeam[x].empty()) qAll.pop();

            }

            scanf("%s",s);

        }

        printf("\n");

    }

}