NoMoPhobia

Digital communication is everywhere. For many students, having their mobile phone taken away can cause extreme stress.

Ms Hatchett is a teacher who gives students de-merit points for every mobile-phone misdemeanor. A student's phone is confiscated once they have accumulated 100 de-merit points.

She shares the following table with her classes:

Over the course of a week she records each student's first name together with the misdemeanor code. At the end of the week she confiscates, over the weekend, the phone of every student who has accumulated at least 100 de-merit points. Every student starts each week with a clean slate — points are never carried over from one week to the next.

Your job is to determine, for each week, whose phones must be confiscated.

The input consists of several scenarios, each describing one week.

The first line of a scenario contains two integers $W$ and $N$ ($0 < W, N \le 50$): $W$ is the week number and $N$ is the number of de-merit entries recorded that week.

Each of the next $N$ lines contains a student's name (at most 20 characters) and a misdemeanor code from the table above, separated by a single space.

Scenarios continue until a line whose week number is $0$; that terminating line must not be processed. There may be several weeks of data.

For each week, print one line. The line begins with the word Week, a space, and the week number. Then, after another space, list the names of the students whose phones are confiscated, separated by commas (no spaces), in the order the students first appear in that week's entries.

If no phones are confiscated that week, print No phones confiscated after the week number instead.