Programming-trampoline-athlon!

Programming competitions are fun and exciting. Programming should be an Olympic sport! At least, this is what we believe. However, when we suggested this to some of our friends, they did not seem to share our excitement. So, we decided to suggest a combined sport that will be more interesting to watch. Programming-trampoline-athlon! (we are still working on the name.)

The idea is as follows. This is a team sport, where each team consists of $3$ members. The team has $1$ hour, $1$ computer, and $1$ trampoline at its disposal. At all times, at most one team member must use the computer, and at least one team member must be jumping on the trampoline. At the start of the competition, the team receives $6$ programming problems and $6$ trampoline elements (exercises). The team decides how to divide the trampoline elements among its members, so that each team member performs exactly $2$ of the given elements on the trampoline. The team members solve the programming tasks together, but no member may spend more than $25$ minutes on the computer in total. The score has two parts, which are added together:

• The programming score ranges from $0$ to $60$. The team receives $10$ points for each correctly solved problem.
• The trampoline score ranges from $0$ to $40$. Each of the $6$ trampoline elements receives a score from the judges between $0$ and $10$. The final trampoline score is the sum of the $4$ remaining scores after dropping the highest and lowest of the $6$ scores.

Before we pitch this new sport to the International Olympic Committee, we want everything ready to show them how serious we are. Each team receives a medal when no more than two other teams have a strictly higher score. However, because of a recent shortage of medals, the jury was instructed to make sure that no more than $1\,000$ teams receive a medal. Write a program that determines the medallists, given the performance of each team.

The first line contains the number $N$ of competing teams. Then $N$ lines follow. Each line describes one team and contains the space-separated values $C$, $P$, $E_1$, $E_2$, $E_3$, $E_4$, $E_5$, $E_6$. $C$ is a five-letter code that identifies the team, $P$ is an integer giving the number of problems the team solved, and $E_i$ is an integer giving the execution score of trampoline element $i$.

The output contains $M$ lines, where $M$ is the number of medallist teams. Each line contains two space-separated values $C$ and $S$, where $C$ is the team code and $S$ is the total score of the team. Print the medallist teams in decreasing order of total score. Teams with equal scores appear in input order.

• $3 \le N \le 100\,000$
• $3 \le M \le 1\,000$
• $C$ consists of five uppercase English letters.
• $0 \le P \le 6$
• $0 \le E_i \le 10$ for all $1 \le i \le 6$
• Different teams always have different team codes.