1 #include <algorithm>
 2 #include <iostream>
 3 #include <iomanip>
 4 #include <cstring>
 5 #include <climits>
 6 #include <complex>
 7 #include <fstream>
 8 #include <cassert>
 9 #include <cstdio>
10 #include <bitset>
11 #include <vector>
12 #include <deque>
13 #include <queue>
14 #include <stack>
15 #include <ctime>
16 #include <set>
17 #include <map>
18 #include <cmath>
19
20 using namespace std;
21
22 const int maxn = 100010;
23 const int INF = 2147483647;
24 int heap[maxn];
25 int pos;
26
27 void init() {
28     pos = 0;
29     memset(heap, 0, sizeof(heap));
30     heap[0] = -INF;
31 }
32
33 void push(int x) {
34     int i = ++pos;
35     for(; heap[i>>1] > x; i>>=1) {
36         heap[i] = heap[i>>1];
37     }
38     heap[i] = x;
39 }
40
41 void pop() {
42     if(pos == 0) return;
43     int child = 1;
44     int i = 1;
45     int last = heap[pos--];
46     for(; i<<1 <= pos; i=child) {
47         child = i<<1;
48         if(child != pos && heap[child] > heap[child+1]) {
49             ++child;
50         }
51         if(last > heap[child]) {
52             heap[i] = heap[child];
53         }
54         else {
55             break;
56         }
57     }
58     heap[i] = last;
59 }
60
61 int n, k, x;
62 char cmd[2];
63
64 int main() {
65     // freopen("in", "r", stdin);
66     while(~scanf("%d %d", &n, &k)) {
67         init();
68         while(n--) {
69             scanf("%s", cmd);
70             if(cmd[0] == 'I') {
71                 scanf("%d", &x);
72                 if(pos < k) push(x);
73                 else if(heap[1] < x) {
74                     pop();
75                     push(x);
76                 }
77             }
78             else {
79                 printf("%d\n", heap[1]);
80             }
81         }
82     }
83     return 0;
84 }