#include<bits/stdc++.h>
using namespace std;
int main()
{
int q,k;
cin>>q>>k;
priority_queue qu;
while(q–)
{
int t;
cin>>t;
if(t==1)
{ int x,y;
cin>>x>>y;
long long int distance=(xx)+(yy);
qu.push(distance);
if(qu.size()>k)
qu.pop();
}
else
{
cout<<qu.top()<<endl;
}
}
return 0;
}