#include <iostream>
#include <deque>
int main() {
  int t, n1, n2, x, cases = 0, i;
  char cmd[10];
  while (std::cin >> t && t) {
    std::cout << "Scenario #" << ++cases << '\n';
    int team[1000000] = {};
    std::deque<int> dq;
    for (i = 1; i <= t; ++i) {
      std::cin >> n1;
      while (n1-- && scanf("%d", &n2) != EOF) {
        team[n2] = i;
      }
    }
    while (std::cin >> cmd && cmd[0] != 'S') {
      switch (cmd[0]) {
        case 'D': {
          std::cout << dq.front() << '\n';
          dq.pop_front();
          break;
        }
        case 'E': {
          std::cin >> x;
          for (i = dq.size() - 1; i >= 0; --i) {
            if (team[dq[i]] == team[x]) break;
          }
          if (i < 0) {
            dq.push_back(x);
          } else {
            dq.insert(dq.begin() + i + 1, x);
          }
        }
      }
    }
    puts("");
  }
  return 0;
}