#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <set>
#include <cmath>
#include <map>

#define mp make_pair
#define pb push_back
#define xx first
#define yy second
using namespace std;

double  x[10000], y[10000];
char name[1000][100], sex[1000][100];
double X, Y, v;


vector<pair<double, int > > a, b, c;

int main() {
  
  int T, n, m;
  scanf("%d", &T);
  while(T--) {
    scanf("%d%d", &n, &m);
    X = -500, Y = -500;
    for(int i=1;i<=n;i++) {
      scanf("%s%s%lf%lf", name[i], sex[i], &x[i], &y[i]);
      X = max(x[i], X);
      Y = max(Y, y[i]);
    }
    a.clear();
    b.clear();
    c.clear();
    for(int i=1;i<=n;i++) {
          x[i] = (x[i]*300.0)/X;
    y[i] = (y[i]*300.0)/Y;
    v = x[i]*0.3 + y[i]*0.7;
    if(sex[i][0]=='f') {
      a.pb(mp(-v, i));
    }
    else {
      b.pb(mp(-v, i));
    }
    }
    printf("The member list of Shandong team is as follows:\n");

    
    if(a.size()==0) {
      sort(b.begin(), b.end());
      for(int i=0;i<m;i++) printf("%s\n", name[b[i].yy]);
    }
    else {
      sort(a.begin(), a.end());
      v = a[0].xx;
      int t = a[0].yy;
      for(int i=1;i<a.size();i++) b.pb(a[i]);
      sort(b.begin(), b.end());
      c.pb(mp(v,t));
      for(int i=0;i<m-1;i++) {
    c.pb(b[i]);
      }
      sort(c.begin(), c.end());
      for(int i=0;i<c.size();i++) printf("%s\n", name[c[i].yy]);
    }

  }
}