Knowledge required: arrays, conditionals, iteration, logic

Begin by determining ~S_{max}~, the latest submission time ~S_j~ of all ~j~ problems — the time that FatalEagle begins programming during the contest.

If a submission has already earned the full ~10~ points, the associated problem is solved and does not need to be considered. Output ~0~.

Otherwise, multiply the cuteness factor of the ~i^{th}~ kemonomimi ~C_{i_j}~, by the time needed ~T_j~ and add the time of awakening ~S_{max}~.

If the total time elapsed since the start of the competition does not exceed ~3~ hours ~(\le 180)~, output ~10 - P_j~, the remaining number of points to be earned.

Otherwise, the problem remains unsolved for the duration of the contest, so output The kemonomimi are too cute!

Time Complexity: ~\mathcal{O}(N)~