1 #include <iostream>
 2 #include <iterator>
 3 #include <list>
 4 #include <vector>
 5 using namespace std;
 6 list<int> & FindList(vector<list<int> > & l, int id) {
 7     int tmp = l.size();
 8     if (tmp> 0) {
 9         vector<list<int> >::iterator i;
10         i = l.begin();
11         return *(i + id - 1);
12     }
13 };
14 int main() {
15     int n;
16     cin>>n;
17     vector<list<int> > a;
18     for (int i = 0; i < n; ++i) {
19         string s;
20         cin >> s;
21         if (s == "new") {
22             int id;
23             cin >> id;
24             a.push_back(list<int>());
25         } else if (s == "add") {
26             int id, num;
27             cin >> id >> num;
28             list<int> &temp = FindList(a, id);
29             temp.push_back(num);
30             temp.sort();
31         } else if (s == "merge") {
32             int id1, id2;
33             cin >> id1 >> id2;
34             list<int> &temp1 = FindList(a, id1);;
35             list<int> &temp2 = FindList(a, id2);;
36             temp1.merge(temp2);
37         } else if (s == "unique") {
38             int id;
39             cin >> id;
40             list<int> &temp = FindList(a, id);
41             temp.unique();
42         } else if (s == "out") {
43             int id;
44             cin >> id;
45             list<int> &temp = FindList(a, id);
46             temp.sort();
47             if (temp.size() > 0) {
48                 list<int>::iterator i;
49                 for(i=temp.begin(); i != temp.end(); ++i) {
50                     cout << *i << " ";
51                 }
52             }
53             cout << endl;
54         }
55     }
56     return 0;
57 }