#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <string.h>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <math.h>
#include <vector>
#include <ctime>
#include <cctype>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <stdexcept>
#include <utility> 
using namespace std;
#define ll long long
#define mem0(a) memset(a, 0, sizeof(a))
#define mem_1(a) memset(a, -1, sizeof(a))
#define maxn 100000
#define oo 1000000007
#define mod 1000000007
#define MAXN 105
struct stu
{
    ll x,y;
    char s[105];
};

ll i,j,k,l,m,n,aa,bb,nn,mm,g,ans=0;
stu a[maxn];

bool cmp(stu a,stu b)
{
    return a.x>b.x;
}


int main()
{
    scanf("%I64d",&n);
    
    for (i=1;i<=n;i++)
    {
        mem0(a);
        scanf("%I64d",&m);
        getchar();
        for (j=0 ; j<m ; j++)
        {
            
            gets(a[j].s);
            //while (a[i].s[0]=='\n') gets(a[i].s);
            l=strlen(a[j].s);
            a[j].x=a[j].s[l-1]-48+(a[j].s[l-2]-48)*10+(a[j].s[l-3]-48)*100+(a[j].s[l-4]-48)*1000;
            
        }
        
        sort( a,a+m ,cmp);
        
        for (j=0; j<m; j++)
        {
            for (k=0;k<strlen(a[j].s)-5;k++)
                printf("%c",a[j].s[k]);
            printf("\n");
        }
    }
    
        
    return 0;
}