#include
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long int
int main()
{
typedef tree<ll,null_type,less,rb_tree_tag,tree_order_statistics_node_update> map_t;
map_t os;
ll q,k;
cin>>q>>k;
while(q–)
{
ll t;
cin>>t;
if(t==1)
{
ll x,y;
cin>>x>>y;
os.insert(xx+yy);
}
else
{
cout<<*os.find_by_order(2)<<endl;
}
}
return 0;
}