#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define M 109
int n,m;
struct hm
{
    char name[M];
    char sex[M];
    int a,b;
    double s;
};
hm p[M],p2[M];
bool cmp(hm a,hm b)
{
    return a.s > b.s;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&m);
        bool female = false;
        int k = 0;
        int maxx1 = -1,maxx2 = -1;
        for(int i = 0;i < n;i++)
        {
            scanf("%s %s %d %d",p[i].name,p[i].sex,&p[i].a,&p[i].b);
            maxx1 = max(p[i].a,maxx1);
            maxx2 = max(p[i].b,maxx2);
        }
        int maxxf = -1;
        int num = -1;
        for(int i = 0;i < n;i++)
        {
            p[i].s = (double)p[i].a*300/maxx1*0.3 + (double)p[i].b*300/maxx2*0.7;
            if(p[i].sex[0] == 'f' )
            {
                female = true;
                if(maxxf < p[i].s)
                {
                    maxxf = p[i].s;
                    num = i;
                }
            }
            p2[k++] = p[i];
        }
        hm firstf = p[num];
        p[num].s = -1;
        sort(p,p+k,cmp);
        if(!female)
        {
            printf("The member list of Shandong team is as follows:\n");
            for(int i = 0;i < m;i++) printf("%s\n",p[i].name);
        }
        else if(female)
        {
            p[m-1] = firstf;
            sort(p,p+m,cmp);
            printf("The member list of Shandong team is as follows:\n");
            for(int i = 0;i < m;i++) printf("%s\n",p[i].name);
        }
    }
    return 0;
}