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

Solution (Python):
N,K,Q = map(int, input().split(" ")) 
A = [K]*N

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

for point in A:
    if point - Q <= 0 :
        print("No")
    else:
        print("Yes")

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

point_list = [K-Q]*N

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

Solution (Python):
import numpy as np
N,K,Q = map(int,input().split())
A = [int(input()) for x in range(Q)]
points = [K]*N
tmp = [1]*N
for i in range(Q):
    points[A[i]-1] += 1
points = list(np.array(points) - Q)
for i in range(len(points)):
    if points[i] > 0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):
N,K,Q = 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 value in P:
    if value<=0:
        print('No')
    else:
        print('Yes')

Solution (Python):
n,k,q = map(int,input().split())
a=[int(input()) for i in range(q)]
b=[k-q]*n
c=[0]*n

for i in range(q):
    b[a[i]-1] +=1
    
for i in range(n):
    if b[i]<=0:
        c[i]='No'
    else:
        c[i]='Yes'

for i in range(n):
    print(c[i])

Solution (Python):
N, K, Q = map(int, input().split())
score = {}
for i in range(Q):
	a = int(input())
	a = a-1
	if(a not in score):
		score[a] = 0
	score[a] = score[a] + 1


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

Solution (Python):
import collections

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

P = [K-Q]*N

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

cnt=collections.Counter(S)

for k,v in cnt.items():
  P[k-1] = P[k-1] + v
  
for i in P:
  if i > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):

n,k,q = list(map(int,input().split()))
kaitocnt = [0] * (n+1)
for _ in range(q):
    kaitocnt[int(input())]+=1

for i in range(1,n+1):
    if(k-q+kaitocnt[i] > 0):
        print("Yes")
    else:
        print("No")

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

K -= Q
points = [K] * N

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

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

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

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

n_list = [k - q for i in range(n)]

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

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

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

a_dict = dict((x, 0) for x in range(1, n + 1))
for i in range(q):
    a_dict[a[i]] += 1

for i in range(n):
    tmp = k - (q - a_dict[i + 1])
    if tmp > 0:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)

Solution (Python):
import collections

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

a_L = []
for val in range(q):
    a_L.append(int(input()))

a_L = [i-1 for i in a_L]

count = collections.Counter(a_L)

all_L = list(map(lambda x:x-q,[k]*n))

for val in range(n):
    point = all_L[val] + count[val]
    if point > 0:
        print("Yes")
    else:
        print("No")

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

lis = []
for _ in range(Q):
    lis.append(int(input()))

point = [K] * N

for i in range(Q):
    num = lis[i]
    point[num-1] += 1

for j in range(N):
    point[j] -= Q



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

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

point = [0] * N
for _ in range(Q):
    winnner = int(input())
    point[winnner-1] += 1

for p in point:
    if(p>Q-K):
        print('Yes')
    else:
        print('No')

Solution (Python):
N, K, Q = map(int, input().split())
lst = [0] * N
for _ in range(Q):
    lst[int(input()) - 1] += 1

for i in lst:
    if Q - i < K:
        print ('Yes')
    else:
        print ('No')

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

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

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

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

border = Q - K
  
for i in l:
  print("Yes" if i > border else "No")

Solution (Python):
[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):
    B[A[i]-1] += 1
for i in range(N):
    if K + B[i] - Q > 0:
        print('Yes')
    else:
        print('No')

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

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

Solution (Python):
n, k, q = map(int, input().split(" "))
a = [0 for _ in range(n)]
for i in range(q):
    winIndex = int(input()) - 1
    a[winIndex] += 1  

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

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

Solution (Python):
from collections import Counter
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

score = [K]*N
c = Counter(A)
for i, j in c.items():
    score[i-1] += j

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

Solution (Python):
N, K, Q = list(map(int, input().split()))
A = [0]*N
for _ in range(Q):
    A[int(input())-1]+=1

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

Solution (Python):
N, K, Q = map(int, input().split())
m = {}
mx = 0
for i in range(Q):
    ans = int(input()) - 1
    if ans not in m:
        m[ans] = 1
    else:
        m[ans] += 1
    mx = max(m[ans], mx)
    if mx + K == i:
        break
    

k = list(m.items())
ans = set()
for item in k:
    if item[1] + K > Q:
        ans.add(item[0])

for i in range(N):
    if i in ans:
        print("Yes")
    elif K > Q:
        print("Yes") 
    else:
        print("No")

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

suc = [0]*n
for aa in a:
    suc[aa-1]+=1

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

Solution (Python):
import numpy as np
N, K, Q = map(int, input().split(" "))
point_list = np.array([K-Q]*N)
ans_num_list = [int(input()) for _ in range(Q)]

num_answer_correct = np.array([0]*N)
for i in ans_num_list:
  num_answer_correct[i-1] += 1

point_list = point_list + num_answer_correct


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

Solution (Python):
import numpy as np

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

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

P = [K] * N
X = [-1] * N
B = [0] * N

P_n = np.array(P)
X_n = np.array(X)
X_n_Q = X_n * Q

R_n = P_n + X_n_Q

B_n = np.array(B)

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

dif_n = R_n + B_n
dif = dif_n.tolist()

for d in dif:
    if d >= 1:
        print('Yes')
    else:
        print('No')

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

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

ac_num = [0]*N

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

for i in range(N):
    res[i] -= (Q - ac_num[i])


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

Solution (Python):
inp_list = list(map(int, input().split()))
n = inp_list[0]
k = inp_list[1]
q = inp_list[2]
ans_list = [k-q]*n
for i in range(q):
    ans_list[int(input())-1] += 1

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

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

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

Solution (Python):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Solution (Python):
N, K, Q = map(int, input().split())
A = list()
for n in range(Q):
	A.append(int(input()))
P = [K-Q for x in range(N)]
for a in A:
	P[a-1] += 1
for x in P:
	if x > 0:
		print("Yes")
	else:
		print("No")

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

ans_list = []
for _ in range(q):
   ans_list.append(int(input()))

n_list = [k-q]*n

for i in range(len(ans_list)):
   n_list[ans_list[i] - 1] += 1

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

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

li_a = list()
d_seikai = dict()
for i in range(q):
    in_a = int(input())
    li_a.append(in_a)
    d_seikai[in_a] = d_seikai.get(in_a, 0) + 1

for m in range(1, n + 1):
    seikai = d_seikai.get(m, 0)
    machigai = q - seikai

    if k <= machigai:
        print("No")
    else:
        print("Yes")

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

Solution (Python):
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('No')
    else:
        print('Yes')

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


d={}
for i in range(q):
  s=int(input())
  if not s in d.keys():
    d[s]=1
  else :
    d[s]+=1


pointl=[k-q for i in range(n)]

for k,v in d.items():
  pointl[k-1]+=v
for p in pointl:
  if p <= 0:
    print("No")
  else :
    print("Yes")

Solution (Python):
n,k,q = map(int, input().split())
a = [0]*n
for i in range(q):
  a[int(input())-1] += 1

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

Solution (Python):
n,k,q = map(int,input().split())
ans = [0]*n
for i in range(q):
    idx = int(input()) -1
    ans[idx] += 1
for i in ans:
    print('Yes' if q-k<i else 'No')

Solution (Python):
n,k,q = map(int,input().split())
ans = [0]*n
for i in range(q):
    idx = int(input()) -1
    ans[idx] += 1
for i in ans:
    print('Yes' if q-k<i else 'No')

Solution (Python):
N,K,Q=map(int,input().split())
L=[K]*N
for i in range(Q):
    A=int(input())
    L[A-1] += 1

for i in L:
    if i - Q > 0 :
        print("Yes")
    else :
        print("No")

Solution (Python):
from sys import stdin

N, K, Q = map(int, stdin.readline().split())

A = []
for i in range(Q):
    A.append(int(stdin.readline()))



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


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

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

Solution (Python):
data = input().split()
score = int(data[1])
tab = [score]*int(data[0])
n = int(data[2])
    
for i in range(n):
    value =int(input())
    tab[value - 1] += 1
    j =0
for i in tab:
    if (i > n):
        print ("Yes")
    else:
        print ("No")

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int, input().split())
li = lambda : list(map(int, input().split()))

import numpy as np
n,k,q = mi()
a=[int(input()) for i in range(q)]

point = np.array([k-q for i in range(n)])

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

ans = np.where(point>0, 'Yes', 'No')

print('\n'.join(ans))

Solution (Python):
n, k, q = map(int, input().split())
points = [k] * n


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

points = [p-q for p in points]
for i in points:
    if i >= 1:
        print('Yes')
    else:
        print('No')

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

point = []

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

Solution (Python):
import sys

N,K,Q=(int(x) for x in input().split())

par=[]
for i in range(N):
	par.append(K)

par = [0] * N

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




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

Solution (Python):
n,k,q = map(int,input().split())
A=[int(input()) for i in range(q)]
P=[k-q for i in range(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")

Solution (Python):
import math

I = list(map(int,input().split()))

N = I[0]
K = I[1]
Q = I[2]
A = []

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


score = [0] * N

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


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

Solution (Python):
numbers =input().rstrip().split(" ")
nop =int(numbers[0])
point =int(numbers[1])
nos =int(numbers[2])
seikais=[]
points=[]
for i in range(nos):
  seikais.append(int(input()))

base =point-nos
for i in range(nop):
  points.append(base)

for i in range(nos):
  points[seikais[i]-1]=points[seikais[i]-1]+1

for i in range(nop):
  if points[i]<=0:
    print("No")
  else:
    print("Yes")

Solution (Python):
N,K,Q=map(int,input().split())
count=[0]*N
for i in range(Q):
    count[int(input())-1]+=1


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

Solution (Python):
import collections
n, k, q = map(int, input().split())
a = [int(input()) for s in range(q)]
c = collections.Counter(a)
for i in range(n):
    if c[i+1]+k-q > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
sysIn = list(map(int, input().split()))
n,k,q = sysIn[0],sysIn[1],sysIn[2]
score = [k for x in range(n)]
for i in range(q):
    win = int(input())
    score[win-1]+=1
for i in range(n):
    if (score[i] - q > 0):
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
input = sys.stdin.readline

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

p=[-Q]*N

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

for i in range(N):
  if p[i]+K<1:
    print('No')
  else:
    print('Yes')

Solution (Python):
NKQ = list(map(int,input().split()))
point = [0]*NKQ[0]

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

for j in range(NKQ[0]):
    if NKQ[1] - NKQ[2] + point[j] > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k, q = map(int, input().split())
point = [0] * n

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


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

Solution (Python):


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

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

Solution (Python):
N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
points = [K-Q] * N

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

for i in points:
    ans = "Yes" if i>0 else "No"
    print(ans)

Solution (Python):
import sys

n, k, q = map(int, input().split())
a = [int(sys.stdin.readline().rstrip()) for _ in range(q)]

score = [0] * (n+1)
for i in a:
    score[i] += 1

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

Solution (Python):
N,K,Q = list(map(int,input().split()))
A = []
LIST = [K]*N
for i in range(Q):
    LIST[int(input())-1] +=1

for i in LIST:
    if(i-Q<=0):
        print('No')
    else:
        print('Yes')

Solution (Python):
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """6 3 4
3
1
3
2"""
        output = """No
No
Yes
No
No
No"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """6 5 4
3
1
3
2"""
        output = """Yes
Yes
Yes
Yes
Yes
Yes"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9"""
        output = """No
No
No
No
Yes
No
No
No
Yes
No"""
        self.assertIO(input, output)

def resolve():
    (N,K,Q)=(int(i) for i in input().split())
    A=[K-Q for i in range(N)]
    for i in range(Q):
        A[int(input())-1]+=1
    count=0
    for i in A:
        print("Yes" if i>0 else 'No')




if __name__ == "__main__":
    resolve()

Solution (Python):
N,K,Q = map(int,input().split())
scores = [K-Q for i in range(N)]
for i in range(Q):
    A = int(input())
    scores[A-1] += 1
for i in scores:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
n, k, q = list(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 p > len(A) - k:
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k, q = map(int, input().split())
p = [0] * n

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

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

Solution (Python):
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')

Solution (Python):
N, K, Q = map(int, input().split())
Ai = list(map(int, [input() for i in range(Q)]))
 
scores = [K-Q for i in range(N)]
 
for i in range(Q):
    scores[Ai[i] - 1] += 1
    scores = scores
 
for k in range(len(scores)):
    if scores[k] > 0 :
        print('Yes')
    else:
        print('No')

Solution (Python):
N, K, Q = map(int, input().split())
Ai = list(map(int, [input() for i in range(Q)]))

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

for i in range(Q):
    scores[Ai[i] - 1] += 1
    scores = scores


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

Solution (Python):
N , K , Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
score = [K-Q] * N
for i in range(Q):
  score[A[i] - 1] += 1

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

Solution (Python):
N,K,Q = (int(x) for x in input().split())

point = []
for i in range(N):
    point.append(K)

for i in range(N):
    point[i] -= Q

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

for i in range(N):
    if point[i] <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
num, poi, ans = [int(x) for x in input().split()]

list01 = [poi for x in range(num)]
list02 = [0 for x in range(num)]

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

for i in range(num):
  list02[i] = list02[i] + list01[i] - ans

for k in list02:
  if k <= 0:
    print("No")
  else:
    print("Yes")

Solution (Python):
import numpy as np
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

b = [k for _ in range(n)]
list = [0 for _ in range(n)]

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

for i in list:
    if q -k < i:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
n, k, q = map(int, input().split())
alist = [int(input()) for i in range(q)]
ans = [k - q] * n

for Ai in alist:
    ans[Ai - 1] += 1

for Ai in ans:
    print('Yes') if Ai > 0 else print('No')

Solution (Python):
from collections import Counter

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

count = Counter(aa)

for i in range(1,n+1):
  if count[i] + k > q:
    print('Yes')
  else:
    print('No')

Solution (Python):


import sys


args = sys.argv
if len(args) == 2:
  import IPython

def embed():
  if len(args) == 2:
    sys.stdin = open('/dev/tty')
    IPython.embed()


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

A = []
for i in range(0, Q):
  A.append(int(input()))

wins = [0] * N
for i in A:
  wins[i - 1] = wins[i - 1] + 1

embed()

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

Solution (Python):


import sys


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

A = []
for i in range(0, Q):
  A.append(int(input()))

wins = [0] * N
for i in A:
  wins[i - 1] = wins[i - 1] + 1




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

Solution (Python):
def main():
    N, K, Q, *A = map(int, open(0).read().split())
    ans = [0] * N
    for a in A:
        ans[a - 1] += 1
    print("\n".join("Yes" if Q < K + a else "No" for a in ans))
    return


main()

Solution (Python):
def main():
    N, K, Q, *A = map(int, open(0).read().split())
    ans = [0] * N
    for a in A:
        ans[a - 1] += 1
    print("\n".join(["Yes" if Q < K + a
                     else "No" for a in ans]))
    return


main()

Solution (Python):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K - Q for i in range(N)]

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

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

Solution (Python):
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
p = [0] * n

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

for i in p:
    if q - i >= k:
        print("No")
    else:
        print("Yes")

Solution (Python):
def count_num(num,dic):
    if num in dic.keys():
        dic[num] += 1
    else:
        dic[num] = 1
    return dic



NKQ = input().split()
A = [int(input()) for i in range(int(NKQ[2]))]
dic = {}
for i in A:
    dic = count_num(i,dic)

X = int(NKQ[1])-int(NKQ[2])
for j in range(1,int(NKQ[0])+1):
    if j in dic.keys():
        a = dic[j]
    else:
        a = 0
    if X+a > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(N, K, answers):
    min_point = K - len(answers)
    points = [min_point for i in range(N)]
    for a in answers:
        points[a-1] += 1
    return ['Yes' if p > 0 else 'No' for p in points]


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    [N, K, Q] = string_to_int(input())
    ret = solve(N, K, int_inputs(Q))
    for r in ret:
        print(r)

Solution (Python):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K - Q for i in range(N)]

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

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

Solution (Python):
from collections import Counter


def main():
    N, K, Q, *A = map(int, open(0).read().split())
    A = Counter(A)
    print("\n".join(["Yes" if Q < K + A[i]
                     else "No" for i in range(1, N + 1)]))
    return


main()

Solution (Python):
from collections import Counter
from sys import stdin


def main():
    lines = stdin.readlines()
    N, K, Q = map(int, lines[0].split())
    A = Counter([int(i) - 1 for i in lines[1:]])
    print("\n".join(["Yes" if Q < K + A[i] else "No" for i in range(0, N)]))
    return


main()

Solution (Python):
N, K, Q = map(int, input().split())
 
P = [0] * N
for i in range(Q):
    tmp = int(input()) - 1
    P[tmp] += 1
 
sumP = sum(P)
for n in range(N):
    ans = 'No'
    total = sumP - P[n]
    if  K - total > 0:
        ans = 'Yes'
    print(ans)

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

wins = [0 for i in range(N)]
for q in range(Q):
  winner = int(input()) - 1
  wins[winner] += 1

for n in range(N):
  print("Yes" if Q - wins[n] < K else "No")

Solution (Python):
def main():
    N, K, Q = map(int, input().split())
    lst_A = [int(input()) for _ in range(Q)]
    lst_miss = [K - Q] * N


    for A in lst_A:
        lst_miss[A - 1] += 1
    
    for miss in lst_miss:
        ans = "Yes" if miss > 0 else "No"
        print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
N, K, Q = input().strip().split()
N, K, Q = [int(N), int(K), int(Q)]
A = [0] * (Q+1)  
for i in range(1, Q+1):
    A[i] = int(input())


points = [K - Q] * (N+1)

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

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

Solution (Python):
def main():
    N, K, Q = map(int, input().split())
    
    lst_miss = [Q] * N
    for _ in range(Q):
        A = int(input())
        lst_miss[A - 1] -= 1
    
    for miss in lst_miss:
        ans = "Yes" if miss < K else "No"
        print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n,k,q=[int(i) for i in input().split()]
dif=q-k+1
ans=[0]*n
for i in range(q):
  ans[int(input())-1]+=1
for i in range(n):
  if ans[i]>=dif:
    print('Yes')
  else:
    print('No')

Solution (Python):
from sys import stdin
from collections import Counter

lines = stdin.readlines()

N, K, Q = map(int, lines[0].split())
ans = [0] * N
A = Counter([int(i) - 1 for i in lines[1:]])
for k in A.keys():
    ans[k] += A[k]
print("\n".join(["Yes" if Q < K + a
                 else "No" for a in ans]))

Solution (Python):
n, k, q = map(int, input().split())
A = list(int(input()) for _ in range(q))
M = list(k-q for _ in range(n))

for i in range(q):
  M[A[i]-1] += 1

for m in M:
  if m > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):
from sys import stdin
from collections import Counter

lines = stdin.readlines()

N, K, Q = map(int, lines[0].split())
ans = [0] * N
A = Counter((int(i) - 1 for i in lines[1:]))
for k in A.keys():
    ans[k] += A[k]
print("\n".join(("Yes" if Q < K + a
                 else "No" for a in ans)))

Solution (Python):
N,K,Q=map(int,input().split())
lst=[]
for i in range(Q):
  lst.append(int(input()))
Score=[0]*N
for i in range(Q):
  Score[lst[i]-1]+=1
  
for i in range(N):
  if Score[i]>Q-K:
    print('Yes')
  else:
    print('No')

Solution (Python):
N, K, Q = tuple(map(int, input().split()))
A = [int(input()) for _ in range(Q)]
points = [0] * N
for a in A:
    points[a-1] += 1
for p in points:
    if K - (Q - p) > 0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):


def reader(N):
    for n in range(N):
        yield input()

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

main()

Solution (Python):

data = input().split()
 

player = int(data[0])

initPoint = int(data[1])

question = int(data[2])
 

playerPoint = []
 
for i in range(player):
  playerPoint.append(initPoint - question)
 

for i in range(question):
  
  corrPlayer = int(input())
  
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  

for i in range(player):
  if playerPoint[i] <= 0:
    print('No')
  else:
    print('Yes')

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

pl = [0 for i in range(n)]

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

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



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