#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll unsigned long long
ll compute(ll a,ll b){
return ( (aa) + (bb) );
}
typedef tree<ll, null_type, less, rb_tree_tag,
tree_order_statistics_node_update>
PBDS;
int main(){
ll q,k,v1,v2,f;
cin>>q>>k;
PBDS pb;
while(q–){
cin>>f;
if(f==1){
cin>>v1>>v2;
pb.insert(compute(v1,v2));
}
else if(f==2){
auto it = pb.find_by_order(k-1);
cout<<(*it)<<’\n’;
}
}
return 0;
}