CodeEff/ECCO huggingface dataset:
# Original solution
x = list(map(int,input().split()))
n=x[0]
k=x[1]
q=x[2]

a=[]

for i in range(q):
    y=int(input())
    a.append(y-1)

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


# Optimized solution
x = list(map(int,input().split()))
n=x[0]
k=x[1]
q=x[2]

z=[k-q]*n



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


for i in range(n):
    if z[i]>0:
        print("Yes")
    else:
        print("No")
# Original solution
import sys
input = sys.stdin.readline

n,k,q = list(map(int,input().split()))
l = [int(eval(input())) for _ in range(q)]
l.sort()
ll = set(l)
l2 = []

for _ in ll:
	l2.append(l.count(_))

lll = list(ll)

for _ in range(1,n+1):
	if _ in lll:
		if k - q + l2[lll.index(_)] > 0:
			print('Yes')
		else:
			print('No')
	else:
		if k - q > 0:
			print('Yes')
		else:
			print('No')

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

list_seikaisha =[]

for i in range(Q):
    list_seikaisha.append(int(eval(input()))-1)

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

for seikaisha in list_seikaisha:
    list_pt=[x-1 for x in list_pt]
    list_pt[seikaisha]=list_pt[seikaisha]+1

list_YN=[]
f=lambda pt:"Yes" if pt>=1 else "No"
for pt in list_pt:
    print((f(pt)))

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

list_seikaisha =[]

for i in range(Q):
    list_seikaisha.append(int(eval(input()))-1)

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

for seikaisha in list_seikaisha:
    list_pt[seikaisha]=list_pt[seikaisha]+1
list_pt=[x-Q for x in list_pt]

list_YN=[]
f=lambda pt:"Yes" if pt>=1 else "No"
for pt in list_pt:
    print((f(pt)))
# Original solution
n,k,q = list(map(int,input().split()))
ans_list =[]
point = []
for i in range(n):
  point.append(k)
#print(point)
for j in range(q):
  ans_list.append(input().rstrip())
#print(ans_list)
for k in ans_list:
  for l in range(n):
    if l != int(k)-1:
      point[l] -=1
for m in point:
  if m>0:
    print("Yes")
  else:
    print("No")

# Optimized solution
n,k,q = list(map(int,input().split()))
ans_list =[]
point = []
for i in range(n):
  point.append(k)
#print(point)      
for j in range(q):
  ans_list.append(int(eval(input())))
#print(ans_list)
for k in ans_list:
  point[k-1] += 1
#print(point)
for l in range(n):
  point[l] -= q
  if point[l]>0:
    print("Yes")
  else:
    print("No")
#print(point)
# Original solution
n,k,q = list(map(int,input().split()))

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

m = [k] * n

for c in a :
    for e in range(n) :
        if(not(c-1 == e)) :
            m[e] -= 1

for j in range(n) :
    if(m[j] > 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)]
m = [k-q] * n

for c in a :
    m[c-1] += 1

for j in range(n) :
    if(m[j] > 0) :
        print('Yes')
    else :
        print('No')
# Original solution
N,K,Q=list(map(int,input().split()))
c=[K-Q]*N

for i in range(Q):
  A=int(eval(input()))-1
  for r in range(N):
    if r==A:
      c[r]+=1
    
for k in range(N):
  if c[k]>0:
    c[k]='Yes'
  else:
    c[k]='No'
    
for j in range(N):
  print((c[j]))
    
    

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

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

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


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


# Optimized solution
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for x in range(Q)]
ans = [K - Q] * N


for j in range(Q):
  ans[A[j] - 1] += 1
  
for i in range(N):
  print(('Yes' if ans[i] > 0 else 'No'))
# Original solution
n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
    a.append(int(eval(input())))
p=[0]*n
for i in range(k):
    for j in range(n):
        p[j]+=1
for i in range(n):
    for j in range(q):
        p[i]-=1
        if a[j]-1 == i:
            p[i]+=1


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


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

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

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

A = list(map(int,[eval(input()) for i in range(Q)]))
for y in range(1, N+1):
    if K - Q + A.count(y) > 0:
        print("Yes")
    else:
        print("No")


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

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

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

for point in points:
    if point > 0:
        print("Yes")
    else:
        print("No")
# Original solution
n,k,q=list(map(int,input().split()))
a=[]
for _ in range(q):
    a.append(int(eval(input())))
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()))
cnt=[0]*n
for _ in range(q):
    cnt[int(eval(input()))-1]+=1
for i in range(n):
    if k-(q-cnt[i])>0:
        print('Yes')
    else:
        print('No')
# Original solution
n, k, q = [int(x) for x in input().split()]
a = []
for i in range(q):
    a.append(int(eval(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)

# Optimized solution
n, k, q = [int(x) for x in input().split()]
a = []
for i in range(q):
    a.append(int(eval(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)
# Original solution
from sys import stdin
from collections import Counter

lines = stdin.readlines()

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


# Optimized solution
from sys import stdin
from collections import Counter

lines = stdin.readlines()

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


def main():
    lines = stdin.readlines()
    N, K, Q = list(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()


# Optimized solution
from collections import Counter


def main():
    N, K, Q, *A = list(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()
# Original solution
##C
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
b = [k]*n

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

for i in b:
    if i >= 1:
        print("Yes")
    else:
        print("No")

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

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

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

for i in b:
    if i >= 1:
        print("Yes")
    else:
        print("No")
# Original solution
list1=input().split(' ')
N=int(list1[0])
K=int(list1[1])
Q=int(list1[2])
listQ=[]
for i in range(Q):
    listQ.append(int(eval(input())))
listScores=[K for i in range(N)]
for i in listQ:
    listScores=[x-1 for x in listScores]
    listScores[i-1]=listScores[i-1]+1
for i in listScores:
    if i>0:
        print('Yes')
    elif i<=0:
        print('No')


# Optimized solution
list1=input().split(' ')
N=int(list1[0])
K=int(list1[1])
Q=int(list1[2])
listQ=[]
for i in range(Q):
    listQ.append(int(eval(input())))
listScores=[K for i in range(N)]
sum=0
for i in listQ:
    sum=sum+1
    listScores[i-1]=listScores[i-1]+1
for i in listScores:
    i=i-sum
    if i>0:
        print('Yes')
    elif i<=0:
        print('No')
# Original solution
n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
if k>q:
    for i in range(n):
        print('Yes')
else:
    for i in range(1,n+1):
        print(('Yes' if k-len(a)+a.count(i)>0 else 'No'))

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

# Optimized solution
n,k,q = list(map(int, input().split()))
al = [0]*n
for i in range(q):
    al[int(eval(input()))-1]+=1
for i in al:
    print(('Yes' if k-q+i>0 else 'No'))
# Original solution
# N:人数, K:初期ポイント, Q:クイズ数
N, K, Q = list(map(int,input().split()))
points = [K] * N

def not_ans(li):
    return li -1

for i in range(Q):
    anser = int(eval(input()))-1
    points = list(map(not_ans,points))
    points[anser] += 1
    
for y in range(N):
    if points[y] < 1:
        print('No')
    else:
        print('Yes')


# Optimized solution
# N:人数, K:初期ポイント, Q:クイズ数
N, K, Q = list(map(int,input().split()))

s = K-Q

points = [s] * N

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

for p in points:
    print(('Yes' if p>0 else 'No'))
# Original solution
m = list(map(int,input().split()))
a=[int(eval(input())) for i in range(m[2])]

n = [0] * m[0]

b=list(set(a))
for i in range(len(b)):
    n[b[i]-1] = a.count(b[i])

  
for i in range(m[0]):
    if n[i] - m[2] + m[1] > 0:
        print('Yes')
    else:
        print('No')

# Optimized solution
m = list(map(int,input().split()))
n = [0] * m[0]

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

# Optimized solution
n,k,q = list(map(int,input().split()))
ans = [0]*n
for i in range(q):
    idx = int(eval(input())) -1
    ans[idx] += 1
for i in ans:
    print(('Yes' if q-k<i else 'No'))
# Original solution
import sys
import math
from collections import Counter
import itertools
import fractions
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################
 
N,K,Q=MI()
A=[K]*N
q=[0]*Q
for i in range(Q):
    q[i]=II()

for x in q:
    for i in range(len(A)):
        if i != x-1:
            A[i] -=1
for a in A:
    if a >0:
        print('Yes')
    else:
        print('No')





# Optimized solution
import sys
import math
from collections import Counter
import itertools
import fractions
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################
 
N,K,Q=MI()
A=[K-Q]*N
q=[0]*Q
for i in range(Q):
    q[i]=II()

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

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

points = [K] * N
for correct in A:
    for i in range(N):
        if i != int(correct) - 1:
            points[i] -= 1

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


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

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

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

for i in A:
    B[i-1] = B[i-1] + 1
    for j in range(n):
        B[j] = B[j] - 1


for k in range(n):
    if B[k] > 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)]
B = [k] * n

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



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

# Optimized solution
n,k,q = list(map(int, list(input().split())))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(eval(input())))
	point[a[i]-1]+=1
for i in range(n):
    if point[i]-q>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(q):
  for j in range(n):
    if a[i]-1 != j :
      ans[j] -= 1
  
for anss in ans:
  print(("Yes" if anss > 0 else "No"))

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

ans = [0] * n

for i in range(q):
  ans[a[i]-1] += 1
for anss in ans:
  print(("Yes" if k - q + anss > 0 else "No"))
# Original solution
num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [init_point]*participant

for i in range(correct):
  answer_person = int(eval(input()))
  tmp[answer_person-1] += 1
  tmp = [i-1 for i in tmp]
  
for item in tmp:
  if item>0: print("Yes")
  else: print("No")

# Optimized solution
import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

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

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")
# Original solution
import sys

info = input().split(" ")
N = int(info[0])
K = int(info[1])
Q = int(info[2])
  
point = [K]*N
  
for i in range(1, Q+1):
  person = int(eval(input()))
  for n in range(N):
    if person != n+1:
      point[n] = point[n] - 1
      
  
for p in point:
  if p <= 0:
    print("No")
  else:
    print("Yes")


# Optimized solution
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(eval(input()))
  s = s - 1
  ns[s] = ns[s] + 1
      
  
for p in ns:
  if p <= 0:
    print("No")
  else:
    print("Yes")
# Original solution
N, K, Q = list(map(int, input().split()))
A_list = [int(eval(input())) for i in range(Q)]


ori = K - Q
for n in range(1, N + 1):
    n_count = A_list.count(n)
    if n_count == 0:
        if ori > 0:
            print('Yes')
        else:
            print('No')
    else:
        if ori + n_count > 0:
            print('Yes')
        else:
            print('No')


# Optimized solution
N, K, Q = list(map(int, input().split()))
index_list = [int(eval(input())) - 1 for i in range(Q)]

zero_list = [0 for n in range(N)]

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

# shakayamiさんのコードを参考にしました
# for文が入れ子になると遅くなるから，出来るだけそうしない
# Original solution
import collections

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

if (K - Q) > 0:
    for _ in range(N):
        print('Yes')
else:
    l = []
    for i,v in list(dict(c).items()):
        if v >(Q - K):
            l.append(i-1)
    l.sort()
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop(0)
#             if l == []:
#                 for _ in range(N-j-1):
#                     print('No')
#                 break
        else:
            print('No')

# Optimized solution
import collections

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

if (K - Q) > 0:
    for _ in range(N):
        print('Yes')
else:
    l = ['No'] * N
    for i,v in list(dict(c).items()):
        if v >(Q - K):
            l[i-1] = 'Yes'
    for j in l:
        print(j)
# Original solution
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]

for i in range(1,N+1):
  plus = A.count(i)
  if K - (Q-plus) <= 0:
    print("No")
  else:
    print("Yes")



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

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

ns_points = [k] * n

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

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

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

ns_points = [k] * n
ns_corrects = [0] * n
for i in range(q):
    ns_corrects[int(eval(input()))-1] += 1


for j in range(len(ns_points)):
    if ns_points[j] - (q - ns_corrects[j]) <= 0:
        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):
    katisuu = A.count(i+1)
    point = Q - katisuu

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


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

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

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

    if point < K:
        print("Yes")
    else:
        print("No")
# Original solution
N,point,answer=list(map(int,input().split()))
W=[point]*N
for i in range(answer):
  U=int(eval(input()))
  W=[n-1 for n in W]
  W[U-1]+=1
for k in range(N):
  if W[k]<=0:
    print("No")
  else:
    print("Yes")
  
  
  
  

# Optimized solution
N,point,answer=list(map(int,input().split()))
W=[point]*N
for i in range(answer):
  U=int(eval(input()))
  W[U-1]+=1
W=[n-answer for n in W]
for k in range(N):
  if W[k]<=0:
    print("No")
  else:
    print("Yes")
# Original solution
N,K,Q=list(map(int,input().split()))
ls1 = [int(eval(input())) for i in range(Q)]
ls_ = [K]*N
for i in ls1:
  ls_ = list([x-1 for x in ls_])
  ls_[i-1]+=1
for i in ls_:
  if i <=0:
    print("No")
  else:
    print("Yes")

# Optimized solution
N,K,Q=list(map(int,input().split()))
ls_ = [K]*N
for i in range(Q):
  ls_[int(eval(input()))-1]+=1
ls__ = ["No" if i <= Q else "Yes" for i in ls_]
string = "\n".join(ls__)
print(string)
# Original solution
N, K, Q = list(map(int, input().split()))
A_lis = [int(eval(input())) for _ in range(Q)]

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


# Optimized solution
N, K, Q = list(map(int, input().split()))
A_lis = [int(eval(input())) for _ in range(Q)]
#A_lis.sort()

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

point = []

for i in range(N):
    point.append(K)
    
for i in range(Q):
    for j in range(N):
        if j == A[i]-1:
            pass
        else:
            point[j] -= 1
    
for i in range(N):
    if point[i] > 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)]

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')
# Original solution
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
man = [K] * N
for i in A:
		man = list([x - 1 for x in man])
		man[i-1] += 1

for out in man:
		if out <= 0:
				print("No")
		else:
				print("Yes")


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

for out in man:
		if out <= 0:
				print("No")
		else:
				print("Yes")