1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<queue>
 5 #include<functional>
 6 #include<vector>
 7 using namespace std;
 8 int n,k;
 9 int main()
10 {
11     char ch[5];
12     int x;
13     while(scanf("%d%d",&n,&k)!=EOF)
14     {
15         priority_queue<int,vector<int>,greater<int> >que;
16         while(n--)
17         {
18             scanf("%s",ch);
19             if(ch[0]==‘I‘)
20             {
21                 scanf("%d",&x);
22                 que.push(x);
23             }
24             else
25             {
26                 printf("%d\n",que.top());
27             }
28             if(que.size()>k)
29             que.pop();
30         }
31     }
32     return 0;
33 }