Contest scoreboard

$T$ teams numbered from $1$ to $T$ take part in a contest. Problems are numbered from $1$ to $9$. Each submission is written as four values: team, problem, time (in minutes) and verdict — C (correct) or I (incorrect).

A problem is solved by a team at its first C; later submissions to that problem are ignored. The penalty for a solved problem is the time of the first C plus $20$ minutes for every I before it. I submissions to an unsolved problem give no penalty.

Build the scoreboard of the teams that made at least one submission: by the number of solved problems in decreasing order, ties by total penalty in increasing order, then by team number in increasing order.

The first line contains $T$ and $q$ ($1 \le T \le 100$, $1 \le q \le 10^5$). The next $q$ lines contain submissions in non-decreasing order of time: team number, problem number ($1$–$9$), time ($0$–$300$) and the letter C or I.

For every team a separate line: team number, number of solved problems and total penalty.

For every team and problem keep two values: whether it is solved and how many I there were. After reading all submissions sort the teams by three keys.

In the example team 1 solved problem 2 at minute 19 after one I: $19 + 20 = 39$, and problem 1 at minute 25: $64$ in total. The C at minute 21 is ignored. Team 2 solved nothing but submitted, so there is a line 2 0 0; team 4 made no submissions and is not listed.

Source: UVa 10258.