Problem:


Score: 300 points

Problem Statement

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.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq K \leq 10^9

1 \leq Q \leq 10^5

1 \leq A_i \leq N\ (1 \leq i \leq Q)

Input

Input is given from Standard Input in the following format:

N K Q
A_1
A_2
.
.
.
A_Q

Output

Print N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.

Sample Input 1

6 3 4
3
1
3
2

Sample Output 1

No
No
Yes
No
No
No

In the beginning, the players' scores are (3, 3, 3, 3, 3, 3).

Player 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).

Player 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).

Player 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).

Player 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).

Players 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.

Sample Input 2

6 5 4
3
1
3
2

Sample Output 2

Yes
Yes
Yes
Yes
Yes
Yes

Sample Input 3

10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

Sample Output 3

No
No
No
No
Yes
No
No
No
Yes
No



Sample input:
6 3 4
3
1
3
2


Sample output:
No
No
Yes
No
No
No

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
n,k,q=map(int,input().split())
list=[]
for i in range(q):
    list.append(int(input()))

point = [k] * n
print(point)
for i in range(len(list)):
    point[list[i]-1] += 1

for i in range(len(point)):
    if point[i] > q:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split(' '))
P = [0 for _ in range(N)]

for i in range(Q):
    a = int(input()) - 1
    P[a] += 1

for i in range(N):
    if K - (Q - P[i]) > 0:
        print('yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = []
dic = {}
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in range(Q):
    answer = int(input())
    ans = "name" + str(answer)
    dic[ans]= dic[ans] + 1
for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = []
for _ in range(Q):
    answer.append(input())
dic = {}
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in answer:
    ans = "name" + str(i)
    dic[ans]= dic[ans] + 1
for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = []
for _ in range(Q):
    answer.append(input())
dic = {}
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in answer:
    ans = "name" + str(i)
    dic[ans]= dic[ans] + 1
for key,value in dic.items():
    if value > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = []
for _ in range(Q):
    answer.append(input())
dic = {}
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in answer:
    ans = "name" + str(i)
    dic[ans] += 1
for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = list(map(int, input().split()))
dic = {}
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in answer:
    ans = "name" + str(i)
    dic[ans] += 1

for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = list(map(int, input().split()))

dic = {}

for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q


for i in answer:
    ans = "name" + str(i)
    dic[ans] += 1

for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
answer = list(map(int, input().split()))
dic = {}
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in answer:
    ans = "name" + str(i)
    dic[ans] += 1
for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
def sub(x):
    return(x-1)

n, k, q = map(int,input().split())
scores = [k for i in range(n)]

for i in range(q):
    a = int(input())
    scores = list(map(sub, scores))
    scores[a-1] = scores[a-1] + 1
    print(scores)

for i in range(n):
    if scores[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
# N:人数, K:初期ポイント, Q:クイズ数
N, K, Q = map(int,input().split())

points = [K] * N
for i in range(Q):
    anser = int(input())-1
    for x in range(N):
        if x != anser:
            points[x] += -1
    
for y in range(N):
    if points[y] < 1:
        print('NO')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int,input().split())
ansers = []

points = [K for _ in range(N)]
for i in range(Q):
    ansers.append(int(input())-1)



for anser in ansers:
    for x in range(N):
        if x != anser:
            points[x] += -1
    print(points)
for y in range(N):
    if points[y] < 1:
        print('NO')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]

p = [k]*n

for i in a:
	for j in range(n):
		if i != j+1:
			p[j] -= 1

for i in p:
	if i > 0:
		print('YES')
	else:
		print('NO')

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int, raw_input().split())
A = []
 
for i in range(0,Q):
  A.append(int(raw_input()))
for i in range(1,N+1):
  con = A.count(i)
  if K - (Q - con) > 0:
    print "YES"
  elif K - (Q - con) <= 0:
    print "NO"

Submission status: Wrong Answer

Solution code:
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

for i in range(Q):
    for j in range(N):
        if j != A[i]:
            P[j] -= 1
            

for i in range(N):
    if P[i] <= 0:
        print("No")
    elif P[i] > 0:
        print("Yes")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
a = [input() for i in range(q)]
point = []
one = []
ans = []

for j in range(n):
  point.append(k)
  one.append(1)
  
for x in range(q):
  point = [p-o for (p,o) in zip(point, one)] 
  point[int(a[x])] += 1

for y in range(n):
  if point[y] <= 0:
    ans.append('No')
  else:
    ans.append('Yes')

for z in range(n):
  print(ans[z])

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
sanka = [K for _ in range(N)]

print(sanka)

for ai in A:
    sanka[ai-1] += 1

for i in range(N):
    if sanka[i] - Q > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N,K,Q=map(int,input().split(" "))
A=[int(input()) for _ in range(Q)]
T=[0 for _ in range(N)]

for i in range(Q):
    T[A[i]-1]=T[A[i]-1]+1
for i in range(N):
    T[i]=T[i]-(Q-K)
    if T[i]<=0:
        print("No")
    else:
        print("Yes")
print(T)

Submission status: Wrong Answer

Solution code:
import numpy as np
n, k, q = map(int, input().split())
a_list = []
for i in range(q-1):
    a_list.append(input())
for i in range(n-1):
    if q - a_list.count(str(i+1)) < k:
        print("Yes") 
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
a_list = []
for i in range(q-1):
    a_list.append(input())
for i in range(n-1):
    if q - a_list.count(i+1) < k:
        print("Yes") 
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int, raw_input().split())
A = []

for i in range(0,Q):
  A.append(int(raw_input()))
for i in range(1,N+1):
  con = A.count(i)
  if K - (Q - con) > 0:
    print "YES"
  elif K - (Q + con) <= 0:
    print "NO"

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int, raw_input().split())
A = [] #tokuten
B = [] #seikai
N_raund = []
for i in range(0,N):
  N_raund.append(K)

for i in range(0,Q):
  A.append(int(raw_input()))	

B = A
for i in range(0,len(N_raund)):
  for j in range(0,Q):
    N_raund[i] = N_raund[i]-1

for j in A:
  N_raund[j-1] = N_raund[j-1] + 1

for i in N_raund:
  if i > 0:
    print "YES"
  elif i <= 0:
    print "NO"

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())

P = [K for _ in range(N)]
for _ in range(Q):
    A = int(input()) - 1
    P[A] += 1

for p in P:
    if Q > p:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())

P = [0 for _ in range(N)]
for _ in range(Q):
    A = int(input()) - 1
    P[A] += 1

for p in P:
    if Q + 1 <= p:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split(' '))
score = [K for player in range(N)]
answers = [int(input()) - 1 for q in range(Q)]

# for answer in answers:
#     for i in range(N):
#         if i != answer:
#             score[i] = score[i] - 1

# for result in score:
#     if result > 0:
#         print('Yes')
#     else:
#         print('No')
for x in score:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import collections

print('input >>')
N, K, Q = map(int, (input().split()))
points = [K] * N
A = []
for _ in range(Q):
    A.append(int(input()))

Acount = collections.Counter(A)

for answerer, times in Acount.items():
    points = [p - times for p in points]
    points[answerer - 1] += times

# print('----------output----------')

for answerer in range(N):
    print('Yes') if points[answerer] > 0 else print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def main():
    n, k, q = map(int, input().split())
    a_list = []

    for i in range(q):
        a_list.append(int(input()))

    participant_list = [k-q] * n


    for i in range(q):
        participant_list[a_list[i]-1] += 1

    for i in range(n):
        if(participant_list[i] > 0):
            print("Yse")
        else:
            print("No")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def get_answer(input_list):
    c_list = [int(v) for v in input_list[0].split(" ")]
    n = c_list[0]
    k = c_list[1]
    q = c_list[2]
    a = [int(v) for v in input_list[1:]]
    ns = [k] * n
    for aa in a:
        index = aa - 1
        for i in range(len(ns)):
            if i != index:
                ns[i] -= 1

    nr = [""] * n
    for i in range(len(ns)):
        if ns[i] <= 0:
            nr[i] = "No"
        else:
            nr[i] = "Yes"

    return nr



if __name__ == "__main__":
    input_list = []
    while True:
        try:
            input1 = input()
            if not input1:
                break
            if len(input1) == 0:
                break
            input_list.append(input1)
        except EOFError:
            break
    print(get_answer(input_list))

Submission status: Wrong Answer

Solution code:
n,k,q= map(int, input().split())
a = [0]*n
for i in range(q):
  a[int(input())-1]+=1
for i in range(n):
  if a[i]-q > 0:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
t = [k]*n
s = [1]*n
for i in range(q):
  point = int(input())
  t = [t - s for (t, s) in zip(t, s)]
  t[point] = t[point]+1
for i in range(n):
  if t[i]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
from collections import Counter
N, K, Q = map(int, input().split())
answers = [int(input()) for i in range(Q)]
counts = Counter(answers)
print(counts)
for i in range(1,N+1):
  if K-(Q-counts[i])>0:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N, K ,Q  = map(int, input().split())
result = {}
for i in range(Q):
  winner = int(input())
  result[winner] = result.get(winner,0) + 1
#print(result)

for i in range(N):
#  print("No.{0} won {1} times".format(i + 1 , result.get(i + 1)))
#  print("No.{0}'s losted point is {1} ".format(i + 1 ,Q - result.get(i + 1, 0)))
  if K - (Q - result.get(i + 1, 0)) > 0:
    print("yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N, K ,Q  = map(int, input().split())
result = {}
for i in range(Q):
  winner = int(input())
  result[winner] = result.get(winner,0) + 1
#print(result)

for i in range(N):
#  print("No.{0} won {1} times".format(i + 1 , result.get(i + 1)))
#  print("No.{0}'s losted point is {1} ".format(i + 1 ,Q - result.get(i + 1, 0)))
  if (Q - result.get(i + 1, 0)) < K:
    print("yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
m = list(map(int,input().split()))
a=[int(input()) for i in range(m[2])]

n = [0] * m[0]

b=list(set(a))
for i in range(len(b)):
    n[i] = a.count(b[i])
  
for i in range(m[0]):
    if n[i]-m[2]+m[1] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())

answers = []
for i in range(q):
    a = int(input())
    answers.append(a)

players = []
for i in range(n):
    players.append(0)

for i in range(q):
    players[answers[i] - 1] += 1

ans_list = []
for i in range(n):
    if k - q + players[i] <= 0:
        ans_list.append('No')
    else:
        ans_list.append('Yes')

print(ans_list)

Submission status: Wrong Answer

Solution code:
import numpy as np
str=input()
N, K, Q=[int(v) for v in str.split()]
li=np.full(N, K)
for i in range(Q):
    A=int(input())-1
    li[A]+=1
    li-=1
    print(li)
for i in range(N):
    if li[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
N, K ,Q  = map(int, input().split())
# print(N, K ,Q)
points = [K for i in range(N)]
for i in range(Q):
  w = int(input())
# print(winner)
# print(points)
  for i in range(N):
    if w - 1!= i:
      points[i] -= 1

# print(points)

for p in points:
  if p >0:
    print("yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
point = [0] * N

for i in range(Q):
    A = int(input())
    A -= 1
    point[A] += 1

winner = max(point)
for i in range(N):
    if K > Q:
        print("Yes")
    else:
        if point[i] == winner:
            print("Yes")

        else:
            print("No")

Submission status: Wrong Answer

Solution code:
N, K ,Q  = map(int, input().split())
# print(N, K ,Q)
points = [K for i in range(N)]
winner = []
for i in range(Q):
  winner.append(int(input()))
# print(winner)
# print(points)

for w in winner:
  for i in range(N):
    if w - 1!= i:
      points[i] -= 1

# print(points)

for p in points:
  if p >0:
    print("yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
from numpy import *

n, k, q = map(int, input().split())
a = np.array([])

for i in range(q):
  a = np.append(a, int(input()))

points = [k for i in range(n)]
points = np.array(points)
minus_ones = [-1 for i in range(n)]
minus_ones = np.array(minus_ones)

for i in range(len(a)):
    points += minus_ones
    points[a[i]-1] += 1
print(points)
for i in range(n):
  if points[i] > 0:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
A = []
for _ in range(Q):
 A.append(int(input()))
P = []
P = [0] * N
i = 0
print(N,K,Q,A)
while Q>i:
    P[A[i]-1] += 1
    i += 1
for j in P:
    if (K - Q + j) > 0:
        print("Yes")
    else:
        print("No")
print(P)

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
ad = [0]*n
print(ad)
for _ in range(q):
    ai = int(input())
    ad[ai-1] += 1
for adi in ad:
    if k + adi - q <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
min=min(point)
for i in range(n):
    if point[i]==max or min-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
min=min(point)
for i in range(n):
    if point[i]==max or min-k>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]

for i in range(n):
	point[i]-=1
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]

for i in range(n):
	point[i]-=1
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or k-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
pos=input()
pos=pos.split()
N=int(pos[0])
P=int(pos[1])
T=int(pos[2])
point=[0]*N

for i in range(0,T):
    c=input()
    point[int(c)-1]+=1
point=[P-T+d for d in point]
print(point)
for i in range(0,N):
    if(point[i]>0):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
pos=input()
pos=pos.split()
N=int(pos[0])
P=int(pos[1])
T=int(pos[2])
point=[0]*N

for i in range(0,T):
    c=input()
    point[int(c)-1]+=1
point=[P- d for d in point]
for i in range(0,N):
    if(point[i]>0):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
while True:
	try:
		N, K, Q = map(int, input().split())
		P = [K for i in range(N)]
		for i in range(Q):
			q = int(input())
			for j in range(N):
				if (j != q-1):
					P[j] -= 1
			print(P)
		for p in P:
			if (p > 0):
				print("Yes")
			else:
				print("No")
	except:
		break

Submission status: Wrong Answer

Solution code:
while True:
	try:
		N, K, Q = map(int, input().split())
		P = [3 for i in range(N)]
		for i in range(Q):
			q = int(input())
			for j in range(N):
				if (j != q-1):
					P[j] -= 1
		for p in P:
			if (p > 0):
				print("Yes")
			else:
				print("No")
	except:
		break

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]-1]+=1
	for i in range(n):
		point[i]-=1
max=max(point)
for i in range(n):
    if point[i]==max or k-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
points = [0 for _ in range(n)]
for _ in range(q):
  a = int(input())
  points[a-1] += 1
for i in range(n):
  if points[i] > k-n:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
points = [0 for _ in range(n)]
for _ in range(q):
  a = int(input())
  points[a-1] += 1
for i in range(n):
  if points[i] > q-n:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
aList = []


ptsList = []
for i in range(N):
    ptsList.append(K-Q)

for i in range(N):
    ptsList.append(0)
if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > 0:
            print("Yes")
        else:
            print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
aList = []


ptsList = [K-Q]*N

for i in range(N):
    ptsList.append(0)
if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > 0:
            print("Yes")
        else:
            print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
aList = []


ptsList = [K-Q] * N

for i in range(N):
    ptsList.append(0)
if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > 0:
            print("Yes")
        else:
            print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
aList = []


ptsList = [0] * N
handy = Q - K
for i in range(N):
    ptsList.append(0)
if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > handy:
            print("Yes")
        else:
            print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]
import numpy as np
point=np.array([k]*n)
for i in range(q):
	point=point-1
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max and point[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]
import numpy as np
point=np.array([k]*n)
for i in range(q):
	point=point-1
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]
import numpy as np
point=np.array([k]*n)
for i in range(q):
	point=point-1
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split(' '))
scores = [k for i in range(n)]
for i in range(q):
    a = int(input())
    for j in range(n):
        scores[j] -= 1
    scores[a-1] += 1
for i in range(n):
    if scores[i] > 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split(' '))
scores = [k for i in range(n)]
for i in range(q):
    a = int(input())
    for j in range(n):
        scores[j] -= 1
    scores[a-1] += 1
for i in range(n):
    if i > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split(" "))
A = [int(input()) for i in range(Q)]

score = [K for i in range(N)]

tmp = []
for i in range(N):
    tmp.append(A.count(i+1)) #正解数
# 得点は, 最初の点数 - 他人の正解数
# 他人の正解数は, 問題数 - 自分の正解数
# 得点は, 最初の点数 + 問題数 - 自分の正解数
# 得点 > 0 であれば, "Yes"
for i in range(N):
    if K + Q - tmp[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or k-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or k-q>=0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())

point_list = [0 for i in range(N)]

for i in range(Q):
  num = int(input()) - 1
  point_list[num] += 1

for i in point_list:
  if 0 > K - Q + i:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())

point_list = [0 for i in range(N)]

for i in range(Q):
  num = int(input()) - 1
  point_list[num] += 1

for i in point_list:
  if i > K - Q:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]-1]+=1
for i in range(n):
    if point[i]==max(point) or k-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]-1]+=1
for i in range(n):
    if point[i]==max(point):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int, input().split())

P = [0] * N


 
for i in range(Q):
	A = int(input())
	P[A-1] += 1


for j in range(0,len(P)):
	if K - Q + P[j] > 0:
		print('Yes')
	else:
		print('No')
print(P)

Submission status: Wrong Answer

Solution code:
import time

t1 = time.time()

n,k,q = map(int,input().split())
a = [k-q]*n

t2 =time.time()

for i in range(q):
	a[int(input())-1] += 1

t3 = time.time()

for i in a:
	print('Yes' if i>0 else 'No')

t4 = time.time()

print(t2-t1)
print(t3-t2)
print(t4-t3)

Submission status: Wrong Answer

Solution code:
import numpy as np
N , K ,Q = map(int, input().split())
initializer_list = [0] * N
print(initializer_list)
for _ in range(Q):
    i = int(input())-1
    initializer_list[i] += 1
    

[print('Yes') if (Q - initializer_list[i] < K) else print('No')  for i in range(N)]

Submission status: Wrong Answer

Solution code:
n,k,q=map(int,input().split())
A=[0]*n
for i in range(q):
  A[int(input())-1]+=1
for i in range(n):
  if k-q+2*A[i]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int,input().split())

A = [int(input()) for i in range(q)]

a = k-q+1

for i in range(1,n+1):
    v = A.count(i)
    if v >= a and v > 0:
        print('Yes')
        continue
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())

min_c = Q - K + 1

print(type(min_c))

num = [0]*N

for i in range(Q):
    a = int(input())
    num[a-1]+=1

print(min_c , num)
for j in num:
    if j >= min_c:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n=[int(i) for i in input().split()]
array=[]
for i in range(n[0]):
  array.append(n[1])
for i in range(n[2]):
  array[int(input())-1]+=1
for i in range(n[2]):
  for i in range(n[0]):
    array[i]-=n[2]
    if(array[i]<=0):
      print("No")
    else:
      print("Yes")

Submission status: Wrong Answer

Solution code:
first_line = input()
first_line = first_line.split(" ")
K = int(first_line[1])

points = [0] * int(first_line[0])
alives = list(range(len(points)))

for i in range(int(first_line[2])):
    answer = int(input())
    points[answer-1]+=1

for j, p in enumerate(points):
    points[j] = 13 - (15 - points[j])

for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
inp = list(map(int,input().split()))
question = [int(input()) for i in range(inp[2])]
point = []
sinshutu = []
for i in range(inp[0]):
    point.append(inp[1])
    sinshutu.append('No')

for i in range(inp[2]):
    point[question[i]-1] = point[question[i]-1]+1

point = list(map(lambda x:x-4, point))

for i in range(len(point)):
    if point[i] > 0:
        sinshutu[i] = 'Yes'
    print(sinshutu[i])

Submission status: Wrong Answer

Solution code:

N,K,Q = map(int,input().split())
a = []
b = []
c = K-Q
for i in range(Q):
    a.append(int(input()))
    
for i in range(N):
    b.append(a.count(i+1))
    print(b[i])
    
for i in range(N):
    result = c+int(b[i])
    if result <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
inp = list(map(int,input().split()))
question = [int(input()) for i in range(inp[2])]
point = []
sinshutu = []
for i in range(inp[0]):
    point.append(inp[1])
    sinshutu.append('No')

for i in range(inp[2]):
    point[question[i]-1] = point[question[i]-1]+1

point = list(map(lambda x:x-4, point))

for i in range(len(point)):
    if point[i] > 0:
        sinshutu[i] = 'Yes'

print(sinshutu)

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
p = [0]*n
for i in range(n):
    p[i]=a.count(i+1)
    if k>q:
        print('Yes')
    if k+p[i]-q<=0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
N,K,Q = (int(x) for x in input().split())
for i in range(Q):
  A = int(input())
  if A == i+1: 
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, input().split())
a = []
for _ in range(q):
    a.append(input())
b = [k-q]*n
i = 1
for _ in range(n):
 s = str(i)
 #print(a.count(s))
 if a.count(s) > k-q+1:
  print("Yes")
 else:
  print("No")
 i = i + 1

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, input().split())
a = []
for _ in range(q):
    a.append(input())
b = [k-q]*n
i = 1
for _ in range(n):
 s = str(i)
 #print(a.count(s))
 if a.count(s) > k-q:
  print("Yes")
 else:
  print("No")
 i = i + 1

Submission status: Wrong Answer

Solution code:
# def
class attack_survival():
    def __init__(self, num_of_member, num_of_question, points):
        self.num_of_member = num_of_member
        self.num_of_question = num_of_question
        self.points = points

    def count_correct(self, correct_list):

        rv = [0] * (self.num_of_member + 1)
        for i in correct_list:
            rv[i] += 1

        self.count_list = rv

    def check_result(self):
        for i in range(1, self.num_of_member+1):
            if (self.points + self.count_list[i] - self.num_of_question) > 0:
                print('Yes')
            else:
                print('No')

        return True
# input
N,K,Q = list(map(int, input().split()))
input_list = []
for i in range(1, Q):
    input_list.append(int(input()))

# test input
#N,K,Q = list(map(int, [6, 3, 4]))
#input_list = [3,1,3,2]

# main

game = attack_survival(N,Q,K)
game.count_correct(input_list)
game.check_result()