ZhenlongDai/ACPR huggingface dataset:
Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []

SCORE = [0] * N

for i in range(Q):
  SCORE[int(input())-1] += 1
print(SCORE)
for i in range(N):
  if(SCORE[i]<= Q-K):
    print("No")
  else:
    print("Yes")

Failing test case input:
10 1 1
3
1
0
2

Expected output:
No
No
Yes
No
No
No
No
No
No
No


Actual output:
[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
No
No
Yes
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []

SCORE = [0] * N

for i in range(Q):
  SCORE[int(input())-1] += 1
for i in range(N):
  if(SCORE[i]<= Q-K):
    print("No")
  else:
    print("Yes")

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N, K ,Q  = map(int, input().split())
result = {}
for i in range(Q):
  winner = int(input())
  result[winner] = result.get(winner,0) + 1


for i in range(N):


  if K - (Q - result.get(i + 1, 0)) > 0:
    print("yes")
  else:
    print("No")

Failing test case input:
6 3 4
4
2
6
4

Expected output:
No
No
No
Yes
No
No


Actual output:
No
No
No
yes
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
result = {}
for i in range(Q):
    winner = int(input())
    result[winner] = result.get(winner, 0) + 1

for i in range(N):
    if K - (Q - result.get(i + 1, 0)) > 0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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")

Failing test case input:
49 8 3
4
0
4
2
7
0
2
12
1
6
13
8
1
7
13

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
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
for i in range(n):
    if point[i]-q>0:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = list(map(int,input().split()))

a = [int(input()) for i in range(n[2])]

for i in range(n[0]):
    if n[1]-(n[2]-a.count(i)) <= 0:
        print('No')
    else:
        print('Yes')


Failing test case input:
37 8 12
3
1
5
1
5
0
5
6
5
6
5
13
0
0
0

Expected output:
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
import collections
n = list(map(int,input().split()))

a = [int(input()) for i in range(n[2])]
kk = n[1]-n[2]


counter = collections.Counter(a)

for i in range(n[0]):
    if kk+counter[i+1] <= 0:
        print('No')
    else:
        print('Yes')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q=map(int,input().split())
N= [k]*n
L = [-q]*n
for _ in range(q): L[int(input())-1] += 1 
N= map(lambda x,y: x+y, N,L)
for i in N:
    print('YES' if i>0 else 'NO')


Failing test case input:
13 0 4
3
1
6
4

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
N = [k]*n
L = [-q]*n
for _ in range(q): L[int(input())-1]+=1
N = map(lambda x,y:x+y, N,L)
for p in N: print("Yes" if p>0 else "No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N,K,Q = map(int,input().split(" "))


ans = [K - Q for i in range(N)]


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

for a in ans:
    if a > 0:
        print("Yes")
    else:
        print("No")

Failing test case input:
32 1 1
1
1
0
1

Expected output:
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):

N,K,Q = map(int,input().split(" "))


ans = [K - Q for i in range(N)]


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

for a in ans:
    if a > 0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int,input().split())
A=[int(input()) for _ in range(q)]

p=[0]*n

for a in A:
    p[a-1]+=1
    
for P in p:
    if q-P < k:
        print("yes")
    else:
        print("no")
        

Failing test case input:
9 1 0
6
1
3
4

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
yes
yes
yes
yes
yes
yes
yes
yes
yes


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
A=[int(input()) for _ in range(q)]

p=[0]*n

for a in A:
    p[a-1]+=1
    
for P in p:
    if q-P < k:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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")


Failing test case input:
6 1 4
3
1
3
2

Expected output:
No
No
No
No
No
No


Actual output:
[1, 1, 1, 1, 1, 1]
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
sanka = [K for _ in range(N)]

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

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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q = map(int, input().split())

la = list()
for i in range(Q):
    la.append(int(input()))

lcount = [0] * N
for i in range(Q):
    lcount[la[i]-1] += 1
print(lcount)
for i in range(N):
    if K+lcount[i]-Q > 0:
        print("Yes")
    else:
        print("No")


Failing test case input:
6 3 4
3
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
[0, 1, 1, 1, 0, 1]
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())

la = list()
for i in range(Q):
    la.append(int(input()))

lcount = [0] * N
for i in range(Q):
    lcount[la[i]-1] += 1

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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q = map(int, input().split())
A = [Q-K]*N
for i in range(Q):
    a = int(input())
    A[a-1] += 1

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

Failing test case input:
40 16 15
5
1
8
1
9
1
2
6
5
8
6
8
1
1
0

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes
No
No
No
Yes
Yes
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [K-Q]*N
for i in range(Q):
    a = int(input())
    A[a-1] += 1

for i in range(N):
    if A[i]> 0:
        print('Yes')
    else:
        print('No')
Problem: p02911
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N,K,Q=map(int,input().split())
A=[int(input()) for _ in range(Q)]
L=[K-Q]*N
for i in range(Q):
    L[A[i]-1]+=1
print(L)
for j in range(N):
    if  L[j]<=0:
        print('No')
    else:
        print('Yes')

Failing test case input:
47 11 15
3
1
8
1
3
0
3
3
3
6
8
13
0
0
0

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[-2, -4, 1, -4, -4, -3, -4, -2, -4, -4, -4, -4, -3, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, 0]
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N,K,Q=map(int,input().split())
A=[int(input()) for _ in range(Q)]
L=[K-Q]*N
for i in range(Q):
    L[A[i]-1]+=1
for j in range(N):
    if  L[j]<=0:
        print('No')
    else:
        print('Yes')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q=map(int,input().split())
a=[int(input()) for _ in range(q)]
point=[0 for _ in range(n)]
for i in range(q):
  point[a[i]-1]+=1
for x in point:
  print('Yes' if x-q+k>0 else 'NO')


Failing test case input:
49 8 12
3
1
2
0
5
0
5
6
5
6
5
13
0
0
0

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO


Fixed submission (verdict: Accepted):
n,k,q=map(int,input().split())
a=[int(input()) for _ in range(q)]
point=[0 for _ in range(n)]
for i in range(q):
  point[a[i]-1]+=1
for x in point:
  print('Yes' if x-q+k>0 else 'No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

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

A=[int(input()) for _ in range(Q)]


points=[K for _ in range(N)]



points=list(map(lambda x: x - Q, points))

for a in A:
    points[a-1] += 1

print(list(map(lambda x: 'Yes' if x > 0 else 'No', points)))


Failing test case input:
6 5 4
3
1
3
2

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes

Actual output:
Yes, Yes, Yes, Yes, Yes, Yes

Fixed submission (verdict: Accepted):

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

A=[int(input()) for _ in range(Q)]


points=[K for _ in range(N)]



points=list(map(lambda x: x - Q, points))

for a in A:
    points[a-1] += 1



for point in points:
    print('Yes' if point > 0 else 'No')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
score_list = [k-q for _ in range(n)]
for i in range(q):
    tmp = int(input())
    score_list[tmp - 1] = score_list[tmp - 1] + 1

print(score_list)
for j in score_list:
    if j > 0:
        print("Yes")
    else:
        print("No")


Failing test case input:
10 0 4
3
1
0
2

Expected output:
No
No
No
No
No
No
No
No
No
No


Actual output:
[-3, -3, -3, -4, -4, -4, -4, -4, -4, -3]
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
score_list = [k-q for _ in range(n)]
for i in range(q):
    tmp = int(input())
    score_list[tmp - 1] = score_list[tmp - 1] + 1

for j in score_list:
    if j > 0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q=map(int,input().split())
K -= Q
nP = [ K for i in range(N)]

for i in range(Q):
  Tmp = int(input())
  nP[Tmp - 1] += 2

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


Failing test case input:
37 12 15
5
1
8
1
9
0
2
6
5
8
5
22
1
1
0

Expected output:
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
No
No
No
Yes
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes


Fixed submission (verdict: Accepted):
N, K, Q=map(int,input().split())
K -= Q

nP = [ K for i in range(N)]
 
for i in range(Q):
  Tmp = int(input())
  nP[Tmp - 1] += 1


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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from collections import Counter
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
data = [K-Q]*N
C = Counter(A)
for i,j in C.items():
  data[i-1] += j
  print(i,j)
for i in range(N):
  if data[i] > 0:
    print("Yes")
  else:
    print("No")

Failing test case input:
37 8 15
3
0
8
1
5
0
2
6
5
6
5
8
1
0
13

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
3 1
0 3
8 2
1 2
5 3
2 1
6 2
13 1
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
from collections import Counter
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
data = [K-Q]*N
C = Counter(A)
for i,j in C.items():
  data[i-1] += j
for i in range(N):
  if data[i] > 0:
    print("Yes")
  else:
    print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q = map(int,input().split())

import sys

if K > Q:
    for i in range(N):
        print('Yes')
        sys.exit()

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

for i in range(N):
    temp = A.count(i+1)
    if K > Q-temp:
        print('Yes')
    else:
        print('No')


Failing test case input:
9 1 0
6
1
3
4

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes


Fixed submission (verdict: Accepted):
N,K,Q = map(int,input().split())

A = []

for i in range(Q):
    A.append(int(input()))

points = [K-Q]*N

for i in range(Q):
    points[A[i]-1] += 1

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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
count = [int(input()) - 1 for _ in range(q)]
score = [0 for _ in range(n)]
for i in count:
    score[i] += 1
for i in score:
    if i >= k:
        print("No")
    else:
        print("Yes")

Failing test case input:
52 1 3
11
1
15
1
1
-1
2
6
0
19
5
8
1
7
1

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
count = [int(input()) - 1 for _ in range(q)]
score = [0 for _ in range(n)]
for i in count:
    score[i] += 1
for i in score:
    if i <= q-k:
        print("No")
    else:
        print("Yes")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]

pt = [k-q for _ in range(n)]
for i in a:
    pt[i-1] += 1

print(pt)
for i in pt:
    if i > 0:
        print("Yes")
    else:
        print("No")

Failing test case input:
16 1 0
3
1
-1
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]

pt = [k-q for _ in range(n)]
for i in a:
    pt[i-1] += 1

for i in pt:
    if i > 0:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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')

Failing test case input:
29 8 15
4
1
4
1
5
0
2
12
5
6
10
7
0
7
13

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split(" "))
liste = [(k-q) for i in range(n)]
for i in range(q):
    a = int(input())
    liste[a-1] += 1
for i in liste:
    if i > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = (int(i) for i in input().split())
x = [0]*n
for i in range(q):
    a = int(input()) - 1
    x[a] = x[a] + 1

if q < k:
    for i in range(n):
        print('Yes')

for i in range(n):
    if k - q + x[i] > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
19 1 0
3
1
-1
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = (int(i) for i in input().split())
x = [0]*n
for i in range(q):
    a = int(input()) - 1
    x[a] = x[a] + 1

if q < k:
    for i in range(n):
        print('Yes')
else:
    for i in range(n):
        if k - q + x[i] > 0:
            print('Yes')
        else:
            print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q = map(int,input().split())
A = []
for _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 0 :
    print('yes')
  else :
    print('No')

Failing test case input:
37 11 15
3
1
8
1
3
0
3
3
3
6
8
13
0
0
0

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N,K,Q = map(int,input().split())
A = []
for _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 0 :
    print('Yes')
  else :
    print('No')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K ,Q = list(map(int, input().split()))
Point = [K for n in range(N)]

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

print(Point)
for n in range(N):
    if Point[n] - Q > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
19 8 15
3
1
4
1
5
0
2
6
5
3
5
8
9
7
9

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[10, 9, 10, 9, 11, 9, 9, 9, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9]
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K ,Q = list(map(int, input().split()))
Point = [K for n in range(N)]
for q in range(Q):
    A = int(input()) - 1
    Point[A] += 1

for n in range(N):
    if Point[n] - Q > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n,k,q=map(int,input().split())
lst=[0]*n
for i in range(q):
  person=int(input())
  lst[person-1]+=1
for p in range(n):
  temp=k-q+lst[p-1]
  if temp<=0:
    print("No")
  else:
    print("Yes")

Failing test case input:
37 8 9
3
1
6
1
5
0
1
6
9
7
9
16
1
0
13

Expected output:
Yes
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
Yes
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q=map(int,input().split())
lst=[0]*n
for i in range(q):
  person=int(input())
  lst[person-1]+=1
for p in range(n):
  temp=k-q+lst[p]
  if temp<=0:
    print("No")
  else:
    print("Yes")

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n,k,q = map(int,input().split())
a = [int(input()) for A in range(q)]
ans = [k]*(n+1)
for i in range(1,q+1):
	ans[a[i-1]] += 1
print(ans)
for j in range(1,n+1):
	ans[j] -= q
ans.pop(0)
for h in range(n):
	print("Yes" if ans[h] > 0 else "No")

Failing test case input:
52 1 3
11
1
15
1
1
-1
2
6
0
19
5
8
1
7
1

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
a = [int(input()) for A in range(q)]
ans = [k]*(n+1)
for i in range(1,q+1):
	ans[a[i-1]] += 1
for j in range(1,n+1):
	ans[j] -= q
ans.pop(0)
for h in range(n):
	print("Yes" if ans[h] > 0 else "No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def minus(a):
  return a-1

a = input().split(" ")
mem = [int(a[1])] * int(a[0])
print(mem)
for i in range(int(a[2])):
  mem[int(input())-1] += 1
  mem = list(map(minus, mem))
for i in mem:
  if i < 1:
    print("No")
  else:
    print("Yes")

Failing test case input:
42 8 15
3
1
8
1
5
0
3
6
3
1
5
0
0
0
0

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
a = input().split(" ")
mem = [0] * int(a[0])
for i in range(int(a[2])):
  mem[int(input())-1] += 1
for i in range(int(a[0])):
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[-k]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')


Failing test case input:
31 1 0
-1
4
1
4

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[k-q]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):

from collections import defaultdict
n,k,q=map(int,input().split())
d = defaultdict(int)
for i in range(q):
        a = int(input())
        d[a]+=1
for i in range(1,n+1):
        if k-(q-d[i]) <=0:
                print("NO")
        else:
                print("YES")


     


Failing test case input:
16 8 15
3
1
6
0
5
1
2
6
5
3
5
4
9
7
9

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO


Fixed submission (verdict: Accepted):
from collections import defaultdict
n,k,q=map(int,input().split())
d = defaultdict(int)
for i in range(q):
        a = int(input())
        d[a]+=1
for i in range(1,n+1):
        if k-(q-d[i]) <=0:
                print("No")
        else:
                print("Yes")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int,input().split())

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

a = q-k+1

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


Failing test case input:
40 16 15
5
1
8
1
9
1
2
6
5
8
6
8
1
1
0

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes
Yes
No
No
Yes
Yes
No
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
n = [K - Q] * N
for i in range(Q):
    n[A[i]-1] += 1
for i in range(N):
    if n[i] > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n,k,q = map(int,input().split())

S=[0]*n
for i in range(q):
    a = int(input())
    S[a-1]+=1
    
print( S, max(S) )

for i in range(n):
    if S[i]>q-k :
        print("Yes")
    else:
        print("No")


Failing test case input:
35 8 15
3
1
9
0
5
2
3
1
5
1
5
-1
1
0
0

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[4, 1, 2, 0, 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3] 4
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())

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

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, k, q = map(int, input().split())
p = [-q+k]*n

for i in range(0, q):
    p[int(input())-1] += 1
print(p)
for i in range(0, n):
    if p[i] > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
37 16 15
3
1
8
1
9
0
2
6
5
6
5
13
1
1
0

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
[5, 2, 2, 1, 3, 3, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3]
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
p = [-q+k]*n

for i in range(0, q):
    p[int(input())-1] += 1
for i in range(0, n):
    if p[i] > 0:
        print('Yes')
    else:
        print('No')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int,input().split())
n_point = [k]*n
A = [int(input()) for x in range(q)]
for i in range(q):
    n_point[A[0]-1]+=1
for i in range(n):
    n_point[i]-=q
for i in range(n): 
    if n_point[i] > 0:
        print('Yes')
    else :
        print('No')

Failing test case input:
37 8 12
3
1
5
1
5
0
5
6
5
6
5
13
0
0
0

Expected output:
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
n_point = [k]*n
A = [int(input()) for x in range(q)]
for i in range(q):
    n_point[A[i]-1]+=1
for i in range(n):
    n_point[i]-=q
for i in range(n): 
    if n_point[i] > 0:
        print('Yes')
    else :
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int, input().split())

score = [k-q]*n

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

print(score)

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

Failing test case input:
16 1 0
3
1
-1
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n,k,q = map(int, input().split())

score = [k-q]*n

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



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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = list(map(int, input().split()))
a = [int(input()) for i in range(q)]
p = [k - q] * n

for i in range(q):
    for j in range(n):
        if(j + 1 == a[i]):
            p[j] += 1
print(p)
for i in range(n):
    if(p[i] > 0):
        print('Yes')
    else:
        print('No')


Failing test case input:
6 1 1
6
1
3
2

Expected output:
No
No
No
No
No
Yes


Actual output:
[0, 0, 0, 0, 0, 1]
No
No
No
No
No
Yes


Fixed submission (verdict: Accepted):
n, k, q = list(map(int, input().split()))
a = [int(input()) for i in range(q)]
p = [k - q] * n
for i in range(q):
    p[a[i] - 1] += 1
for i in range(n):
    if(p[i] > 0):
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
member = ["No"] * N

for a in set(A):
    if(A.count(a) >= Q - K + 1):
        member[a - 1] = "Yes"

for m in member:
    print(m)

Failing test case input:
6 5 4
3
0
3
2

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
Yes
Yes
No
No
Yes


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

member = [K - Q] * N

for a in A:
    member[a - 1] += 1

for m in member:
    if m > 0: print("Yes")
    else: print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q=map(int, input().split())
A=[]
for i in range(0,Q):
    A.append(int(input()))
for i in range(0,N):
    if K<Q and K+A.count(i+1)-Q<=0:
        print("No")
    else:
        print("Yes")

Failing test case input:
17 1 1
2
1
0
1

Expected output:
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
N,K,Q=map(int, input().split())
M=K-Q
A=[M]*N
for i in range(Q):
    B=int(input())
    A[B-1]+=1
for i in range(N):
    if A[i]<1:
        print("No")
    else:
        print("Yes")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q = map(int,input().split())
A = []
p = []
A = [i for i in range(Q)]

for i in range(N):
    p.append(A.count(i+1))
    P = K - Q + p[i]
    if P > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
17 1 1
6
1
0
2

Expected output:
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
p = [0] * N 
for i in A:
    p[i-1] += 1    

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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
ac_list = [-Q+K-1 for _ in range(N)]


for i in A:
  ac_list[i-1] += 1 

for i in ac_list:
  if i <= 0:
    print("No")
  else:
    print("Yes")
  

Failing test case input:
8 1 1
4
1
0
2

Expected output:
No
No
No
Yes
No
No
No
No


Actual output:
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
ac_list = [-Q+K-1 for _ in range(N)]


for i in A:
  ac_list[i-1] += 1 

for i in ac_list:
  if i < 0:
    print("No")
  else:
    print("Yes")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input().split()
p = []

for i in range(int(n[0])):
  p.append(int(n[1]))
  
for i in range(int(n[2])):
  a = input()
  a = int(a)
  p[a-1] += 1

for i in p:
  i -= int(n[1])
  if 0 < i:
    print("yes")
  else:
    print("No")

Failing test case input:
16 1 0
3
1
-1
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n = input().split()
p = []

for i in range(int(n[0])):
    p.append(int(n[1]))

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

for i in p:
    i -= int(n[2])
    if 0 < i:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int, input().split())

lista = []
for i in range(n):
    lista.append(k-q)
print(lista)
for i in range(q):
    num = int(input())-1
    lista[num] = lista[num] +1
    
print(lista)
for i in range(n):
    if lista[i] > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
85 8 15
0
1
11
4
3
0
3
10
5
32
3
20
0
0
0

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[-7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7]
[-6, -7, -4, -6, -6, -7, -7, -7, -7, -6, -6, -7, -7, -7, -7, -7, -7, -7, -7, -6, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -6, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -7, -2]
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int, input().split())

lista = []
for i in range(n):
    lista.append(k-q)

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

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

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
input = sys.stdin.readline

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

points = [K - Q] * N

for i in A:
    points[i - 1] += 1
for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")
print(points)

Failing test case input:
31 0 0
-1
2
1
4

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

points = [K - Q] * N

for i in A:
    points[i - 1] += 1
for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q=map(int,input().split(" "))
A=[]
for _ in range(Q):
    A.append(int(input()))

ans=[K for _ in range(N)]
for q in A:
    ans[q-1]+=1
print(ans)
for a in ans:
    if a>Q:
        print("Yes")
    else:
        print("No")


Failing test case input:
2 1 0
7
1
4
4

Expected output:
Yes
Yes


Actual output:
[1, 1]
Yes
Yes


Fixed submission (verdict: Accepted):
N,K,Q=map(int,input().split(" "))
A=[]
for _ in range(Q):
    A.append(int(input()))

ans=[K for _ in range(N)]
for q in A:
    ans[q-1]+=1
for a in ans:
    if a>Q:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
li = [0 for _ in range(n)]

for _ in range(q):
    li[int(input())-1] += 1

print(li)
for j in li:
    if k - q + j > 0:
        print("Yes")
    else:
        print("No") 

Failing test case input:
17 1 1
6
1
0
2

Expected output:
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
li = [0 for _ in range(n)]

for _ in range(q):
    li[int(input())-1] += 1

for j in li:
    if k - q + j > 0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int,input().split())
points = [k-q]*n

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

for j in range(len(points)):
  if points[j] <= 0:
    print('NO')
  else:
    print('YES')

Failing test case input:
71 8 15
3
1
8
1
5
0
3
7
5
6
5
13
0
0
0

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO


Fixed submission (verdict: Accepted):
n, k, q = map(int,input().split())
points = [k-q]*n

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

for j in range(len(points)):
  if points[j] <= 0:
    print('No')
  else:
    print('Yes')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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")

Failing test case input:
37 12 15
5
1
8
1
9
0
2
6
5
8
5
22
1
1
0

Expected output:
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Counter({1: 4, 5: 3, 8: 2, 0: 2, 9: 1, 2: 1, 6: 1, 22: 1})
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())\

menber = [0]*n
if q-k > 0:
    for i in range(q):
        ans = int(input())
        menber[ans-1] += 1
else:
    menber = [100000]*n

for j in menber:
    if j > q-k:
        print('Yes')
    else:
        print('No')

Failing test case input:
10 1 1
3
1
0
2

Expected output:
No
No
Yes
No
No
No
No
No
No
No


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())

menber = [0]*n
if q-k >= 0:
    for i in range(q):
        ans = int(input())
        menber[ans-1] += 1
else:
    menber = [1000000]*n

for j in menber:
    if j > q-k:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q=map(int,input().split())
a_list=[int(input()) for i in range(q)]

for i in range(n):
  if a_list.count(i) > q-k:
    print("Yes")
  else:
    print("No")

Failing test case input:
37 11 15
3
1
8
1
3
0
3
3
3
6
8
13
0
0
0

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q=map(int,input().split())
li=[0]*n
for i in range(q):
  a=int(input())
  li[a-1]+=1
for i in range(n):
  if li[i]>q-k:
    print("Yes")
  else:
    print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q = [int(x) for x in input().split()]

scores = [K] * N
for i in range(Q):
    ans = int(input())
    scores[ans - 1] += 1
    

for score in scores:
    print('Yes' if score > 0 else 'No')


Failing test case input:
66 8 15
0
1
8
2
5
0
3
6
5
8
7
20
1
0
0

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
N, K, Q = [int(x) for x in input().split()]

scores = [K - Q] * N
for i in range(Q):
    ans = int(input())
    scores[ans - 1] += 1
    

for score in scores:
    print('Yes' if score > 0 else 'No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q =  map(int,input().split())
scores = [0]*n
b = 0
while b < q:
    ans = int(input()) - 1 
    scores[ans] += 1
    b += 1
for x in scores:
    if k-(q-x):
        print('Yes')
    else:
        print('No')

Failing test case input:
19 8 15
3
0
4
1
5
0
2
6
5
6
5
8
1
7
13

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n,k,q =  map(int,input().split())
scores = [0]*n
b = 0
while b < q:
    ans = int(input()) - 1 
    scores[ans] += 1
    b += 1
for x in scores:
    if k-(q-x) > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
print(a)
for i in range(n):
  if (k - q + a.count(i+1) > 0):
    print("Yes")
  else:
    print("No")


Failing test case input:
52 1 3
11
1
15
1
1
-1
2
6
0
19
5
8
1
7
1

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[11, 1, 15]
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
from collections import Counter
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
c = Counter(a)
for i in range(n):
  if (k - q + c.get(i+1, 0) > 0):
    print("Yes")
  else:
    print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)) 




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

Failing test case input:
18 8 15
3
1
4
1
5
0
2
6
5
3
5
8
1
7
13

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split(" "))    
A = [int(input()) for i in range(Q)]    
B = [0 for i in range(N)]    

for i in range(Q):
    num_ans_person = A[i] - 1
    B[num_ans_person] += 1





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

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int,input().split()))
n = a[0]
k = a[1]
q = a[2]
n_list = [0]*n
for i in range(q):
  seikaisha = int(input())
  n_list[seikaisha-1] += 1
  print(n_list)
for j in range(n):
  if n_list[j]+k-q > 0:
    print('Yes')
  else:
    print('No')

Failing test case input:
10 1 1
3
1
0
2

Expected output:
No
No
Yes
No
No
No
No
No
No
No


Actual output:
[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
No
No
Yes
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
a = list(map(int,input().split()))
n = a[0]
k = a[1]
q = a[2]
n_list = [0]*n
for i in range(q):
  seikaisha = int(input())
  n_list[seikaisha-1] += 1
  
for j in range(n):
  if n_list[j]+k-q > 0:
    print('Yes')
  else:
    print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
L = [k for i in range(n)]
a = [int(input()) for i in range(q)]

for i in a:
    L[i-1] = L[i-1] + 1

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

Failing test case input:
6 0 4
2
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
[0, 2, 0, 1, 0, 1]
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
L = [k for i in range(n)]
a = [int(input()) for i in range(q)]

for i in a:
    L[i-1] = L[i-1] + 1

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import collections

N,K,Q = map(int,input().split())
li = [int(input()) for i in range(Q)]
ans = [0]*N
lis = collections.Counter(li)
for w in lis:
    ans[w-1] = K-(Q-lis[w])
for i in range(N):
    if ans[i] <= 0:
        ans[i] = 'No'
    else:
        ans[i] = 'Yes'
    print(ans[i])


Failing test case input:
10 8 3
6
0
8
1
2
-1
2
6
0
10
5
8
1
7
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
No
No
No
No
Yes
No
Yes
No
Yes


Fixed submission (verdict: Accepted):
import collections

N,K,Q = map(int,input().split())
li = [int(input()) for i in range(Q)]
ans = [0]*N
lis = collections.Counter(li)
for w in lis:
    ans[w-1] = K-(Q-lis[w])
for i in range(N):
    if i+1 not in lis:
        ans[i] = K-Q
for i in range(N):
    if ans[i] <= 0:
        ans[i] = 'No'
    else:
        ans[i] = 'Yes'
    print(ans[i])

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, k, q = map(int, input().split())
a = [0] * q

for i in range(q):
    a[i] = int(input())
a_copy = [0] * n

for i in a:
    a_copy[i-1] += 1
print(a)
print(a_copy)
for i in a_copy:
    if q - i < k:
        print("Yes")
    else:
        print("No")


Failing test case input:
6 3 4
3
1
3
4

Expected output:
No
No
Yes
No
No
No


Actual output:
[3, 1, 3, 4]
[1, 0, 2, 1, 0, 0]
No
No
Yes
No
No
No


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
a = [0] * q

for i in range(q):
    a[i] = int(input())
a_copy = [0] * n

for i in a:
    a_copy[i-1] += 1

for i in a_copy:
    if q - i < k:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
seikaisuu = [0]*N
for answer in A:
    seikaisuu[answer-1] += 1
print(seikaisuu)
for x in seikaisuu:
    if K > Q - x:
        print("Yes")
    else:
        print("No")

Failing test case input:
37 11 15
3
1
8
1
3
0
3
3
3
6
8
13
0
0
0

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[2, 0, 5, 0, 0, 1, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4]
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
seikaisuu = [0]*N
for answer in A:
    seikaisuu[answer-1] += 1
for x in seikaisuu:
    if K > Q - x:
        print("Yes")
    else:
        print("No")