#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<algorithm>

 using namespace std;

 typedef long long LL;

 const int INF = (<<)-;

 const int mod=;

 const int maxn=;

 int a[maxn],c[maxn];

 int k;

 int lowbit(int x){ return x &(-x);}

 int sum(int x){

     int ret=;

     while(x>){

         ret+=c[x];x-=lowbit(x);

     }

     return ret;

 }

 void add(int x,int d){

     while(x<maxn){

         c[x]+=d;x+=lowbit(x);

     }

 }

 int solve(int x){

     int v=x;

     int s=sum(x);

     int kk=k+s;

     int lb=,ub=maxn,mid;

     for(int i=;i<=;i++){

         mid=(lb+ub)/;

         if(sum(mid) < kk) lb =mid;

         else ub = mid;

     //    printf("lb = %d  ub = %d  mid = %d\n",lb,ub,mid);

     }

     return ub;

 }

 int main(){

     int m;

     while(scanf("%d",&m) != EOF){

         memset(c,,sizeof(c));

         while(m--){

             int cmd;

             scanf("%d",&cmd);

             if(cmd == ){

                 int x;

                 scanf("%d",&x);

                 add(x,);

             }

             if(cmd == ){

                 int x;

                 scanf("%d",&x);

                 if(sum(x) - sum(x-) == ) printf("No Elment!\n");

                 else add(x,-);

             }

             if(cmd == ){

                 int x;

                 scanf("%d %d",&x,&k);

                 if(sum(maxn-) - sum(x) < k) printf("Not Find!\n");

                 else  printf("%d\n",solve(x));

             }

         }

     }

     return ;

 }