#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define ll long long
using namespace __gnu_pbds;
using namespace std;
 
typedef
tree<
  ll,
  null_type,
  less<ll>,
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;
 
main()
 {
    ios::sync_with_stdio(0);
    cin.tie(0);
 
    ordered_set t;
    ll q,k,c,x,y,a;
    cin>>q>>k;
    a=q;
    while(a--){
    	cin>>c;
    	if(c==1){
    		cin>>x>>y;
    		t.insert((x*x+y*y));
    	}
    	else if(c==2){
    		cout<<*t.find_by_order(k-1)<<"\n";
    	}
    }
   }
 

I2luY2x1ZGUgPGV4dC9wYl9kcy9hc3NvY19jb250YWluZXIuaHBwPgojaW5jbHVkZSA8ZXh0L3BiX2RzL3RyZWVfcG9saWN5LmhwcD4KI2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBfX2dudV9wYmRzOwp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdHlwZWRlZgp0cmVlPAogIGxsLAogIG51bGxfdHlwZSwKICBsZXNzPGxsPiwKICByYl90cmVlX3RhZywKICB0cmVlX29yZGVyX3N0YXRpc3RpY3Nfbm9kZV91cGRhdGU+Cm9yZGVyZWRfc2V0OwoKbWFpbigpCiB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbygwKTsKICAgIGNpbi50aWUoMCk7CgogICAgb3JkZXJlZF9zZXQgdDsKICAgIGxsIHEsayxjLHgseSxhOwogICAgY2luPj5xPj5rOwogICAgYT1xOwogICAgd2hpbGUoYS0tKXsKICAgIAljaW4+PmM7CiAgICAJaWYoYz09MSl7CiAgICAJCWNpbj4+eD4+eTsKICAgIAkJdC5pbnNlcnQoKHgqeCt5KnkpKTsKICAgIAl9CiAgICAJZWxzZSBpZihjPT0yKXsKICAgIAkJY291dDw8KnQuZmluZF9ieV9vcmRlcihrLTEpPDwiXG4iOwogICAgCX0KICAgIH0KICAgfQo=

OSAzCjEgMTAgMTAKMSA5IDkKMSAtOCAtOAoyCjEgNyA3CjIKMSA2IDYgCjEgNSA1CjI=

9 3
1 10 10
1 9 9
1 -8 -8
2
1 7 7
2
1 6 6 
1 5 5
2