The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern information technologies. As usual, each client of the bank is identified by a positive integer K and, upon arriving to the bank for some services, he or she receives a positive integer priority P. One of the inventions of the young managers of the bank shocked the software engineer of the serving system. They proposed to break the tradition by sometimes calling the serving desk with the lowest priority instead of that with the highest priority. Thus, the system will receive the following types of request:

Your task is to help the software engineer of the bank by writing a program to implement the requested serving policy.

Each line of the input contains one of the possible requests; only the last line contains the stop-request (code 0). You may assume that when there is a request to include a new client in the list (code 1), there is no other request in the list of the same client or with the same priority. An identifier K is always less than 10⁶, and a priority P is less than 10⁷. The client may arrive for being served multiple times, and each time may obtain a different priority.

For each request with code 2 or 3, the program has to print, in a separate line of the standard output, the identifier of the served client. If the request arrives when the waiting list is empty, then the program prints zero (0) to the output.

 #include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<cmath>

 #include <algorithm>

 using namespace std;

 const int maxn=1e5+;

 struct Node

 {

     Node *ch[];

     int r;

     int v;

     int id;

     Node(int v,int id):v(v),id(id){ch[]=ch[]=NULL;r=((rand()<<)|rand()); }

     inline int cmp(int x) const {

         if (x==v) return -;

         else return x>v?:;

     }

 };

 void  rotate(Node* &o,int d) {

     Node* k=o->ch[d^];

     o->ch[d^]=k->ch[d];

     k->ch[d]=o;

     o=k;

 }

 void insert(Node* &o,int x,int id) {

     if(o==NULL) {

         o=new Node(x,id);

     }

     else {

         int d=x<o->v?:;

         insert(o->ch[d],x,id);

         if(o->ch[d]->r > o->r)

         rotate(o,d^);

     }

 }

 void remove(Node* &o,int x) {

     int d=o->cmp(x);

     if(d==-) {

         Node* u=o;

         if(o->ch[]!=NULL&&o->ch[]!=NULL) {

             int d2=(o->ch[]->r>o->ch[]->r?:);

             rotate(o,d2);

             remove(o->ch[d2],x);

         }

         else {

             if(o->ch[]==NULL) o=o->ch[];

             else o=o->ch[];

             delete u;

         }

     }

     else {

         remove(o->ch[d],x);

     }

 }

 int find_max(Node *o)

 {

     if (o->ch[]==NULL){

         printf("%d\n",o->id);

         return o->v;

     }

     return find_max(o->ch[]);

 }

 int find_min(Node *o)

 {

     if (o->ch[]==NULL){

         printf("%d\n",o->id);

         return o->v;

     }

     return find_min(o->ch[]);

 }

 int main()

 {

     //freopen("de.txt","r",stdin);

     Node *root=NULL;

     int op;

     while (~scanf("%d",&op)){

         if (op==) break;

         if (op==){

             int id,v;

             scanf("%d%d",&id,&v);

             //printf("ins %d %d \n",id,v);

             insert(root,v,id);

         }

         else if (op==){

             if (root==NULL) {

                 printf("0\n");

                 continue;

             }

             int v = find_max(root);

             remove(root,v);

         }

         else if (op==){

             if (root==NULL) {

                 printf("0\n");

                 continue;

             }

             int v = find_min(root);

             remove(root,v);

         }

     }

     return ;

 }