#include <iostream>
#include <stdio.h>

using namespace std;



struct Student{
    string ident;
    float grades;
    int meters, month;
    unsigned int number;
};

void Sortowanie (Student tab[], unsigned n, char p[] ){
    Student temp;
    switch(p[0]){
    case 'm':
        for(unsigned int i=n-1; i>0; i--){
            unsigned int max =0;
            for(unsigned int j=1; j <= i ;j++){
                if (tab[max].month<tab[j].month)
                    max = j ;
                else if (tab[max].month == tab[j].month){
                    if (p[1] == 's'){
                        if (tab[max].grades<tab[j].grades)
                            max = j;
                        else if (tab[max].grades == tab[j].grades){
                            if(tab[max].meters<tab[j].meters)
                                max = j;
                            else if (tab[max].meters == tab[j].meters){
                                if(tab[max].number>tab[j].number)
                                    max = j;
                            }
                        }
                    }
                    else if (p[1] == 'd'){
                        if (tab[max].meters<tab[j].meters)
                            max = j;
                        else if (tab[max].meters == tab[j].meters){
                            if(tab[max].grades<tab[j].grades)
                                max = j;
                            else if (tab[max].grades == tab[j].grades){
                                if(tab[max].ident<tab[j].ident)
                                    max = j;
                            }
                        }
                    }
                }
                temp = tab[i];
                tab[i] = tab[max];
                tab[max]=temp;
            }
        }
        break;
    case 's':
        for(unsigned int i=n-1; i>0; i--){
            unsigned int max =0;
            for(unsigned int j=1; j <= i ;j++){
                if (tab[max].grades<tab[j].grades)
                    max = j ;
                else if (tab[max].grades == tab[j].grades){
                    if (p[1] == 'm'){
                        if (tab[max].month<tab[j].month)
                            max = j;
                        else if (tab[max].month == tab[j].month){
                            if(tab[max].meters<tab[j].meters)
                                max = j;
                            else if (tab[max].meters == tab[j].meters){
                                if(tab[max].ident>tab[j].ident)
                                    max = j;
                            }
                        }
                    }
                    else if (p[1] == 'd'){
                        if (tab[max].meters<tab[j].meters)
                            max = j;
                        else if (tab[max].meters == tab[j].meters){
                            if(tab[max].month<tab[j].month)
                                max = j;
                            else if (tab[max].month == tab[j].month){
                                if(tab[max].ident<tab[j].ident)
                                    max = j;
                            }
                        }
                    }
                }
                temp = tab[i];
                tab[i] = tab[max];
                tab[max]=temp;
            }
        }
        break;
    case 'd':
        for(unsigned int i=n-1; i>0; i--){
            unsigned int max =0;
            for(unsigned int j=1; j <= i ;j++){
                if (tab[max].meters<tab[j].meters)
                    max = j ;
                else if (tab[max].meters == tab[j].meters){
                    if (p[1] == 'm'){
                        if (tab[max].month<tab[j].month)
                            max = j;
                        else if (tab[max].month == tab[j].month){
                            if(tab[max].grades<tab[j].grades)
                                max = j;
                            else if (tab[max].grades == tab[j].grades){
                                if(tab[max].ident>tab[j].ident)
                                    max = j;
                            }
                        }
                    }
                    else if (p[1] == 's'){
                        if (tab[max].grades<tab[j].grades)
                            max = j;
                        else if (tab[max].grades == tab[j].grades){
                            if(tab[max].month<tab[j].month)
                                max = j;
                            else if (tab[max].month == tab[j].month){
                                if(tab[max].ident<tab[j].ident)
                                    max = j;
                            }
                        }
                    }
                }
                temp = tab[i];
                tab[i] = tab[max];
                tab[max]=temp;
            }
        }
    break;
    }
}


int main()
{
    int n;
    cin >> n;
    if (n<1 || n>1000000) return 0;
    Student Boys[n];
    Student Girls[n];
    Student temp;
    char parameters[3];
    cin >> parameters[0] >> parameters[1] >> parameters[2];
    for (int i = 0; i<n; i++){
        cin >> Girls[i].ident >> Girls[i].grades >> Girls[i].meters >> Girls[i].month >>
               Boys[i].ident >> Boys[i].grades >> Boys[i].meters >> Boys[i].month;
        Girls[i].number = i;
        Boys[i].number = i;
    }
    Sortowanie(Girls,n,parameters);
    Sortowanie(Boys,n,parameters);
    for (int i = n-1; i>-1; i--){
        cout << Girls[i].ident << " " << Boys[i].ident << " ";
    }
    return 0;
}