#include <iostream> #include <string> #include <queue> #include <set> using namespace std; #define MaxLen 100 int main(){ set<int> group[MaxLen]; queue<int> subgroupQueue[MaxLen]; queue<queue<int>*> totalQueue; int cases; cin>>cases; for(int i=0;i<cases;i++){ int setNum; cin>>setNum; for(int j=0;j<setNum;j++){ int temp; cin>>temp; group[i].insert(temp); } } string s; int current; cin>>s; while(s!="STOP"){ if(s=="ENQUEUE"){ cin>>current; for(int i=0;i<cases;i++){ if(group[i].find(current)!=group[i].end()){ if(subgroupQueue[i].empty()) totalQueue.push(&subgroupQueue[i]); subgroupQueue[i].push(current); } } }else{ totalQueue.front()->pop(); if(totalQueue.front()->empty()) totalQueue.pop(); } cin>>s; } while(!totalQueue.empty()){ cout<<totalQueue.front()->front(); totalQueue.front()->pop(); if(totalQueue.front()->empty()) totalQueue.pop(); if(!totalQueue.empty()) cout<<' '; } }