#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

set<int> si;
vector<pair<double, ll>> vdx[3], vd;
double t;
ll n;

int main(){
	REP(i, 3){
		REP(j, 8){
			cin >> n >> t;
			vdx[i].push_back(make_pair(t, n));
			vd.push_back(make_pair(t, n));
		}
		sort(ALL(vdx[i]));
	}
	sort(ALL(vd));
	REP(i, 3){
		REP(j, 2){
			cout << vdx[i][j].second << " " << vdx[i][j].first << endl;
			si.insert(vdx[i][j].second);
		}
	}
	int co = 0;
	REP(i, 24){
		if (si.find(vd[i].second) == si.end()){
			cout << vd[i].second << " " << vd[i].first << endl;
			co++;
		}
		if (co >= 2)break;
	}
}