CodeEff/ECCO huggingface dataset:
# Original solution
NKQ = input().split(' ')
N = int(NKQ[0])
K = int(NKQ[1])
Q = int(NKQ[2])

An = [K] * N

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

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

# Optimized solution
NKQ = input().split(' ')
N = int(NKQ[0])
K = int(NKQ[1])
Q = int(NKQ[2])

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

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

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

def s (x:int):
    for k,v in list(d.items()):
        if k == x:
            pass
        else:
            d[k] = v-1

for _ in range(q):
    a = int(eval(input()))
    s (a)

for v in list(d.values()):
    if 0 < v:
        print ("Yes")
    else:
        print ("No")


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

d = {}
for _ in range(q):
    a = int(eval(input()))
    if a in d:
        d[a] += 1
    else:
        d[a] = 1

for i in range(1,n+1):
    if not i in d:
        if q < k:
            print ("Yes")
        else:
            print ("No")
    else:
        if k <= q-d[i]:
            print ("No")
        else:
            print ("Yes")
# Original solution
n, k, q = tuple(map(int, input().split()))
scores = [k]*n
for i in range(q):
    answered = int(eval(input())) - 1
    scores[answered] += 1
    scores = [v - 1 for v in scores]
for i in range(n):
    result = "Yes" if scores[i] > 0 else "No"
    print(result)

# Optimized solution
n, k, q = tuple(map(int, input().split()))
answereds = [0]*n
for i in range(q):
    answered = int(eval(input())) - 1
    answereds[answered] += 1
for i in range(n):
    result = "Yes" if q-answereds[i] < k else "No"
    print(result)
# Original solution
n,k,q = list(map(int,input().split()))
a = [] # 順番
for _ in range(q):
    a.append(int(eval(input())))


point = [k] * n


for win in a:         # 勝った人(a[win-1])以外を下げる
    point[win-1] += 1
    for i in range(n):
        point[i] -= 1
#        print(point)

#print(point)


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



# Optimized solution
n,k,q = list(map(int,input().split())) #N人、Kpoint、Q回答
a = [] # 順番
for _ in range(q):
    a.append(int(eval(input())))

# 最初に回数分引く
point = [k-q] * n

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

#print(point)


for i in point:
    if i <= 0:
        print("No")
    elif i >= 1:
        print("Yes")
# Original solution
def quiz(N,K,Q):
    if K>Q:
        for ans in range(N):
            print('Yes')
    else:
        an=[]
        for qui in range(Q):
            an.append(int(eval(input())))
        po=(Q+1)-K
        for su in range(1,N+1):
            if an.count(su) >=po:
                print('Yes')
            else:
                print('No')
N,K,Q=list(map(int,input().split()))
quiz(N,K,Q)

# Optimized solution
n, k, q = list(map(int, input().split()))
b = [k - q] * n

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

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

bi = [int(k) for _ in range(n)]

for i in range(q):
    for s in range(n):
        if ai[i]-1 != s:
            bi[s] -= 1
        
for i in range(n):
    if bi[i] > 0:
        print("Yes")
    else:
        print("No")

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

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

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

for i in a:
    b[i-1] += 1
for i in range(n):
    if b[i] > q-k:
        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 = [k]*n

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

    for j in range(0,solver):
        point[j] -= 1

    for j in range(solver+1,n):
        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 = [0]*n

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

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

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

for x in win_list:
    for a, b in enumerate(score):
        if not a == x-1:
            score[a] = b-1

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


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

correct = [K-Q] * N

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

for i in correct:
    if 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)]

life = [K] * N

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

life = list([x-Q for x in life])

for l in life:
    if l > 0:
        print("Yes")
    else:
        print("No")

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

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

for l in life:
    if l > 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)]
c = [0]*n
for i in a:
    c[i-1] += 1

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


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

c = [k-q]*(n+1)

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

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

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

# Optimized solution
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K-Q]*N
for i in A:
    point[i-1] += 1
for p in point:
    print(('Yes' if p > 0 else 'No'))
# Original solution
N, K ,Q = (int(nkq) for nkq in input().split())
A = []
score_list = [-1] + [K for _ in range(N)]
for _ in range(Q):
    A.append(int(eval(input())))

for a in A:
    score_list = [-1] + [score_list[i]-1 if i != a else score_list[i] for i in range(1, N+1)]

for score in score_list[1:]:
    if score > 0:
        print("Yes")
    else:
        print("No")

# Optimized solution
N, K ,Q = (int(nkq) for nkq in input().split())
A = []
score_list = [-1] + [K-Q for _ in range(N)]
for _ in range(Q):
    A.append(int(eval(input())))

for a in A:
    score_list[a] += 1

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


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

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

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


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

A = []

for i in range(Q):
    A.append(int(eval(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')
# Original solution
N,K,Q=list(map(int,input().split()))
mylist=[]
pointlist=[]
for i in range(Q):
    mylist.append(int(eval(input())))
    
#print(N,K,Q)    
#print(mylist)

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

i=0
while i<Q:
    winner=mylist[i]-1
    #winner以外のポイントを減らす
    for j in range(N):
        if j==winner: #jがwinnerの番号のときは何もしない
            pass
        else:
            pointlist[j]-=1
    #print(i)
    #print(pointlist)
    i+=1
    
for i in range(N):
    if pointlist[i]<=0:
        print("No")
    else:
        print("Yes")

# Optimized solution
N,K,Q=list(map(int,input().split()))
mylist=[]
pointlist=[]
for i in range(Q):
    mylist.append(int(eval(input())))
    
for i in range(N):
    #全員にKポイント与えるが、Qポイント引く
    pointlist.append(K-Q)
    
#正解者に1ぽいんとずつ足す。

for i in range(Q):
    #mylist[i]をjとしたら、j番目の人が勝者ということ。pointlist[j-1]に1を足す。
    j=mylist[i]
    pointlist[j-1]+=1
    
for i in range(N):
    if pointlist[i]>0:
        print("Yes")
    else:
        print("No")
# Original solution
n_people, full_p, n_ques = list(map(int, input().split()))

point = [full_p]*n_people

for i in range(n_ques):
  people = int(eval(input()))
  for j in range(n_people):
    if (j+1) != people: point[j] -= 1
      
for i in range(n_people):
  if point[i]>0: print('Yes')
  else: print('No')

# Optimized solution
n_people, full_p, n_ques = list(map(int, input().split()))

count = [0]*n_people

for i in range(n_ques):
  people = int(eval(input()))
  count[people-1] += 1

     
for i in range(n_people):
  if count[i] > n_ques-full_p:
    print('Yes')
  else:
    print('No')
# Original solution
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N,K,Q=list(map(int,input().split()))

A=[int(eval(input())) for _ in range(Q)]
S=[K]*N

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

# Optimized solution
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N,K,Q=list(map(int,input().split()))

A=[int(eval(input())) for _ in range(Q)]
S=[K-Q]*N


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

    point = [k] * n

    for i in range(q):
        point = list([x - 1 for x in point])
        point[a[i]-1] += 1

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


if __name__ == "__main__":
    main()


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

    point = [0] * n

    for i in range(q):
        # point = list(map(lambda x: x - 1, point))
        point[a[i]-1] += 1

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


if __name__ == "__main__":
    main()
# Original solution
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

def main():
    """ main """
    N,K,Q = list(map(int, input().split()))
    res = [K]*N
    for _ in range(Q):
        a = int(eval(input()))
        a -= 1
        for n in range(N):
            if n != a:
                res[n] -= 1
    for x in res:
        if 0<x: print('Yes')
        else: print('No')

if __name__ == '__main__':
    main()

# Optimized solution
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()
# Original 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):
  if l[i]>q-k:print("Yes")
  else:print("No")

# Optimized solution
import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline

# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np


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

	for i in A:
		print(("Yes" if i<0 else "No"))




if __name__ == "__main__":
	main()
# Original solution
#!/usr/bin/env python3
N,K,Q=(int(x) for x in input().split())
a=[int(eval(input())) for i in range(Q)]#正解者
l=[]
for j in range(N):
    l.append(K)
for k in range(Q):
    for m in range(N):
        l[m]-=1
        if m+1==a[k]:
            l[m]+=1
for n in range(N):
    if(l[n]>=1):
        print("Yes")
    else:
        print("No")


# Optimized solution
#!/usr/bin/env python3
N,K,Q=(int(x) for x in input().split())
a=[int(eval(input())) for i in range(Q)]#正解者
l=[]
for j in range(N):
    l.append(K-Q)
for k in range(Q):
  l[a[k]-1]+=1

for n in range(N):
    if(l[n]>=1):
        print("Yes")
    else:
        print("No")
# Original solution

# coding: utf-8

# In[3]:


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


# In[6]:


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


# In[10]:


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


# Optimized solution

# coding: utf-8

# In[11]:


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


# In[13]:


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


# In[14]:


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

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

for a in a_list:
    p_list[a] += 1

for p in p_list:
    if p <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
    t = int(eval(input()))
    a.append(t)
m = [k] * n
for i in a:
    for j in range(n):
        if j != i - 1:
            m[j] -= 1
for i in m:
    print(("Yes" if i>0 else "No"))

# Optimized solution
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
    t = int(eval(input()))
    a.append(t)
m = [k - q] * n
for i in a:
    m[i-1] += 1
for i in m:
    print(("Yes" if i>0 else "No"))
# Original solution
import sys
input = sys.stdin.readline
n,k,q = list(map(int,input().split()))
A = []
for i in range(q):
    A.append(int(eval(input())))

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



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

for i in range(n):
    if A[i] > q-k:
        print('Yes')
    else:
        print('No')
# Original solution
n,k,q = list(map(int, input().split()))
corr = [k-q]*n

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

for c in corr:
    if c > 0:
        print('Yes')
    else:
        print('No')

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

a_cnt = [0]*n
for _ in range(q):
    a = int(eval(input())) - 1
    a_cnt[a] += 1


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

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

# Optimized solution
N, K, Q = list(map(int, input().split()))
A = list(int(eval(input())) for i in range(Q))

P = [-(Q - K)] * N

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

for p in P:
    if p > 0:
        print('Yes')
    else:
        print('No')
# Original solution
n,k,q = list(map(int,input().split()))
a = []; b = [0]*n
for i in range(q):
    c = int(eval(input()))
    a.append(c)
    b[c-1] += 1
for i in b:
    if k-(q-i) <= 0:
        print("No")
    else:
        print("Yes")

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

# Optimized solution
n, k, q = list(map(int, input().split()))
po = [0]*n
r = q-k
while q:
  c = int(eval(input()))
  po[c-1]+=1
  q-=1
for i in range(n):
  if po[i]>r:
    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 = [0]*N

S = - K + Q
for i in range(N):
    if A.count(i+1) > S :
      #  B[i] += S + A.count(i+1)

#    if B[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)]
B = [K-Q]*N

for i in range(Q):
    B[A[i]-1] += 1
    
for i in range(N):
#if A.count(i+1) > S :
#      B[i] += S + A.count(i+1)

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

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


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

for i in a:
  #print(i)
  if K + i > 0:
    print("Yes")
  else:
    print("No")
# Original solution
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')

# Optimized solution
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')
# Original solution
N,K,Q=list(map(int,input().split()))
check=[K]*N
for i in range(Q):
  A=int(eval(input()))-1
  for j in range(N):
    if j!=A:
      check[j]-=1
for i in range(N):
  print(("Yes" if check[i]>0 else "No"))


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

lis = []
for _ in range(q):
    lis.append(int(eval(input())))
    
ori = k - q
for i in range(n):
    if ori + lis.count(i+1) > 0:
        print("Yes")
    else:
        print("No")



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

lis = [k-q] * n
for _ in range(q):
    tmp = int(eval(input()))
    lis[tmp - 1] += 1

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