Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the number written by Xiao Ming is too much, Xiao Bao is feeling giddy. Now, try to help Xiao Bao.

There are several test cases. For each test case, the first line of input contains two positive integer n, k. Then n lines follow. If Xiao Ming choose to write down a number, there will be an " I" followed by a number that Xiao Ming will write down. If Xiao Ming choose to ask Xiao Bao, there will be a "Q", then you need to output the kth great number.

The output consists of one integer representing the largest number of islands that all lie on one line.

8 3
I 1
I 2
I 3
Q
I 5
Q
I 4
Q

1
2
3

Hint
Xiao  Ming  won‘t  ask  Xiao  Bao  the  kth  great  number  when  the  number  of  the  written number is smaller than k. (1=<k<=n<=1000000).
/*
这个题比较容易想到优先队列，只需 简单进出即可，但要保持数量！（关键） 
*/ 
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<queue> 
#include<algorithm>
using namespace std;
int main()
{
    int n,m;
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        priority_queue<int, vector<int>, greater<int> >q; //建立优先队列，从小到大 
        int a,b; 
        char s[10];
        while(n--)
        {
        scanf("%s",s);
        if(s[0]=='I')
        {
            scanf("%d",&a); 
             q.push(a);
             if(q.size()>m)//当队列长队超过m时，弹出队首，使队保持m个元素 
             {
                 q.pop() ;
             }
         }
        else if(s[0]=='Q') 
         {
             b=q.top();
             printf("%d",b);
             printf("\n");
         }
      }
    }
    return 0;
}