#include<iostream>
#include<cstdio>
#include<math.h>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
	string name;
	unsigned long long shu;
}s[100005],h[100005];
bool cmp(node a,node b){
	return a.shu>b.shu;
}
int main() {
	int m,n;
    cin>>n>>m;
    int cnts=0,cnth=0;
    for(int i=0;i<n+m;i++){
    	string name00;
	    char zhen00;
	    string shu00;
    	cin>>name00>>zhen00>>shu00;
    	if(zhen00=='s'){
    		s[++cnts].name=name00;
    		s[cnts].shu=shu00;
		}else{
			h[++cnth].name=name00;
    		h[cnth].shu=shu00;
		}
	}
	sort(s+1,s+cnts+1,cmp);
	sort(h+1,h+cnth+1,cmp);
	cout<<h[3].name<<'\n';
	for(int i=6;i<=9;i++){
		cout<<s[i].name<<'\n';
	}
	return 0;
}

奇怪的编译信息