#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<queue>
#include<stack>
#include<vector>
#include<map>

#define N 100010
#define Mod 10000007
#define lson l,mid,idx<<1
#define rson mid+1,r,idx<<1|1
#define lc idx<<1
#define rc idx<<1|1
typedef long long ll;

const int INF = 1000010;

using namespace std;

int main()
{
    int n, k;
    while ( cin >> n >> k )
    {
        char c;
        int s;
        priority_queue<int, vector<int>, greater<int> >que;///从大到小排序，队首尾最小值
        while ( n-- )
        {
            scanf ( "%c%*c", &c );
            if ( c == 'Q' )
                printf ( "%d\n", que.top() );
            else
            {
                scanf ( "%d", &s );
                que.push ( s );
                if ( que.size() > k )
                    que.pop();
                getchar();
            }
        }
    }
    return 0;
}