ACM-UCPC

In 2020 the ACM (Association for Computing Machinery), the computing society of Earth in the Solar System, holds ACM-UCPC (Universal Collegiate Programming Contest) for university students. Limits on time and venue push the preliminary round onto the internet.

After the preliminary round each team has a score made of the number of problems solved and a penalty. A team that solved more problems ranks ahead of a team that solved fewer, and among teams that solved the same number the smaller penalty ranks ahead. No two teams share a rank. Given the preliminary results sorted by rank, write a program that picks the 60 teams for the final round.

The organizers want strong teams while keeping any one school from taking too many slots, so they walk the teams from the best rank down and decide each one with the rules below. Let $k$ be the number of teams from the current team's school that are already selected, and let $M$ be the number of teams that school entered.

1. If $k$ is at least $\lceil M/2 \rceil$, the team is not selected. At most $\lceil M/2 \rceil$ teams come from one school. A school that entered 2 teams gets at most 1, and a school that entered 3 teams gets at most 2.
2. If the current team ranks 1st to 10th overall, it is selected only when $k \le 3$.
3. If it ranks 11th to 20th overall, it is selected only when $k \le 2$.
4. If it ranks 21st to 30th overall, it is selected only when $k \le 1$.
5. If it ranks 31st or lower overall, it is selected only when $k = 0$.

The walk stops the moment 60 teams are selected. If the rules run out before 60 teams are filled, the remaining slots go to the teams that were passed over, taken in rank order, and the rules above do not apply to those slots. If fewer than 60 teams entered, every team is selected.

Input is read from standard input. The first line holds the number of test cases $T$ ($1 \le T \le 20$). The first line of each test case holds the number of entered teams $N$ ($1 \le N \le 1000$), and each of the next $N$ lines holds a team name team, a school name school, the number of problems solved solved, and a penalty penalty, separated by single spaces ($1 \le solved \le 10$, $1 \le penalty \le 10000$). team and school are strings of length at most 20 that contain no spaces. Within a test case the $N$ lines come in order from the highest rank down.

Output is written to standard output. For each test case print the name of the selected team with the lowest overall rank, one name per line.