# include <iostream>
# include <fstream>
# include <cstring>
# include <algorithm>
# define NR 1024
using namespace std;
struct elem
{
    int pct, gol;
    char nume[1058];
} a[100];
bool cmp (elem x, elem y)
{
    if (x.pct<y.pct) return 0;
    else if (x.pct==y.pct)
        {
            if (x.gol<y.gol) return 0;
            else if (x.gol==y.gol && strcmp(x.nume, y.nume)>0) return 0;
            else return 1;
        }
        else return 1;
}
int i,j,n,m,VV1,VV2,nume,nr1,nr2,l,ok1,ok2;
char s[1024],nume1[1024],nume2[1024];
int main ()
{
    for (int o=1; o<=6; ++o)
    {
        cin.getline (s+1, 1000); l=strlen(s+1);
        j=1; VV1=-1; VV2=-1;
        while (s[j]!=' ' && j<=l)
            nume1[++VV1]=s[j], ++j;
        ++j;
        while (s[j]!=' ' && j<=l)
            nume2[++VV2]=s[j], ++j;
        ++j; nr1=0; nr2=0;
        while (s[j]!=' ' && j<=l)
            nr1=nr1*10+s[j]-'0', ++j;
        ++j;
        while (s[j]!=' ' && j<=l)
            nr2=nr2*10+s[j]-'0', ++j;

        nume1[VV1+1]='\0'; nume2[VV2+1]='\0';
        ok1=1; ok2=1;
        //nume1
        for (i=1; i<=nume; ++i)
            if (strcmp(a[i].nume, nume1)==0)
            {
                a[i].gol+=nr1;
                if (nr1>nr2) a[i].pct+=3;
                    else if (nr1==nr2) a[i].pct+=1;
                ok1=0;
            }

        if (ok1)
        {
            ++nume;
            strcpy(a[nume].nume, nume1);
            a[nume].gol+=nr1;
            if (nr1>nr2) a[nume].pct+=3;
                else if (nr1==nr2) a[nume].pct+=1;
        }
        //nume2
         for (i=1; i<=nume; ++i)
            if (strcmp(a[i].nume, nume2)==0)
            {
                a[i].gol+=nr2;
                if (nr2>nr1) a[i].pct+=3;
                    else if (nr1==nr2) a[i].pct+=1;
                ok2=0;
            }

        if (ok2)
        {
            ++nume;
            strcpy(a[nume].nume, nume2);
            a[nume].gol+=nr2;
            if (nr2>nr1) a[nume].pct+=3;
                else if (nr1==nr2) a[nume].pct+=1;
        }
    }
    sort (a+1, a+6+1, cmp);
    for (i=1; i<=4; ++i)
        cout<<a[i].nume<<"\n";

    return 0;
}