Score: 300 points
Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.
A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.
When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.
At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.
In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.
Input is given from Standard Input in the following format:
N K Q A_1 A_2 . . . A_Q
Print N lines. The i-th line should contain Yes
if Player i survived the game, and No
otherwise.
6 3 4 3 1 3 2
No No Yes No No No
In the beginning, the players' scores are (3, 3, 3, 3, 3, 3).
Players 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.
6 5 4 3 1 3 2
Yes Yes Yes Yes Yes Yes
10 13 15 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9
No No No No Yes No No No Yes No