시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 256 MB 0 0 0 0.000%

문제

PC^2 (pea sea squared) has been used to manage programming contests for many years. It was written to manage the ACM contest where each problem solved scores 1 point, and time is the tie breaker. To use it in the NZPC, or any other contest where questions have a variable points weighting, a program needs to be written to read a PC^2 file and apply different rules.

That is what you have to do in this problem. You will be given a number of contests to manage. For each you will be given the points each problem is worth, and a PC^2 entry for each team. You have to rank the teams according to the rules of the contest in which they are competing.

입력

Input consists of a number of contests. The first line for each contest contains a single integer, P, which is the number of problems in the contest. (0 < P <= 20). Where P is 0, that marks the end of input.

The second line consists of a series of positive integers, one per problem, separated by spaces. This represents the number of points for each problem, the first number for the first problem and so on.

The third line for each contest contains a single integer, T, which is the number of teams taking part in the contest. (0 < T <= 50).

There then follow T lines, each line being data for one team. The data starts with the team name. This may contain spaces, but is terminated by a comma (with no commas in the name). There then follow one record for each problem, the records being separated by commas. The records are in the same order as were the points values in line 2, problem 1 first and so on.

Each record has an integer, a slash character, /, and either another integer, or a – character. The record should be interpreted as follows:

  • The first integer shows how many submissions the team made for the problem. It will be 0 or more.
  • If the slash is followed by a -, it means that the team did not solve the problem, so score no points for it.
  • If the slash is followed by a number, which will be zero or more, it means that the team did solve the problem. The number shows how many minutes into the contest the successful submission was made.

출력

For each contest, output starts with a line containing the text Contest N, where N is the number of the contest. The first contest in the input is 1, and contests are numbered in order.

There then follows a line for each team in the contest showing rank, team name and points scored, separated by spaces. The teams must appear in ascending rank order (ie 1, 2, 3..). 

In these contests teams are sorted by points scored, the higher the better. Teams with equal points are considered equal and should be displayed in alphabetical order of name (not case sensitive), but should have equal rank. Make sure any following team has its correct rank (for example after joint first, the next team is rank 3).

예제 입력

5
1 1 2 3 10
4
Happy Fred's team,2/5,3/27,1/106,8/262,3/-
Team 67,0/-,0/-,2/135,4/218,12/-
Astrix,0/-,0/-,0/-,0/-,17/299
apple pie,0/-,0/-,0/-,0/-,0/-
0

예제 출력

Contest 1
1 Astrix 10
2 Happy Fred's team 7
3 Team 67 5
4 apple pie 0

힌트