#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

vector <int> v, sol;

int main ()
{
   // freopen ("file.in", "r", stdin);

    int m;
    scanf ("%d", &m);

    for (; m; --m)
    {
        int op, val;
        scanf ("%d", &op);

        if (op != 2) scanf ("%d", &val);

        if (op == 1) v.push_back (val);
        else if (op == 2 && !v.empty ()) v.pop_back ();
        else if (v.size () == 0) printf ("Empty\n");
        else
        {
            sol.clear ();

            bool OK = false;
            for (int i = 0; i < v.size (); ++i)
                if (v[i] <= val)
                {
                    OK = true;
                    sol.push_back (v[i]);
                }

            for (int i = 0; i < (int)sol.size () - 1; ++i)
                printf ("%d ", sol[i]);

            if (!OK) printf ("Empty");
            else printf ("%d", sol.back ());

            printf ("\n");
        }
    }

    return 0;
}