,bk) if there exists an integer i∈[1,k]iin [1,k]i∈[1,k] such that ai
Pangtextit{Pang}Pang has graduated from college 3{3}3 years and he really misses the time he spent with ICPC(Interspecies Collegiate Pokemon Camp). There are 10{10}10 problems in one contest in ICPC. n{n}n participating teams have 300{300}300 minutes to solve them. After the contest, teams are ranked according to the most problems solved. Teams who solve the same number of problems are ranked by least total time. The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submittal of the first accepted run plus 20 penalty minutes for every previously rejected run for that problem. There is no time consumed for a problem that is not solved. If two teams tie, their solution time listtextit{solution time list}solution time lists are calculated. A team's solution time list is a list consisting of solution times of all problems solved by that team, sorted in descending order. The solution time of one problem is the time elapsed from the beginning of the contest to the submittal of the first accepted run of that problem. (We do not add a penalty for the solution time.) The team with a lexicographically smaller solution time list has a better rank. A list (a1,…,ak)(a_1, ldots, a_k)(a1,…,ak) is lexicographically smaller than (b1,…,bk)(b_1,ldots,b_k)(b1,…,bk) if there exists an integer i∈[1,k]iin [1,k]i∈[1,k] such that ai
