#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file 
#include <ext/pb_ds/tree_policy.hpp>
#include<math.h>
using namespace std;
using namespace __gnu_pbds;
 
typedef tree<long long int, null_type, less<long long int>, rb_tree_tag,
        tree_order_statistics_node_update>
        new_data_set;
 
int main() {
    long long int Q, K;
    cin >> Q >> K;
    new_data_set s;
 
    while (Q--) {
        int query;
        cin >> query;
        vector <long long int> v;
        long long int x, y;
        if (query == 1) {
 
            cin >> x >> y;
            v.push_back(x);
            v.push_back(y);
            int distance = x * x + y * y;
            s.insert(distance);
        } else {
            cout << *s.find_by_order(2) << endl;
        }
    }
    return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2luY2x1ZGUgPGV4dC9wYl9kcy9hc3NvY19jb250YWluZXIuaHBwPiAvLyBDb21tb24gZmlsZSAKI2luY2x1ZGUgPGV4dC9wYl9kcy90cmVlX3BvbGljeS5ocHA+CiNpbmNsdWRlPG1hdGguaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdXNpbmcgbmFtZXNwYWNlIF9fZ251X3BiZHM7Cgp0eXBlZGVmIHRyZWU8bG9uZyBsb25nIGludCwgbnVsbF90eXBlLCBsZXNzPGxvbmcgbG9uZyBpbnQ+LCByYl90cmVlX3RhZywKICAgICAgICB0cmVlX29yZGVyX3N0YXRpc3RpY3Nfbm9kZV91cGRhdGU+CiAgICAgICAgbmV3X2RhdGFfc2V0OwoKaW50IG1haW4oKSB7CiAgICBsb25nIGxvbmcgaW50IFEsIEs7CiAgICBjaW4gPj4gUSA+PiBLOwogICAgbmV3X2RhdGFfc2V0IHM7CgogICAgd2hpbGUgKFEtLSkgewogICAgICAgIGludCBxdWVyeTsKICAgICAgICBjaW4gPj4gcXVlcnk7CiAgICAgICAgdmVjdG9yIDxsb25nIGxvbmcgaW50PiB2OwogICAgICAgIGxvbmcgbG9uZyBpbnQgeCwgeTsKICAgICAgICBpZiAocXVlcnkgPT0gMSkgewoKICAgICAgICAgICAgY2luID4+IHggPj4geTsKICAgICAgICAgICAgdi5wdXNoX2JhY2soeCk7CiAgICAgICAgICAgIHYucHVzaF9iYWNrKHkpOwogICAgICAgICAgICBpbnQgZGlzdGFuY2UgPSB4ICogeCArIHkgKiB5OwogICAgICAgICAgICBzLmluc2VydChkaXN0YW5jZSk7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgY291dCA8PCAqcy5maW5kX2J5X29yZGVyKDIpIDw8IGVuZGw7CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIDA7Cn0=

OSAzCjEgMTAgMTAKMSA5IDkKMSAtOCAtOAoyCjEgNyA3CjIKMSA2IDYgCjEgNSA1CjIK

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