#include<bits/stdc++.h>
using namespace std;
int n,m;
struct node
{
	string name;
	int shld;
};
bool cmp(node a,node b)
{
	return a.shld>b.shld;
}
node H[100005],S[100005];
int cntH,cntS;
int main()
{
	cin>>n>>m;
	for (int i=1;i<=n+m;i++)
	{
		char a;
		int shld;
		string name;
		cin>>name>>a>>shld;
		if (a=='S')
		{
			cntS++;
			S[cntS].name=name;
			S[cntS].shld=shld;
		}
		else
		{
			cntH++;
			H[cntH].name=name;
			H[cntH].shld=shld;
		}
	}
	sort(H+1,H+m+1,cmp);
	sort(S+1,S+n+1,cmp);
	cout<<H[3].name<<endl;
	for (int i=6;i<=9;i++)
	{
		cout<<S[i].name<<endl;
	}
	return 0;
}