#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;

template <class T>
void initvv(vector<vector<T> > &v,int a,int b, const T  &t = T()){
	v.assign(a,vector<T>(b,t));
}

//v.erase(unique(v.begin(),v.end()),v.end());
typedef pair<double,int> tmp;

int main(){
	vector<tmp> ans;
	vector<tmp> v;
	rep(i,3){
		vector<tmp> tt(8);
		rep(j,8){
			cin>>tt[j].S>>tt[j].F;
			// cout<<tt[i].F<<endl;
		}
		sort(ALL(tt));
		ans.PB(tt[0]);
		ans.PB(tt[1]);
		// cout<<ans
		v.PB(tt[2]);
	}
	sort(ALL(v));
	ans.PB(v[0]);
	ans.PB(v[1]);
	rep(i,8){
		printf("%d %.2f\n",ans[i].S,ans[i].F);
		// cout<<ans[i].S<<" "<<ans[i].F<<endl;
	}
}