#include <iostream>
#include <cstdio>
#include <queue>
#include <map>

using namespace std;

const int N = 1010;

int main()
{
    int t, kase = 0;
    while (cin >> t && t)
    {
        printf("Scenario #%d\n", ++ kase);

        // 记录所有人的团队编号
        map<int, int> team; // team[x]表示编号为x的人所在团队的编号
        for (int i = 0; i < t; i ++ )
        {
            int n, x;2
            scanf("%d", &n);
            while (n -- )
            {
                scanf("%d", &x);
                team[x] = i;
            }
        }

        // 模拟
        queue<int> q, q2[N]; // q是团队的队列， 而q2[i]是团队i成员的队列
        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(); // 团队t全体出队列
            }
            else if (cmd[0] == 'E')
            {
                scanf("%d", &x);
                int t = team[x];
                if (q2[t].empty()) q.push(t); // 团队t进入队列
                q2[t].push(x);
            }
        }
        cout << endl;
    }
    return 0;
}