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 main():
    n, k, q = [int(s) for s in sys.stdin.readline().strip().split()]
    a = [0] * q
    for i in range(q):
        a[i] = int(sys.stdin.readline().strip()) - 1

    scores = [0] * n
    for ai in a:
        scores[ai] += 1

    for i in range(n):
        score = scores[i]
        lose = q - score
        if lose >= k:
            print('No')
        else:
            print('Yes')


main()

Solution (Python):

import collections

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

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

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

for ans in answers:
  print('Yes' if ans>border else 'No')

Solution (Python):

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

A = [0]*Q
B = [K-Q]*N

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


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

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

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

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

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

players = list(np.array([K - len(A)] * N))
for a in A:
    players[a-1] += 1
    
for p in players:
    if p > 0:
        print('Yes')
    else:
        print('No')

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

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

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


A = []

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


result = [K - Q] * N

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

for r in result:
	if r > 0:
		print('Yes')
	else:
		print('No')

Solution (Python):
import collections

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

seikai = collections.Counter([int(input()) for _ in range(Q)])

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

Solution (Python):
N, K, Q = map(int, input().split())
A =[0]*N
P = [K]*N
for i in range(Q):
    p = int(input())
    A[p-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())

answered = [K - Q] * N

for q in range(Q):
    correct = int(input())
    answered[correct - 1] += 1
for item in answered:
    if item <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
def main():
    n, k, q = [int(x) for x in input().split()]

    ok = [0] * n

    for _ in range(q):
        a = int(input()) - 1
        ok[a] += 1
    
    for p in ok:
        print("Yes" if k - q + p > 0 else "No")

main()

Solution (Python):

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

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

Solution (Python):
"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) 
A = [int(input()) for _ in range(N)] 
lst = [list(map(int,input().split())) for i in range(M)] 
"""

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

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


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

Solution (Python):



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

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

Solution (Python):
import array


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

A = array.array('i', [0]*N)

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

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

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

point = [k-q]*n

ans_point = [0]*n
for cur_a in a:
    ans_point[cur_a - 1] += 1

point = [point[i] + ans_point[i] for i in range(n)]

for cur_point in point:
    if cur_point > 0:
        print('Yes')
    else:
        print('No')

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

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

from collections import Counter

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

c = Counter(A)

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

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

M = [k-q]*n

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

Solution (Python):
import sys
sys.setrecursionlimit(100000)

def ins(): return input().split()
def ii(): return int(input())
def iil(): return list(map(int,ins()))
def lin(): return list(input())
def iin(): return map(int,ins())

n, k, q = iin()
t = k - q
ans = [t]*n
for _ in range(q):
    ans[ii()-1] += 1
for j in ans:
    print('Yes' if j>0 else 'No')

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

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

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

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


C=Counter(A)


L=[ K-Q for _ in range(N) ]

for i,v in C.items():
	L[i-1]+=v

for x in L:
	if 0<x:
		print "Yes"
	else:
		print "No"

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

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

point = [0]*N

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

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

for _ in range(Q):
    a = int(input())
    P[a - 1] += 1
    
for p in P:
    if Q - p >= K:
        print("No")
    else:
        print("Yes")

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

line = q - k + 1
point = [0 for i in range(n)]
for i in range(q):
    ai = int(input()) - 1
    point[ai] += 1

for i in range(n):
    if point[i] >= line:
        print('Yes')
    else:
        print('No')

Solution (Python):
from collections import Counter

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

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

def solve():
    points = [0 for _ in range(N)]
    for a in A:
        points[a] += 1
    sum_points = sum(points)
    for p in points:
        if sum_points - p >= K:
            print('No')
        else:
            print('Yes')

if __name__ == '__main__':
    solve()

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]


    N, K, Q = LMIIS()
    scores = [0] * N
    for _ in range(Q):
        a = II() - 1
        scores[a] += 1
    sumscore = sum(scores)

    for s in scores:
        print('Yes') if K + s  - sumscore > 0 else print('No')
    
    



if __name__ == '__main__':
    main()

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

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

for point in points:
    if point >b:
        print('Yes')
    else:
        print('No')

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

import sys
input = sys.stdin.readline
A = [None] * Q
for i in range(Q):
    A[i] = int(input().rstrip())
    
peoples = [0] * N

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


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

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

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

user = {i+1:0 for i in range(N)}

for aa in A:
    user[aa] += 1





for key,v in user.items():
    
    if K-(Q-v) <= 0 :
        print("No")
    else:
        print("Yes")

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

Solution (Python):
if __name__ == "__main__":
    N, K, Q = map(int, input().split())
    A = list()
    for i in range(Q):
        A.append(int(input()))

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

Solution (Python):

n, k, q = map(int, input().split())
points = [k - q]*n
for i in range(q):
    ai = int(input())
    points[ai - 1] += 1

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=sys.stdin.readline
def resolve():
    n,k,q=map(int,input().split())
    S=[0]*n
    for _ in range(q):
        S[int(input())-1]+=1
    for i in range(n):
        print('Yes' if k>q-S[i] else 'No')


resolve()

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

must = Q - K + 1
part_l = [0 for _ in range(N)]

for A in A_l:
  part_l[A-1] += 1

for part in part_l:
  if(part<must):
    print("No")
  else:
    print("Yes")

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

for i, answer in enumerate(a):
    points[answer-1] += 1

for i, p in enumerate(points):
    result = "Yes" if k - q + p > 0 else "No"
    print(result)

Solution (Python):
import collections

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

c = collections.Counter(li) 

for i in range(N):
    if i in c.keys():
        if K-(Q-c[i]) < 1:
          print("No")
        else:
          print("Yes")
    else:
        if K-Q < 1:
          print("No")
        else:
          print("Yes")

Solution (Python):
N, K, Q = [int(i) for i in input().split()]
ls = [K] * N

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

for l in ls:
    if l - Q > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)




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

    winners = []
    for w in range(q):
        winners.append(int(input()))

    score = [k - q] * n

    for w in winners:
        winner = w - 1

        score[winner] += 1

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys

input = sys.stdin.readline

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



if __name__ == "__main__":
    main()

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

b = [0]*n

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

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

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

import numpy as np
A = np.array(A) - 1

score = np.ones(shape=(N,)) * (K - Q)
for q in range(Q):
    score[A[q]] += 1

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

Solution (Python):
n,k,q=map(int,input().split())
S=[0]*n
for i in range(q):
  S[int(input())-1]+=1
for s in S:
  print('Yes' if s>q-k else '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 = IR(q)
point = [k] * n
limit = q
for i in L:
    point[i-1] += 1


for j in point:
    if j <= limit:
        print('No')
    else:
        print('Yes')

Solution (Python):
def acinput():
    return list(map(int, input().split(" ")))


N,K,Q=acinput()
a=[]
for i in range(Q):
    a.append(int(input()))

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

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

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

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

B = [int(K) - int(Q)] * int(N)

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

for i in range(int(N)):
    if B[i] > 0:
        print("Yes")

    else:
        print("No")

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

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

for ans in p:
    if ans + k > q:
        print("Yes")
    else:
        print("No")

Solution (Python):

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

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

an = [0] * n

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

ans = ["No","Yes"]

for j in range(n):
    print(ans[k-q+an[j]>0])

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

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

for q in range(Q):
    point_list[A[q] - 1] += 1

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

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

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

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

main()

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

point =	list([k-q] * n)
for jj in a:
    point[jj-1] += 1

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

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

p = np.array([0]*n)
for i in range(q):
    p[a[i]-1] += 1

ans = (p-q+k > 0)
for i in ans:
    if i:
        print('Yes')
    else:
        print('No')

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

import collections
c = collections.Counter(a_list)

for i in range(n):
    num=i+1
    count = c[num]
    minus = q-count
    if k - minus > 0:
        print('Yes')
    else:
        print('No')

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

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

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

for x in point:
    if x < K:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys

input = sys.stdin.readline

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

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

for n in ary:
    if n+K-Q > 0:
        print("Yes")
    else:
        print("No")

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

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

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

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

q = [K-Q] * N

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

for _q in q:
    if _q > 0:
        print("Yes")
    else:
        print("No")

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

scr = [k - q for _ in range(n)]
for ai in a:
    scr[ai - 1] += 1
ans = list(map(lambda x: "Yes" if 0 < x else "No", scr))
print('\n'.join(ans))

Solution (Python):
n, k, q = [int(x) for x in input().split()]
ary = []
for _ in range(q):
    ary.append(int(input()))
winCounts = [0 for _ in range(n)]
for a in ary:
    winCounts[a-1] += 1
for count in winCounts:
    if k - (q-count) > 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 a_ in a:
    p[a_ - 1] += 1

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
import numpy as np
n, k, q = map(int, stdin.readline().rstrip().split())
ary = [int(stdin.readline().rstrip()) for _ in range(q)]
point = np.array([0] * n)

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

point = point + (k - q)

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

Solution (Python):
import collections

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

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

num_ans = collections.Counter(a)


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

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

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

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

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

for i in range(N):
    X.append(0)

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

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

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

plis = [0] * (n + 1)
for a in al:
    plis[a] += 1

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

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

for i in range(1, N+1):
    score = corrects[i] + K - Q
    if score > 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()))
    
List = [0 for i in range(N)]
for i in range(Q):
    List[A[i]-1] += 1
    
for i in range(N):
    if List[i] > Q-K:
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):
n_k_q_str = input()
n_k_q = n_k_q_str.split(" ")
N = int(n_k_q[0])
K = int(n_k_q[1])
Q = int(n_k_q[2])
answers = [0] * N
for i in range(Q):
    answer = int(input()) - 1
    answers[answer] += 1

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

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

dp = [0]*n

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

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

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

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

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

kai=[0]*n
for i in range(q):
    kai[a[i]-1]+=1

go=q-k+1

for i in range(n):
    if(kai[i]>=go):
        print("Yes")
    else:
        print("No")

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

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

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

for i in range(N):
    if B[i] >= 1:
        print('Yes')
    else:
        print('No')

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

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 i in range(N):
    if Q - P[i] < K:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
import collections
sys.setrecursionlimit(4100000)

n,k,q = [int(i) for i in input().split()]
a = [int(input()) for _ in range(q)]
d = collections.defaultdict(int)
for b in a:
    d[b] += 1

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

Solution (Python):
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] +=1
for i in range(n):
    if ans[i]>0:
        print("Yes")
    else:
        print("No")

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

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

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

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

Solution (Python):
def calc(N, K, Q, A):
    d = {}
    for a in A:
        d[a] = 1 + (d[a] if a in d else 0)
    ans = [
        'Yes' if K - Q + (d[i + 1] if i + 1 in d else 0) > 0 else 'No'
        for i in range(N)
        ]
    return '\n'.join(ans)


(N, K, Q) = tuple([int(s) for s in input().split(' ')])
A = [int(input()) for _ in range(Q)]
print(calc(N, K, Q, A))

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

b = [0] * n

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

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

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

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

for i in a_list:
    point_list[i-1] += 1

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

Solution (Python):
N, K, Q = [int(x) for x in input().split(" ")]
lis = [K for i in range(N)]
ans = []
for i in range(Q):
    ans.append(int(input()))
for num in ans:
    lis[num - 1] += 1

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

Solution (Python):
yes_no = lambda x: 'Yes' if x else 'No'

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

    print('\n'.join([yes_no(p+K-Q > 0) for p in point]))
    
solve()

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

Solution (Python):
import sys
sys.setrecursionlimit(5 * 10**5)
input=sys.stdin.readline

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

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

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

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

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

neg = [0] * n

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




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

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

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

P = [0]*N

for q in range(Q):
  P[A[q]]+=1

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

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

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

ans=[k-q]*n

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

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

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

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


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

Solution (Python):
def main():
    N,K,Q = [int(i) for i in input().split()]
    q_list = [0] * N
    for i in range(Q):
        a = int(input()) - 1
        q_list[a] += 1
    for i in range(N):
        if K - (Q - q_list[i]) > 0:
            print("Yes")
        else:
            print("No")
if __name__ == "__main__":
    main()