#include<bits/stdc++.h>
#define N ((int)1e6 + 5)

using namespace std;



int main()
{

    /// vector
    int n;
    cin>>n;
    vector < int > vec(n);
    for(int i = 0 ; i<n ; i++) cin>>vec[i];
    for(int i = 0 ; i<n ; i++) cout<<vec[i]<<" ";
    cout<<endl;
    vec.erase(vec.begin() + 3); /// O (n)
    for(int i = 0 ; i<n ; i++) cout<<vec[i]<<" ";
    cout<<endl;


    /// set
    set < int > name;
    int n;
    cin>>n;
    for(int i = 1 ; i<=n; i++){
        int a;
        cin>>a;
        name.insert(a); /// logn
    }
    set < int > :: iterator itt = name.end();
    itt--;
    while(1){
        cout<<*itt<<" ";
        if(itt == name.begin()) break;
        itt--;
    }
    cout<<endl;
    name.erase(-1); /// logn
    for(itt = name.begin() ; itt != name.end() ; itt++) cout<<*itt<<" "; /// O ( n log (n ) )
    cout<<endl;


    /// priority queue
    priority_queue < int > pqq;
    int q;
    cin>>q;
    while(q--){
        char opp;
        cin>>opp;
        if(opp == 'U'){
            int val;
            cin>>val;
            pqq.push(val);
        }
        else{
            if(pqq.empty()) cout<<"empty\n";
            else{
                cout<<pqq.top()<<endl;
                pqq.pop();
            }
        }
    } /// O ( q log(q) )
    return 0;
}