#include <fstream>
#include <queue>
using namespace std;
priority_queue <long long > pq;
priority_queue <long long > q2;
int main()
{
    ifstream cin("magazin.in");
    ofstream cout("magazin.out");
    int n,k,cz,x,cnt=0,s,a,nr;
    cin >> n >> k;
    for(int i=0;i<n;i++)
    {
        cin >> cz >> a;
        if(cz==1)
            pq.push(a);
        else
        {
            cnt=0;
            s=pq.size();
            while(cnt<s-a)
            {
                x=pq.top();
                q2.push(x);
                pq.pop();
                cnt++;
            }
            nr=pq.top();
            pq.pop();
            cout << nr << endl;
            while(q2.empty()==false)
            {
                x=q2.top();
                pq.push(x);
                q2.pop();
            }
        }
    }
    return 0;
}