#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

void print(pair<string, int> p)
{
	cout << p.second << " " << p.first << endl;
}

int main()
{
    vector<pair<string, int> > v(24);
	map<int, int> m;
	
	rep(i, 24)
		cin >> v[i].second >> v[i].first;
	
	rep(i, 3)
	{
		sort(v.begin() + 8 * i, v.begin() + 8 * (i + 1));
		
		print(v[8 * i]);
		print(v[8 * i + 1]);
		
		m[v[8 * i].second] = -1;
		m[v[8 * i + 1].second] = -1;
	}
	
	sort(ALL(v));
	
	int b = 2;
	for(int i = 0; i < 24 && b; i++)
	{
		if(m[v[i].second] != -1)
		{
			print(v[i]);
			b--;
		}
	}
}