#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int T;
struct name
{
    char n[150];
    int y;
}p[150];
int lmp(name a,name b)
{
    return a.y > b.y;
}
int main()
{
    //freopen("Input.txt","r",stdin);
    scanf("%d",&T);
    while(T--)
    {
        int i,j;
        memset(p,0,sizeof(p));
        int n;
        scanf("%d", &n);
        getchar();
        char ch[150];
        for(i=0; i < n; i++)
        {
            gets(ch);
            int m = strlen(ch);
            for(j = 4; j > 0; j--)
            {
                p[i].y = p[i].y * 10 + (ch[m-j]-'0');
            }
            ch[m-5] = '\0';
            strcpy(p[i].n,ch);
        }
        sort(p,p+n,lmp);
        for(i=0; i < n; i++)
        {
            cout << p[i].n << endl;
        }
    }
}