/*
ID: espr1t
LANG: C++
TASK: Demo
KEYWORDS: 
*/

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <queue>
#include <map>
#include <set>

#define MAX 1024

using namespace std;
FILE *in; FILE *out;


int main(void)
{
	in = stdin; out = stdout;
	in = fopen("exam.in", "rt"); out = fopen("exam.out", "wt");
	
	int n, m;
	map <string, int> q;
	fscanf(in, "%d %d", &n, &m);
	for (int i = 0; i < n + m; i++)
	{
		char fn[32]; int points;
		fscanf(in, "%s %d", fn, &points);
		if (q.find(fn) == q.end())
			q[fn] = points;
		else
			q[fn] += points;
	}
	for (map <string, int> :: iterator it = q.begin(); it != q.end(); it++)
		if (it->second > 119) fprintf(out, "%s\n", it->first.c_str());
	
	return 0;
}