22153_FootballStars

In the year 1000000000, football is still very popular all over the world. In the long history of football, there are a lot of football stars. People want to know the top 11 football players within a certain period. Now given a football star list, you are asked to complete this task. Each football star is described as follows: (year, name, ability).

The first line contains an integer N ( 1 ≤ N ≤ 50000 ), which is the number of football stars. The next N lines, each describes a football star. 0 ≤ year ≤ 1000000000, name contains less than 15 letters, 0 ≤ ability ≤ 1000000000. You can assume that no two names are the same. Then comes an integer R, which is the number of request. The next R lines, each describes a request. Each request contains two integers x, y ( 0 ≤ x ≤ y ≤ 1000000000) .

For each request, you have to output the name of the top 11 football stars according their ability in decreasing order, if there is a tie, sort them according their years in increasing order. If still a tie, sort them according their names in lexicographic order. If the total number of football star is less than 11, output "XXX" in the remaining lines.

Print a blank line after each request.

5
1 a 1
2 b 2
2 c 6
5 e 50
5 d 50
2
1 2
5 5

c
b
a
XXX
XXX
XXX
XXX
XXX
XXX
XXX
XXX

d
e
XXX
XXX
XXX
XXX
XXX
XXX
XXX
XXX
XXX