#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define newl cout<<"\n";
#define space cout<<" ";
#define sz(x) x.size()
#define NumOfDigit(w) log10(w) + 1
#define MOD 1'000'000'007
#define inf 2'000'000'000
#define PI 3.141592654
#define modulo(a, b, mod) ((((a) % (mod)) + ((b) % (mod))) % (mod))
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define fixed(n) fixed << setprecision(n)
using namespace std;
void zainab_hamdy(){
  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
// freopen("schedule.in" , "r" ,stdin);
 #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
 #endif
}
bool comp(pair<ll,ll> a, pair<ll ,ll> b){
  return a.second < b.second;
}
int main(){
zainab_hamdy();
int t; cin>>t;
while(t--){
  int n; cin>>n;
 vector<pair<ll,ll>> am;
  vector<pair<ll,ll>>  pm;
   int idx=0;
   while(n--){
    int num,p1,p2,p3; string time;
    char c;
    cin >> num >> p1 >> c >> p2 >> c >> p3 >> time;
    if(time=="AM")
         am.emplace_back(num,p3 + p2 * 60 + p1 * 60 * 60);
    else
         pm.emplace_back(num, p3 + p2 * 60 + p1 * 60 * 60);

   }
sort(all(am),comp);
sort(all(pm),comp);

for(auto & i: am)   cout << i.first << " " ;
for(auto & i: pm)   cout << i.first << " " ;

newl
 }
 return 0;
}