CodeEff/ECCO huggingface dataset:
# Original solution
import collections
n,k,q = list(map(int,input().split()))
alist = [int(eval(input())) for i in range(q)]

"""
atuple = tuple(alist)

acount = collections.Counter(atuple)
print(acount,q,k)
tlist = []
for key,v in acount.items():
    if q - v < k:
        tlist.append(key)
"""

for i in range(1,n+1):
    if q - alist.count(i) < k:
        print("Yes")
    else:
        print("No")
        

# Optimized solution
import collections
n,k,q = list(map(int,input().split()))
alist = [int(eval(input())) for i in range(q)]

atuple = tuple(alist)

acount = collections.Counter(atuple)
#print(acount,q,k)

for i in range(1,n+1):
    if q - acount[i] < k:
        print("Yes")
    else:
        print("No")
# Original solution
n, k, q = map(int, input().split())
quiz = [int(input()) for i in range(q)]
point = [k]*n
for i in quiz:
  point = list(map(lambda x: x-1, point))
  point[i-1] += 1
[print("Yes") if i > 0 else print("No") for i in point]


# Optimized solution
n, k, q = map(int, input().split())
quiz = [int(input()) for i in range(q)]
point = [k-q]*n
for i in quiz:
  point[i-1] += 1
[print("Yes") if i > 0 else print("No") for i in point]
'''
1. あらかじめ全員のポイントを Q 減らしておく (つまり，開始時点のポイントは K − Q)．
2. Q 回の正解それぞれに対して，正解者のポイントを 1 増やす．

リストの中身すべてに計算すると「リスト要素」＊「ループ回数」の計算量になる
'''
# Original solution
N, K, Q = list(map(int, input().split()))
point = [K - Q] * N
for i in range(Q):
	ans = int(eval(input()))
	point[ans-1] += 1
for item in point:
	if item <= 0:
		print('No')
	else:
		print('Yes')


# Optimized solution
N, K, Q = list(map(int, input().split()))
ans = [0]*(N+1)
for i in range(Q):
    ans[int(eval(input()))] += 1
sum_ans = sum(ans)
for i in range(1,N+1):
    print(('Yes' if K-(sum_ans-ans[i]) > 0 else 'No'))
# Original solution
n, k, q = list(map(int, input().split()))
a = [ int(eval(input())) for i in range(q) ]

for i in range(1,n+1):
    x = a.count(i)
    if k-q+x > 0:
        print('Yes')
    else:
        print('No')

# Optimized solution
n, k, q = list(map(int, input().split()))
a = [ int(eval(input())) for i in range(q) ]
score = [k-q]*n
for i in a:
    score[i-1] += 1
for i in score:
    print(('Yes' if i > 0 else 'No'))
# Original solution
N, K, Q = list(map(int, input().split()))

P = [K for _ in range(N)]
D = []
for _ in range(Q):
    A = int(eval(input())) - 1
    for i, p in enumerate(P):
        if A != i:
            P[i] -= 1

for x in P:
    if x <= 0:
        print('No')
    else:
        print('Yes')


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

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

for x in P:
    if Q + 1 <= x:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int, input().split(' ')))
res = [K for _ in range(N)]
for i in range(Q):
    a = int(eval(input())) - 1
    res = list([n-1 for n in res])
    res[a] = res[a] + 1
for i in range(N):
    print(('Yes' if res[i] > 0 else 'No'))


# Optimized solution
N, K, Q = list(map(int, input().split(' ')))
res = [0 for _ in range(N)]
for i in range(Q):
    a = int(eval(input())) - 1
    res[a] = res[a] + 1
res = list([n - Q + K for n in res])
for i in range(N):
    print(('Yes' if res[i] > 0 else 'No'))
# Original solution
N,K,Q = input().split()
N=int(N)
K=int(K)
Q=int(Q)

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

for n in range(N):
  point = seikai_list.count(n+1) + K - Q
  if point > 0:
    print("Yes")
  else:
    print("No")

# Optimized solution
N,K,Q = input().split()
N=int(N)
K=int(K)
Q=int(Q)

seikai_list = [K - Q] * N
for i in range(Q):
  num = int(eval(input())) -1
  seikai_list[num] = seikai_list[num] +1

for n in seikai_list:
  if n > 0:
    print("Yes")
  else:
    print("No")
# Original solution
def scoredown(n):
    return n-1

N, K, q=list(map(int, input().split()))
a=[int(eval(input())) for i in range(q)]
score=[K]*N

for i in range(q):
    score=list(map(scoredown, score))
    score[a[i]-1]+=1

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

# Optimized solution
N, K, q=list(map(int, input().split()))
score=[0]*N

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

for i in range(N):
    if K-(q-score[i])>0:
        print("Yes")
    else:
        print("No")
# Original solution
N, k, Q = list(map(int, input().split()))
A =[]

j = 0
c = 0
 
def calc_de(n):
    return n - 1
 

A = [int(eval(input())) for index in range(Q)]
 
S = [k]*N
 
for j in A:
    S = list(map(calc_de, S))
    S[j-1] += 1
 
for c in range(N):
    if S[c] > 0:
        print('Yes')
    else:
        print('No')

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

A = [K]*N
C = [0]*N

for r in range(Q):
    correct = int(eval(input()))
    C[correct-1] = C[correct-1] + 1

for i in range(N):
    A[i] = A[i] - Q + C[i]
    if A[i] > 0:
        print('Yes')
    else:
        print('No')
# Original solution
#C
n, k, q = list(map(int, input().split()))
a = sorted([int(eval(input())) for _ in range(q)])
j = 0
for i in range(n):
    count = a.count(i+1)
    if q - count >= k:
        print('No')
    else:
        print('Yes')
    a[:count] = []


# Optimized solution
n, k, q = list(map(int, input().split()))
a = sorted([int(eval(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')
# Original solution
N, K, Q = [int(x) for x in input().split()]

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

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


# Optimized solution
N, K, Q = [int(x) for x in input().split()]

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

for score in scores:
    print(('Yes' if score > 0 else 'No'))
# Original solution
n, k, q = list(map(int, input().split()))
aq = [int(eval(input())) for i in range(q)]
point = [k for i in range(n)]
correct_ans = [0] * n

for i in range(q):
    correct_ans[aq[i] - 1] += 1
    
point = ['Yes'  if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]

for p in point:
    print(p)

# Optimized solution
n, k, q = map(int, input().split())
aq = [int(input()) for i in range(q)]
point = [k for i in range(n)]
correct_ans = [0] * n

for i in range(q):
    correct_ans[aq[i] - 1] += 1
    
point = ['Yes'  if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]
print(*point, sep='\n')
# Original solution
# imos 法
N, K, Q = list(map(int, input().split()))
cs = [0] * N
cs[0] = K
for _ in range(Q):
    A = int(eval(input()))
    if A == 1:
        cs[1] -= 1
    elif A == N:
        cs[0] -= 1
        cs[N - 1] += 1
    else:
        cs[0] -= 1
        cs[A - 1] += 1
        cs[A] -= 1
for i in range(1, N):
    cs[i] += cs[i - 1]
for i in cs:
    if i <= 0:
        print('No')
    else:
        print('Yes')


# Optimized solution
# imos 法
N, K, Q = list(map(int, input().split()))
cs = [0] * N
cs[0] = K
for _ in range(Q):
    A = int(eval(input()))
    if A == 1:
        cs[1] -= 1
    elif A == N:
        cs[0] -= 1
        cs[N - 1] += 1
    else:
        cs[0] -= 1
        cs[A - 1] += 1
        cs[A] -= 1
for i in range(1, N):
    cs[i] += cs[i - 1]
for i in cs:
    if i > 0:
        print('Yes')
    else:
        print('No')
# Original solution
N,K,Q = [int(i) for i in input().split()]
mem_point = [K for i in range(N)]
_points = [-1 for i in range(N)]


for rounds in range(Q):
  temp = _points.copy()
  anser = int(eval(input()))
  temp[anser-1] = 0
  mem_point = list(map(lambda x,y:x+y,mem_point,temp))
  
for point in mem_point:
  if 0 < point:
    print("Yes")
  else:
    print("No")


# Optimized solution
N,K,Q = [int(i) for i in input().split()]
mem_point = [K-Q for i in range(N)]


for rounds in range(Q):
  temp = int(eval(input()))
  mem_point[temp-1] += 1 
  
for point in mem_point:
  if 0 < point:
    print("Yes")
  else:
    print("No")
# Original solution
sankaNum, scoreMax, ansCnt = list(map(int, input().split()))

score = []

for i in range(sankaNum):
    score.append(scoreMax)

for n in range(ansCnt):
    ansSanka = eval(input())

    for k in range(sankaNum):
        if int(ansSanka) - 1 != k:
            score[k] -=  1
    
for m in range(sankaNum):

    if score[m]  > 0:
        print('Yes')
    else:
        print('No')

# Optimized solution
sankaNum, scoreMax, ansCnt = list(map(int, input().split()))

score = [scoreMax-ansCnt]*sankaNum

for _ in range(ansCnt):
    score[int(eval(input())) - 1] +=  1

for m in range(sankaNum):

    if  score[m] > 0:
        print('Yes')
    else:
        print('No')
# Original solution
n, k, q = list(map(int, input().split(" ")))
a = [k for _ in range(n)]
for i in range(q):
    winIndex = int(eval(input())) - 1
    for j in range(n):
        if j != winIndex:
            a[j]-= 1

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

# Optimized solution
n, k, q = list(map(int, input().split(" ")))
a = [0 for _ in range(n)]
for i in range(q):
    winIndex = int(eval(input())) - 1
    a[winIndex] += 1  

for i in range(n):
    print(("Yes" if k > q - a[i] else "No"))
# Original solution
N, K, Q = list(map(int, input().split()))
ans_r = [K] * N
cor = list(map(int, [eval(input()) for i in range(Q)]))
for i in cor:
    ans_r[i - 1] += 1
    ans_r = list([x - 1 for x in ans_r])
ans_r = list(["No" if x <= 0 else "Yes" for x in ans_r])
for i in ans_r:
    print(i)


# Optimized solution
N, K, Q = list(map(int, input().split()))
ans_r = [K - Q] * N
cor = list(map(int, [eval(input()) for i in range(Q)]))
for i in cor:
    ans_r[i - 1] += 1
for i in ans_r:
    if i <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
N,K,Q = list(map(int,input().split()))
A = []
L = []
for i in range(N):
    A.append(K - Q)
for i in range(Q):
    L.append(int(eval(input())))
for i in range(Q):
    for j in range(N):
        if j == L[i] - 1:
            A[j] += 1

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

# Optimized solution
N,K,Q = list(map(int,input().split()))
A = []
L = []
for i in range(N):
    A.append(K - Q)
for i in range(Q):
    L.append(int(eval(input())))
for i in range(Q):
    j = L[i]
    A[j - 1] += 1

for i in range(N):
    if A[i] <= 0:
        print('No')
    else:
        print('Yes')
# Original solution
N,K,Q = list(map(int,input().split()))
A = []
L = []
for i in range(N):
    A.append(K - Q)
for i in range(Q):
    L.append(int(eval(input())))
for i in range(Q):
    j = L[i]
    A[j - 1] += 1

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

# Optimized solution
n,k,q = list(map(int,input().split()))
a = list(int(eval(input())) for i in range(q))
z = [0] * n
for i in range(q):
    z[a[i]-1] += 1
for i in range(n):
    if z[i] >= q - k + 1:
        print('Yes')
    else:
        print('No')
# Original solution
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]

score = [k-q for i in range(n)]
for i in a:
    for j in range(len(score)):
        if j == i-1:
            score[j] = score[j]+1
            pass

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


# Optimized solution
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]

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

for i in score:
    if i <= 0:
        print('No')
    else:
        print('Yes')
# Original solution
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, K, Q, *A = map(int, read().split())
point =[K-Q]*(N+1)

for i in A:
    point[i] += 1
print(*['Yes' if i > 0 else 'No' for i in point[1:]], sep='\n')


# Optimized solution
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, K, Q, *A = list(map(int, read().split()))
point = [K - Q] * (N + 1)

for i in A:
    point[i] += 1
ans = '\n'.join('Yes' if i > 0 else 'No' for i in point[1:])
print(ans)
# Original solution
def resolve():
    N, K, Q = list(map(int, input().split()))
    A = [int(eval(input())) for _ in range(Q)]
    for i in range(N):
        if K + A.count(i+1) - Q > 0:
            print('Yes')
        else:
            print('No')

    return


resolve()

# Optimized solution
def resolve():
    N, K, Q = list(map(int, input().split()))
    A = [int(eval(input())) for _ in range(Q)]
    points = [0] * N
    for i in range(Q):
        points[A[i]-1] += 1

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

    return

resolve()
# Original solution
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
    A.append(int(eval(input())))

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

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

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

for score in scores:
    if score > 0:
        print('Yes')
    else:
        print('No')
# Original solution
n, k, q = list(map(int, input().split()))
alist = []
for i in range(q):
  a = int(eval(input()))
  alist.append(a - 1)
pscore = [k] * n
for j in range(q):
  for k in range(n):
    if alist[j] != k:
      pscore[k] -= 1
for k in range(n):
  if pscore[k] <= 0:
    print('No')
  else:
    print('Yes')

# Optimized solution
n, k, q = list(map(int, input().split()))
alist = []
for i in range(q):
  a = int(eval(input()))
  alist.append(a - 1)
pscore = [0] * n
for j in range(q):
  pscore[alist[j - 1]] += 1
for i in range(n):
  pscore[i] -= (q - k)
  if pscore[i] <= 0:
    print('No')
  else:
    print('Yes')
# Original solution
n,k,q = list(map(int,input().split()))
plist = [k]*n
for j in range(q):
  s = int(eval(input()))
  for i in range(n):
    plist[i] -= 1
  plist[s-1] += 1
  
for i in plist:
  if i <= 0:
    print('No')
  else:print('Yes')


# Optimized solution
n,k,q = list(map(int,input().split()))
plist = [k-q]*n
for i in range(q):
  s = int(eval(input()))
  plist[s-1] += 1
for i in plist:
  if i <= 0:
    print('No')
  else:print('Yes')
# Original solution
n,k,q = list(map(int,input().split()))
li = []
for i in range(q):
    li.append(int(eval(input())))
for i in range(n):
    if k - q + li.count(i+1) > 0:
        print("Yes")
    else:
        print("No")

# Optimized solution
n,k,q = list(map(int,input().split()))
li = [k-q] * n
numli = [int(eval(input())) for i in range(q)]
for a in numli:
    li[a-1] += 1
for i in li:
    if i > 0:
        print("Yes")
    else:
        print("No")
# Original solution
from collections import Counter
N, K, Q = list(map(int, input().strip().split()))
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
for i in range(N):
    pid = i+1
    if sum([v for k,v in list(countl.items()) if k != pid]) < K:
        print('Yes')
    else:
        print('No')

# Optimized solution
from collections import Counter
N, K, Q = map(int, input().strip().split())
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
sumcountl = sum(countl.values())
for i in range(N):
    print('Yes') if sumcountl-countl[i+1] < K else print('No')
# Original solution
import sys
input=sys.stdin.readline
z=list(map(int,input().split()))
a,b,c=[],[],z[2]-z[1]
for i in range(z[2]):
    a.append(int(eval(input())))
for i in range(z[0]):
    b.append(a.count(i+1))
for i in range(z[0]):
    if c-b[i]>=0:
        print('No')
    else:
        print('Yes')

# Optimized solution
n,k,q=list(map(int,input().split()))
a,b=[int(eval(input())) for _ in range(q)],[0]*n
for i in a:
    b[i-1]+=1
for i in b:
    print(('Yes' if i+k-q>0 else 'No'))
# Original solution
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
a = sorted(a)
for i in range(1,n+1):
    if len(a) - a.count(i) >= k:
        print("No")
    else:
        print("Yes")

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

for i in range(n):
    if k > q - p[i]:
        print("Yes")
    else:
        print("No")
# Original solution
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(eval(input()))
    a.append(temp)
border=-k+q

res = '\n'.join('Yes' if a.count(j+1)> border else 'No' for j in range(0,n))

print(res)


# Optimized solution
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(eval(input()))
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)
# Original solution
N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
    A.append(int(eval(input())))

pts = [K - Q]*N
for ai in A:
    for i, _ in enumerate(pts):
        if (i+1)==ai:
            pts[i] += 1

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

# Optimized solution
N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
    A.append(int(eval(input())))
    
pts = [K - Q]*N
for ai in A:
    pts[ai-1] += 1

for p in pts:
    if p>0:
        print('Yes')
    else:
        print('No')
# Original solution
N,K,Q=list(map(int,input().split()))
a=[]
A=[]

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

for _ in range(N):
    A.append(int(K))

for n in range(Q):
    A[a[n]-1]+=1
    for m in range(N):
        A[m]-=1
    
for s in range(N):
    if A[s]<1:
        print("No")
    else:
        print("Yes")

# Optimized solution
N,K,Q=list(map(int,input().split()))
a=[]
A=[]

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

for _ in range(N):
    A.append(int(K))

for n in range(Q):
    A[a[n]-1]+=1
    
for s in range(N):
    if A[s]-Q<1:
        print("No")
    else:
        print("Yes")
# Original solution
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(q)]
for i in range(n):
  pt = k
  pl = a.count(i+1)
  if pl > 0:
    pt = pt - q + pl
  else:
    pt -= q
  if pt > 0:
    print('Yes')
  else:
    print('No')

# Optimized solution
n,k,q = list(map(int,input().split()))
a = [int(eval(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')
# Original solution
n, k, q = list(map(int, input().split()))
ls_a = [int(eval(input())) for _ in range(q)]

ls_p = [k] * n

for i in range(n):
    num = 0
    num = ls_a.count(i+1)
    ls_p[i] += (num - q)

for j in range(n):
    if ls_p[j] > 0:
        print("Yes")
    elif ls_p[j] <= 0:
        print("No")

# Optimized solution
n, k, q = list(map(int, input().split()))
ls_a = [int(eval(input())) for _ in range(q)]

ls_p = [k] * n
ls_c = [0] * n

for i in range(q):
    ls_c[ls_a[i] - 1] += 1

for j in range(n):
    ls_p[j] += ls_c[j] - q

for l in range(n):
    if ls_p[l] > 0:
        print("Yes")
    elif ls_p[l] <= 0:
        print("No")
# Original solution
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

# Optimized solution
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()
# Original solution
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
for i in range(n):
    print(("Yes" if k + a.count(i + 1) - q > 0 else "No"))


# Optimized solution
n, k, q = list(map(int, input().split()))
nList = [0] * n
for _ in range(q):
    nList[int(eval(input())) - 1] += 1
for j in range(n):
    print(("Yes" if k + nList[j] - q > 0 else "No"))
# Original solution
n, k ,q = list(map(int, input().split()))
li = [input() for i in range(q)]
list = []
for j in range(1,n+1):
    L = str(j)
    if li.count(L) > q - k:
        list.append('Yes')
    else:
        list.append('No')
[print(x) for x in list]


# Optimized solution
n, k ,q = list(map(int, input().split()))
listAns = [eval(input()) for i in range(q)]
score = [0] * n
count = 0
for j in listAns:
    score[int(j) - 1] += 1
for h in score:
    if h > q - k:
        print("Yes")
    else:
        print("No")
# Original solution
num,k,q = list(map(int,input().split()))

arr = [k]*num


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


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

# Optimized solution
num,k,q = list(map(int,input().split()))

arr = [0]*num


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

arr = [i-(q-k) for i in arr]

for i in range(len(arr)):
    if arr[i] > 0:
        print("Yes")
    else:
        print("No")
# Original solution
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
ans = [K]*N
for i in range(1, Q+1):
    ans = list([x-1 for x in ans])
    ans[A[i-1]-1] += 1    
for k in ans:
    if k <= 0:
        print('No')
    else:
         print('Yes')

# Optimized solution
N, K, Q = list(map(int, input().split()))
A = [int(eval(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')
# Original solution
n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
# print(A)
for i in range(1, n + 1):
    if k - q + (A.count(i)) > 0:
        print('Yes')
    else:
        print('No')


# Optimized solution
n, k, q = list(map(int, input().split()))
Point = [k - q] * n
for _ in range(q):
    Point[int(eval(input())) - 1] += 1

for e in Point:
    if e > 0:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int,input().split()))
scores = [K] * N

def minus(ans_i):
    for i in range(N):
        scores[i] -= 1
    scores[ans_i-1] += 1

for i in range(Q):
    ans_i = int(eval(input()))
    minus(ans_i)    

for player in scores:
    if player <= 0:
        print("No")
    else:
        print("Yes")

# Optimized solution
N, K, Q = list(map(int,input().split()))
scores = [0] * N

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

for i in range(N):
    final_res = K - (Q - scores[i])  
    if final_res <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
import bisect as bi

N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K]*N
p = 0
for i in range(N+1):
    A.append(i+1)
C = sorted(A)
for i in range(N):
    B[i] += bi.bisect_left(C,i+2) - p - 1
    p = bi.bisect_left(C,i+2)
for i in range(N):
    if(B[i] > Q):
        print("Yes")
    else:
        print("No")

# Optimized solution
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K]*N
p = 0
for i in range(Q):
    B[A[i]-1] += 1
for i in range(N):
    if(B[i] > Q):
        print("Yes")
    else:
        print("No")
# Original solution
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]

if k - q > 0:
  res = ['Yes'] * n
else:
  res = ['No'] * n
  ans = tuple(set(a))
  for i in ans:
    if k - q + a.count(i) > 0:
      res[i-1] = 'Yes'
print(('\n'.join(map(str, res))))

# Optimized solution
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]

if k - q > 0:
  res = ['Yes'] * n
else:
  res = ['No'] * n
  ans = [0] * n
  for i in range(len(a)):
    ans[a[i]-1] += 1
  for i in range(n):
    if k - q + ans[i] > 0:
      res[i] = 'Yes'
print(('\n'.join(map(str, res))))