#include <bits/stdc++.h>
using namespace std;
long long n,m,cnt1=0,cnt2=0;
struct node{
	string name;
	char zy;
	long long sld;
};
node s[100005],h[100005];
bool cmp(node a,node b){
	return a.sld<b.sld;
}
int main(){
	cin>>n>>m;
	for(long long i=1;i<=n+m;i++){
		node a;
		cin>>a.name>>a.zy>>a.sld;
		if(a.zy=='H') h[++cnt2]=a;
		else s[++cnt1]=a;
	}
	sort(s+1,s+1+cnt1,cmp);
	sort(h+1,h+1+cnt2,cmp);
	cout<<h[1].name<<endl;
	for(long long i=4;i>=1;i--) cout<<s[i].name<<endl;
	return 0;
}