Amagi Brilliant Contests runs a business making and hosting contests on its online platform to competitive programmers who want to run their own contests.
On the last contest they hosted, there were simply not enough staff members to staff all of the judging servers. For the next time around, the management decided to
enslave hire more personnel. But prospective employees come with all levels of management and technical know-how. Particularly, every employee has a potentially non-unique skill level , and there are newly-hired employees.
Since the management wishes to minimize the cost of potential mistakes, they've decided to pair each new employee with a veteran employee so that they can be shown the ropes. There are veteran employees.
Each new employee has an adaptability factor , and must be paired with a veteran whose skill level is at most higher than their own: any lower and they would not learn anything, and any higher and the teacher would be overly cocky. In other words, the skill level of the teacher has to be at least as much as the current skill level and at most that quantity . The same veteran employee may teach multiple new employees. If multiple veterans satisfy these conditions, the employee should be paired with the veteran closest to their skill level. If there is still more than one choice, the new employee should be paired with the one that is given first in the input.
Being the head of the human resources department at Amagi Brilliant Contests, you've been tasked with pairing each new employee with an existing employee.
The first line of input will have , the number of existing employees.
Each of the next lines will have the name of an existing employee (which is no longer than uppercase and/or lowercase letters of the alphabet), and their skill level , separated by a single space.
Line will have , the number of new employees.
Each of the next lines will have the skill level of the new employee, along with their adaptability factor .
The name of the employee they should be paired with, or
No suitable teacher! if none exists.
Sample Input 1
5 Kanie 1000 Moffle 800 Sento 950 Macaron 550 Tirami 500 3 930 20 400 150 790 15
Sample Output 1
Sento Tirami Moffle
Sample Input 2
4 Muse 203 Sylphy 202 Koboli 202 Salama 999 2 200 1 200 3
Sample Output 2
No suitable teacher! Sylphy