#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    vector<pair<double, int>> amari;
    for (int i = 0; i < 3; ++i) {
        vector<pair<double, int>> v;
        for (int j = 0; j < 8; ++j) {
            int x; double k;
            cin >> x >> k;
            v.emplace_back(k, x);
        }
        sort(v.begin(),v.end());
        for (int j = 0; j < 8; ++j) {
            if(j < 2){
                printf("%d %.2lf\n", v[j].second, v[j].first);
            }else {
                amari.emplace_back(v[j]);
            }
        }
    }
    sort(amari.begin(),amari.end());
    for (int j = 0; j < 2; ++j) {
        if(j < 2){
            printf("%d %.2lf\n", amari[j].second, amari[j].first);
        }
    }
    return 0;
}
