Ranking List

Write a program that produces the ranking list for a programming contest. You are given the list of participating teams and a log describing every solution the teams submitted.

Scoring follows these rules:

1. Teams are ranked by the total number of problems they solved correctly (more solved problems is better).
2. Teams that solved the same number of problems are ranked by least total time.
3. The total time is the sum of the time consumed over each solved problem. The time consumed for a solved problem is the number of minutes from the start of the contest until the accepted submission, plus 20 penalty minutes for every rejected submission for that problem (regardless of when the rejected run was submitted). A problem that is never solved consumes no time.

The detailed tie-break procedure for equal total times is intentionally not part of this task. Instead, if two or more teams have both the same number of solved problems and the same total time, assign them the same rank and list them in alphabetical order.

A team's rank $r$ means that exactly $r-1$ teams did better, so ranks are skipped whenever a tie occurs. For example, if the two best teams have identical solved counts and total times, they both receive rank $1$ and the next team receives rank $3$ — no team is assigned rank $2$.

Finally, there is no penalty for a rejected submission made after a correct submission has already been accepted from the same team for the same problem.

The first line contains the number of scenarios.

Each scenario begins with a line containing the number $n$ of teams ($1 \le n \le 20$), followed by $n$ lines with the teams' distinct names, given in alphabetical order. A team name is a single word of at most 8 characters containing only letters and digits.

The next line contains the number $k$ of problems and the number $m$ of submitted solutions ($1 \le k < 10$, $0 \le m \le 2000$). Each of the following $m$ lines describes one submission in the format problem time correctness team, where $1 \le problem \le k$ is the problem number, $0 \le time < 300$ is the number of minutes elapsed since the contest started, correctness is either Yes or No, and team is the name of the submitting team. The submissions are sorted by time.

For each scenario, print a ranking list containing every participating team. Each line has the format rank. team solved time, where rank is the team's rank, team is its name, solved is the number of problems it solved, and time is its total time.

The four fields are separated by single spaces and use fixed field widths: 2 for the rank, 8 for the team name, 1 for the number of solved problems, and 4 for the total time. Names are left-adjusted and numbers are right-adjusted (see the sample output).

Separate the ranking lists of consecutive scenarios with a blank line.