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):

import sys


def solve(N: int, K: int, Q: int, A: "List[int]"):

    arr = [K - Q] * N

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

    for go_or_not in arr:
        if go_or_not > 0:
            print("Yes")
        else:
            print("No")

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)


if __name__ == "__main__":
    main()

Solution (Python):

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

if k > q:
    for i in range(n):
        print('Yes')
else:
    ans = [k-q] * n
    for j in a:
        ans[j-1] += 1
    for h in range(n):
        if ans[h] <= 0:
            print('No')
        else:
            print('Yes')

Solution (Python):

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

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

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

from collections import Counter

counter = Counter(a_list)

if K>Q:
    
    base = 1
else:
    base = 0
winners = [base for _ in range(N+1)]
for i,cnt in counter.items():
    if K-Q+cnt > 0:
        winners[i] = 1

for win in winners[1:]:
    if win==1:
        print("Yes")
    else:
        print("No")

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

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

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

Solution (Python):
import sys
import numpy as np


N, K, Q = [int(i) for i in input().split()]
l = np.zeros(N)

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

s = ''
for i in range(N):
    if l[i] > x:
        s += 'Yes\n'
    else:
        s += 'No\n'

print(s.strip())

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

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

Solution (Python):
from sys import stdin
from collections import defaultdict
N,K,Q = [int(x) for x in stdin.readline().rstrip().split()]
cntdic = defaultdict()
for i in range(1,N+1):
    cntdic[i] = 0
for _ in range(Q):
    q = int(input())
    cntdic[q] += 1

for j in cntdic.values():
    if (K - Q + j) > 0:
        print("Yes")
    else:
        print("No")

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

cnt = [0 for _ in range(N)]

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

for c in cnt:
    if Q - c < K:
        print('Yes')
    else:
        print('No')

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

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

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

Solution (Python):
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)

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

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

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

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

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

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

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

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

Solution (Python):


'''
import numpy as np
def python_list_sub(in1, in2):
    wrk = np.array(in1) + np.array(in2)
    return wrk.tolist()
'''


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


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



for i in range(n):
    Po.append(int(k-q))




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


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

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

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

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

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

Solution (Python):
n,k,q = map(int, input().split())
a = sorted([int(input()) for i in range(q)])
d = {i+1:0 for i in range(n)}
for i in a:
  d[i] += 1
  
[print(["Yes","No"][k-q+d[i+1]<=0]) for i in range(n)]

Solution (Python):
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):
    print('Yes'if K-Q+A[i]>0 else'No')

Solution (Python):



N,K,Q=map(int,input().split())
a=[int(input()) for _ in range(Q)]
b=[0]*N
for i in a:
    b[i-1]+=1
for l in range(0,N,1):
    if(K+b[l]-Q>0):print("Yes")
    else:print("No")

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

Solution (Python):
import sys
input = sys.stdin.readline
N, K, Q = [int(value) for value in input().split(' ')]
A = [int(input()) for _ in range(Q)]

points = [K - Q] * N

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

for point in points:
    if point <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
N,K,Q = map(int, input().split())
A = {}
for i in range(Q):
    _ = int(input())
    if _ in A:
        A[_] += 1
    else:
        A[_] = 1
for i in range(N):
    try:
        print('Yes' if 0 < K - Q + A[i+1] else 'No')
    except KeyError as e:
        print('Yes' if 0 < K - Q else 'No')

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

Solution (Python):
from collections import Counter
import numpy as np

N, K, Q = input().split()
A = np.array([int(input()) for i in range(int(Q))])
T = np.full(int(N), int(K))
T -= int(Q)


s = Counter(A)
for key, value in s.items():
    T[(key-1)] += value
for i in T:
    if i <= 0:
        print("No")
    else:
        print("Yes")

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

for i in range(len(b)):
  lis[b[i]-1]-=1

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce



INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007



n,k,q=LI()
L=[k-q] * n
A = IR(q)



for l in A:
    L[l-1]+=1



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

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

for i in A:
    score[i-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())

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')

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

arr = [k - q] * n

for q_i in q_list:
    arr[q_i - 1] += 1

for go_or_not in arr:
    if go_or_not > 0:
        print("Yes")
    else:
        print("No")

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

for s in range(0,q):
  a = int(input()) - 1
  points[a] = points[a] + 1

for t in range(0, n):
  result = "Yes"
  if points[t] <= 0:
    result = "No"
  print(result)

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

p = [k-q]*(n)
for i in a:
    p[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())
a = [k-q]*n
for i in range(q):
	a[int(input())-1] += 1
for i in a:
	print('Yes' if i>0 else 'No')

Solution (Python):
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+A[i] <= 0:
        print("No")
    else:
        print("Yes")

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

Solution (Python):
import numpy as np
N , K ,Q = map(int, input().split())
initializer_list = [0] * N
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)]

Solution (Python):
import sys
input=sys.stdin.readline
N,K,Q=map(int,input().split())
A=[int(input()) for _ in range(Q)]
cnt=[0]*N
for x in A:
    cnt[x-1]+=1
for x in cnt:
    print('Yes' if K-Q+x>0 else 'No')

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


point = [k-q] * n

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




for i in point:
    if i <= 0:
        print("No")
    elif i >= 1:
        print("Yes")

Solution (Python):
nkq = input()
NKQ = nkq.split(" ")
point = []
for i in range(int(NKQ[0])):
  point.append(int(NKQ[1]) - int(NKQ[2])) 
for j in range(int(NKQ[2])):
  Ai = int(input()) - 1
  point[Ai] = point[Ai] + 1
for k in range(int(NKQ[0])):
  if point[k] > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):

import sys
import numpy as np

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    human = np.full(N, K)
    score = np.zeros(N)
    
    for i in range(Q):
        
        
        
        
        
        
        
        score[A[i]-1] += 1

    human = human - Q + score

    
    human2 = list(map(lambda x: YES if x > 0 else NO, human))
    print('\n'.join(human2))
    '''
    for j in range(N):
        
        if human[j] > 0:
            print(YES)
        else:
            print(NO)
    '''
    return
    

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

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

Solution (Python):
import numpy as np
def python_list_sub(in1, in2):
    wrk = np.array(in1) + np.array(in2)
    return wrk.tolist()


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

Po = []
De = [1 for i in range(n)]

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



for i in range(n):
    Po.append(int(k-q))




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


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

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

border = q + 1 - k
players = [0] * n

for _ in range(q):
  getter = int(input())
  players[getter-1] += 1
  
for player in players:
  print('Yes' if player >= border else 'No')

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

Solution (Python):
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+A[i]<=0:
    print("No")
  else:
    print("Yes")

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

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


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

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

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

import collections
c = collections.Counter(A)

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

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

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

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

Solution (Python):

import numpy as np
N,K,Q = map(int,input().split())
point_list = [K-Q]*N

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


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

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):
    print("Yes" if A[i] > 0 else "No")

Solution (Python):
N,K,Q = map(int, input().split())
seikaisha = [0 for _ in range(N)]
for _ in range(Q):
  seikaisha[int(input())-1] += 1
sum_seikai = sum(seikaisha)
for seikai in seikaisha:
  shitten = sum_seikai - seikai
  if K - shitten > 0:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
s=list(map(int,input().split()))
t=[int(input()) for i in range(s[2])]
a=s[1]-s[2]
list=[]
for j in range(s[0]):
  list.append(a)
for l in range(s[2]):
  list[t[l]-1]=list[t[l]-1]+1
for n in range(s[0]):
  if list[n]>0:
    print('Yes')
  else:
    print('No')

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

scores = [K-Q] * N
for _ in xrange(Q):
    a = int(raw_input())
    scores[a-1] += 1

for s in scores:
    print "Yes" if s > 0 else "No"

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

Solution (Python):
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-inp[2], point))

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

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

for j in range(Q):
  A=int(input())
  scores[A-1]+=1
  
for score in scores:
  if K-Q+score>0:
    print('Yes')
  else:
    print('No')

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

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

points = []
for x in range(N):
    points.append(K-Q)

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

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

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

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

min_c = Q - K + 1

num = [0]*N

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

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

Solution (Python):
import sys

info = input().split(" ")
N = int(info[0])
K = int(info[1])
Q = int(info[2])
  
ns = []
for i in range(N):
  ns.append(K - Q)

for i in range(Q):
  s = int(input())
  s = s - 1
  ns[s] = ns[s] + 1
      
  
for p in ns:
  if p <= 0:
    print("No")
  else:
    print("Yes")

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

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


for j in range(N):
  if score[j]<K:
    print('Yes')
  else:
    print('No')

Solution (Python):
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[0]):
  array[i]-=n[2]
  if(array[i]<=0):
    print("No")
  else:
    print("Yes")

Solution (Python):
import numpy as np

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


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


[print('No') if i[m]<=0 else print('Yes') for m in range(n)]

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

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

Solution (Python):
import sys
import itertools
input = sys.stdin.readline
n,k,q=map(int,input().split())
A=[int(input()) for _ in range(q)]

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

Solution (Python):
import numpy as np

def main():

    N, K, Q = map(int, input().split())
    player = np.array([K - Q] * N)
    sub = np.array([-1] * N)
    A = [int(input()) for i in range(Q)]
    for i in range(Q):
        player[A[i] - 1] += 1
    for k in range(N):
        if player[k] <= 0:
            print("No")
        else:
            print("Yes")

if __name__ == "__main__":
    main()

Solution (Python):
tmp = input().split()
N = int(tmp[0])
K = int(tmp[1])
Q = int(tmp[2])

ns = []
for n in range(N):
    ns.append(K-Q)



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

for n in ns:
    if n > 0:
        print("Yes")
    else:
        print("No")

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

init = k - q
ns = [init] * n

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

for i_n in ns:
    if i_n > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N,K,Q=[int(e) for e in input().split(' ')]

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

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

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

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

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



    if B[i] > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import numpy as np

nkq = np.array(list(map(int, input().split())))

p = np.array([nkq[1]-nkq[2] for i in range(nkq[0])])


a = np.array([int(input()) for i in range(nkq[2])])
for i in range(nkq[2]):
    p[a[i]-1] += 1
    

a = [print('Yes') if p[i] > 0 else print('No') for i in range(len(p))]

Solution (Python):
def main():
    n, k, q, *al = map(int, open(0).read().split())
    gl = [0] * n
    for a in al:
        gl[a-1] += 1

    res = '\n'.join(
        'Yes' if g > q-k
        else 'No'
        for g in gl
    )
    print(res)

if __name__ == '__main__':
    main()

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

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

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

if __name__ == "__main__":
    solve()

Solution (Python):
import sys
input = sys.stdin.readline
 
def main():
    N, K, Q = map(int, input().split())
    A = [0]*N
    for _ in range(Q):
        q = int(input())
        A[q-1] += 1

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

if __name__ == '__main__':
    main()

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

p = [ k for _ in range(n) ]

p = [ y-q for y in p ]

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

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

for blah in ans:
	print(blah)

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


points = [K-Q]*N

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

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

Solution (Python):
n,k,q=map(int,input().split())
l=[]
p=[]
for i in range(n):
   p.append(k)
for i in range(q):
   num=int(input())
   l.append(num)
for ep in l:
     p[ep-1]+=1
for ep in p:
     if ep<=q:
        print('No')
     else:
        print('Yes')

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

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

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

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

for score in scores:
    result = 'Yes' if K - Q + score > 0 else 'No'
    print(result)

Solution (Python):
import numpy as np

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

A = np.array(A)
p = np.zeros(N)
res = np.full_like(p,K)

for a in A:
	p[a-1] = p[a-1] + 1
	
p = p - Q
res = res + p

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

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

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

sum = [x + y for (x, y) in zip(points, answers)]
aaa = [x - Q for (x) in sum]
for p in aaa :
    print('No') if p <= 0 else print('Yes')

Solution (Python):
import numpy as np
nkq = list(map(int, (input().split())))
ans = [int(input()) for i in range(nkq[2])]
total = nkq[1] - nkq[2]
hold_point = np.array([total]*nkq[0])
for i in ans:
    hold_point[i - 1] += 1
for i in hold_point:
    if i <= 0:
        print('No')
    else:
        print('Yes')

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

N_point = []

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

for i in range(N):
  N_point.append(K)

def calc_hiku(n):
    return n - Q

for i in A:
  
  N_point[i-1] = int(N_point[i-1]) + 1

N_point = list(map(calc_hiku, N_point))


for num in N_point:
  if num > 0:
    print('Yes')
  else:
    print('No')

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

point = [k-q] * n
for i in range(q):
    input_num = int(input())
    point[input_num - 1] += 1
    

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

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

for i in range(N):
    a.append(K-Q)

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

for i in a:
    if i <= 0:
        print("No")

    else:
        print("Yes")

Solution (Python):
li = list(map(int,input().split()))
N = li[0]
K = li[1]
Q = li[2]
score = [K] * N
for i in range(Q):
    A_i = int(input())
    A_i -= 1
    score[A_i] += 1
score = map(lambda x: x - Q, score)
score = list(score)
index_num = 0
for i in range(N):
    if score[index_num] <= 0:
        print("No")
    else:
        print("Yes")
    index_num += 1

Solution (Python):


def main():
    N, K, Q = list(map(int, input().split()))
    if Q < K:
        for n in range(N):
            print('Yes')
    else:
        s = [K-Q for n in range(N)]
        for q in range(Q):
            ai = int(input())
            s[ai -1] += 1
        for n in range(N):
            print('Yes') if s[n] > 0 else print('No')

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

N, K, Q=list(map(int,input().split()))
points = K * np.ones(N)
A_list = np.zeros(Q)

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

points = points - Q
for i in A_list:
    points[int(i)] += 1

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

Solution (Python):
n,k,q=map(int,input().split())
l=[int(input()) for i in range(q)]
d=dict.fromkeys(range(n),k)

for i in l:
  d[i-1]+=1

for i in d.values():
  if i-q>0:
    print('Yes')
  else:
    print('No')

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

Solution (Python):

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

ans = [K] * N

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

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

Solution (Python):
from collections import Counter

n, k, q = map(int,input().split())      
A = []
for i in range(q):
    A.append(int(input()))
As = list(set(A))
S=Counter(A)
B = [k-q]*n
for k,v in S.items():
  B[k-1]+=v

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

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


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



nl = []
for m in range(n):
    nl.append(k-q)

for y in al:
    nl[y-1] = nl[y-1]+1

for z in nl:
    if z > 0:
        print('Yes')
    else:
        print('No')

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

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

p = [ k for _ in range(n) ]

p = [ y-q for y in p ]

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

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

for blah in ans:
	print(blah)

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

for i in range(N):
    a.append(K-Q)





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

for i in a:
    if i <= 0:
        print("No")

    else:
        print("Yes")

Solution (Python):
import numpy as np
N, K, Q = map(int, input().split())
S = []
for _ in range(Q):
    S.append(int(input())) 
P=[K]*N
for i in range(Q):
  P[S[i]-1]+=1
P = np.array(P)
P -= Q
for i in range(N):
  if P[i] <= 0:
    print("No")
  else:
    print("Yes")

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