# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <forward_list>
# include <map>
# include <stack>
using namespace std;

# define INF ((int)(1<<30))
# define REP(i,n) for(int i=0;i<(int)n;i++)
# define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
# define TORAD 2.0*M_PI/360.0
# define INT(x) int x;cin>>x;
# define ALL(x) (x).begin(),(x).end()
# define RALL(x) (x).rbegin(),(x).rend()
# define DEBUG(x) cout<<#x<<" :"<<x<<endl;
# define EPS 1e-12

template<class T> void debug(T a) { for (auto i : a)cout << i << endl; }

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = { 0,-1,1,0 }, dy[4] = { 1,0,0,-1 };

int main()
{
	typedef pair<double,int> p;
	vector<p> a[3],ans,t;
	REP(i, 3)
	{
		REP(j, 8)
		{
			p x; cin >> x.second >> x.first;
			a[i].push_back(x);
		}
		sort(ALL(a[i]));
		ans.push_back(a[i][0]);
		ans.push_back(a[i][1]);
		for (int j = 2; j < 8; j++)
		{
			t.push_back(a[i][j]);
		}
	}
	sort(ALL(t));
	ans.push_back(t[0]); ans.push_back(t[1]);
	for (int i = 0; i < ans.size(); i++)
	{
		cout << ans[i].second << " " << ans[i].first << endl;
	}


}