1 #include <iostream>
 2 #include <string>
 3 #include <cstdio>
 4 #include <cstring>
 5 #include <queue>
 6 #define MAX 10010
 7 using namespace std;
 8
 9 typedef struct
10 {
11     string name;
12     int rp;
13 }data;
14
15 struct cmp
16 {
17     bool operator() (data x,data y)
18     {
19         if(x.rp>y.rp) return 1;
20         else if(x.rp==y.rp && x.name<y.name) return 1;
21         return 0;
22     }
23 };
24
25 priority_queue<data,vector<data>,cmp> q[MAX];
26
27
28
29 int main()
30 {
31     int i,u,v,t,n,m;
32     data d;
33     string od;
34     //freopen("data.txt","r",stdin);
35     while(scanf("%d %d",&n,&m)!=EOF)
36     {
37         for(i=1;i<=n;i++)
38         {
39             while(!q[i].empty()) q[i].pop();
40             scanf("%d",&t);
41             while(t--)
42             {
43                 cin>>d.name>>d.rp;
44                 q[i].push(d);
45             }
46         }
47         while(m--)
48         {
49             cin>>od;
50             if(od=="GETON")
51             {
52                 cin>>u>>d.name>>d.rp;
53                 q[u].push(d);
54             }
55             else if(od=="JOIN")
56             {
57                 scanf("%d %d",&u,&v);
58                 while(!q[v].empty())
59                 {
60                     q[u].push(q[v].top());
61                     q[v].pop();
62                 }
63             }
64             else
65             {
66                 scanf("%d",&u);
67                 cout<<q[u].top().name<<endl;
68                 q[u].pop();
69             }
70         }
71     }
72     return 0;
73 }