CodeEff/ECCO huggingface dataset:
# Original solution
# For taking integer inputs.
def inp():
    return(int(eval(input())))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = eval(input())
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(list(map(int, input().split())))


N, K, Q = invr()
S = [K] * (N+1)

for i in range(1, Q+1):
    a = inp()
    for j in range(1, N+1):
        if j != a:
            S[j] -= 1
for i in range(1, N+1):
    if S[i] > 0:
        print("Yes")
    else:
        print("No")


# Optimized solution
# For taking integer inputs.
def inp():
    return(int(eval(input())))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = eval(input())
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(list(map(int, input().split())))


N, K, Q = invr()
S = [K] * (N+1)
t = 0
for i in range(1, Q+1):
    a = inp()
    S[a] += 1
    t += 1

for i in range(1, N+1):
    if S[i] - t > 0:
        print("Yes")
    else:
        print("No")
# Original solution
n, k, q = list(map(int, input().split()))
#print(n,k,q)
l = [0] * n
#print(l)
katen = []
my_append = katen.append
for i in range(q):
    my_append(int(eval(input())))
#print(katen)

my_pop = l.pop
my_insert = l.insert
for j in katen:
    x = my_pop(j-1)
    my_insert(j-1, x+1) 
#print(l)

for y in range(n):
    if l[y] > q-k:
        print('Yes')
    else:
        print('No')

# Optimized solution
n, k, q = list(map(int, input().split()))
#print(n,k,q)
l = [0] * n
#print(l)
katen = []
my_append = katen.append
for i in range(q):
    my_append(int(eval(input())))
#print(katen)

    
for j in katen:
    l[j-1] += 1 

    
#print(l)

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

my_append = katen.append # appendを(間接的に)直接呼び出す
for i in range(q):
    my_append(int(eval(input())))

for j in katen: # pop、insertを使わない、使うとTLE！
    l[j-1] += 1 

for y in range(n):
    if l[y] > q-k:
        print('Yes')
    else:
        print('No')

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

score = [k-q] * n
for i in l:
    score[i-1] += 1

for j in score:
    if j > 0:
        print('Yes')
    else:
        print('No')
# 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(1,N+1):
  if a.count(i) >= (Q-K+1):
    print("Yes")
  else:
    print("No")

# Optimized solution
# coding: utf-8
# Your code here!

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

for i in range(N):
    if Q - L[i] < K:
        print('Yes')
    else:
        print('No')
# Original solution
import sys
readline = sys.stdin.buffer.readline

N, K, Q = list(map(int, readline().split()))
A = []
for a in range(Q):
    A.append(int(readline()))


points = [K] * N

for i in range(Q):

    for j in range(N):
        if A[i] - 1 != j:
            points[j] -= 1

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

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

N, K, Q = list(map(int, readline().split()))
A = []
for a in range(Q):
    A.append(int(readline()))

points = [0] * N

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

for p in points:
    score = K - Q + p
    print(("Yes" if score > 0 else "No"))
# Original solution
import sys
input=sys.stdin.readline
N,K,Q=list(map(int,input().split()))
J=[int(eval(input())) for _ in range(Q)]
for i in range(1,N+1):
    print(("Yes" if K-Q+J.count(i)>0 else "No"))


# Optimized solution
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N,K,Q = list(map(int,input().split()))
A = (int(x) for x in sys.stdin.read().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

answer = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(answer)
# Original solution
N,K,Q = list(map(int, input().split()))

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

P = [K for _ in range(N)]

for i in range(Q):
    ans = A[i]
    P = list([x-1 for x in P])
    P[ans-1] += 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 = [0 for _ in range(N)]
for q in range(Q):
    num = int(eval(input()))
    P[num - 1] += 1

val = K - Q
if val > 0:
    for i in range(N):
        print('Yes')
else:
    standard = abs(val) + 1
    for i in range(N):
        if P[i] >= standard:
            print('Yes')

        else:
            print('No')
# Original solution
#入力。参加者数N, 初期得点K ,正解数Q
N, K, Q = list(map(int,input().split()))
#入力。正解した人の番号A[i]
A = [None for _ in range(Q)]
for i in range(Q):
  A[i] = int(eval(input()))
#初期得点(hp)をリスト化。
hp = [K for _ in range(N)]
#まず他の人への攻撃力at(各人の正解数)を記録。
at = [0 for _ in range(N)]
#正解した人の攻撃力+1。
for i in range(Q):
  j = A[i]
  at[j-1] += 1
#攻撃力分の数を一度全員のhpからマイナスする。
s = sum(at)
for i in range(N):
  hp[i] -= s
#各々自分の攻撃力分は本来受けないはずのダメージなのでhpに戻す(足す)。
for i in range(N):
  hp[i] += at[i]
#結果(生き残り判定)
for i in range(N):
  if hp[i] > 0:
    print('Yes')
  else:
    print('No')

# Optimized solution
#入力。参加者数N, 初期得点K ,正解数Q
N, K, Q = list(map(int,input().split()))
#入力。正解した人の番号A[i]
A = [None for _ in range(Q)]
for i in range(Q):
  A[i] = int(eval(input()))
#初期得点(hp)をリスト化。
hp = [K for _ in range(N)]
#まず他の人への攻撃力at(各人の正解数)を記録。
at = [0 for _ in range(N)]
#正解した人の攻撃力+1。
for i in range(Q):
  j = A[i]
  at[j-1] += 1
#攻撃力分の数を一度全員のhpからマイナスする。合計はfor文の外でやっておかないとTLE。
s = sum(at)
for i in range(N):
  hp[i] -= s
#各々自分の攻撃力分は本来受けないはずのダメージなのでhpに戻す(足す)。
for i in range(N):
  hp[i] += at[i]
#結果(生き残り判定)
for i in range(N):
  if hp[i] > 0:
    print('Yes')
  else:
    print('No')
# Original solution
def minus(n):
    return n - 1

n,k,q = list(map(int,input().split()))
a = [0] * q
b = [0] * n

member = [k]*n

for i in range(q):
    a[i] = int(eval(input()))
    member[a[i]-1] = member[a[i]-1] + 1
    member = list(map(minus, member))

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

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

member = [k] * n

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

for j in range(n):
    if member[j] - q <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
# coding: utf-8
# Your code here!
import sys
input = sys.stdin.readline

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

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

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


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

point = [K] * N

def mainasu(n):
    return n-1

for i in range(Q):
    point = list(map(mainasu, point))
    point[A[i] - 1] += 1

for j in range(N):
    if point[j] > 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())))

point = [K-Q] * N

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

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

A = [0] * N

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

sum(A)

for j in range(N):
	if K - (sum(A)-A[j]) > 0:
		print("Yes")
	else:
		print("No")




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

A = [0] * N

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

sm = sum(A)

for j in range(N):
	if K - (sm-A[j]) > 0:
		print("Yes")
	else:
		print("No")
# Original solution
n, k, q = list(map(int, input().split()))
a = [eval(input()) for i in range(q)]
point = []
one = []
ans = []

for j in range(n):
  point.append(k)
  one.append(1)
  
for x in range(q):
  point = [p-o for (p,o) in zip(point, one)] 
  point[int(a[x])-1] += 1
  
for y in range(n):
  if point[y] <= 0:
    ans.append('No')
  else:
    ans.append('Yes')
  print((ans[y]))

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

for z in range(n):
  point.append(0)

for j in range(q):
  point[int(a[j])-1] += 1
  
for x in range(n):
  if point[x] > q-k:
    ans.append('Yes')
  else:
    ans.append('No')
  print((ans[x]))
# Original solution
N,K,Q = list(map(int,input().split()))
L = [K for n in range(N)]

for i in range(Q):
  A = int(eval(input()))
  for j in range(N):
    if j != A-1:
      L[j] -= 1
      
for j in range(N):
  if L[j] > 0:
    print("Yes")
  else: 
    print("No")

# Optimized solution
N,K,Q = list(map(int,input().split()))
L = [0 for n in range(N)]

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

for j in range(N):
  if K - (Q-L[j]) > 0:
    print("Yes")
  else: 
    print("No")
# Original solution
#Nは参加人数,Kは初期ポイント、Qはクイズ回数
N ,K ,Q = list(map(int,input().split()))

N_case =[]
i =0
while i <N :
  N_case.append(K)
  i+=1

j =0
while j <Q :
  k =0
  a = int(eval(input()))
  while k <N:
    N_case[k] -=1
    k+=1
  N_case[a-1] +=1
  j +=1


for n in N_case:
  if n>0:
    print('Yes')
  else:
    print('No')



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

N_case =[]
i =0
while i <N :
  N_case.append(K-Q)
  i+=1

j =0
while j <Q :
  a = int(eval(input()))
  N_case[a-1] +=1
  j +=1


for n in N_case:
  if n>0:
    print('Yes')
  else:
    print('No')
# Original solution
N, K, Q = [ int(n) for n in input().split() ]
A = []
for _ in range(Q):
    A.append(int(eval(input()))-1)

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

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

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

for i in range(n):
    num = 0
    for  cp in a:
        if cp == i + 1:
            num += 1
    if k <= q - num:
        print("No")
    else:
        print("Yes")

# Optimized solution
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 k - (q - a[i]) > 0:
        print('Yes')
    else:
        print('No')
# Original solution
N,K,Q = list(map(int,input().split()))

Answer_list = list()
point_list = [K] *N
for i in range(0,Q):
    Answer_list.append(int(eval(input())))

for j in Answer_list:
    for k in range(0,N):
        if k != j-1:
            point_list[k] -= 1

for l in point_list:
    if l <= 0:
        print("No")
    else:
        print("Yes")


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

Answer_list = list()
point_list = [0] *N
for i in range(0,Q):
    Answer_list.append(int(eval(input())))

for j in Answer_list:
    point_list[j-1] += 1

for l in point_list:
    if Q - l >= K:
        print("No")
    else:
        print("Yes")
# Original solution
def maina(n):
    return n-1

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

for i in range(Q):
    score = list(map(maina, score))
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")

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


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

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

mi = lambda x: x - 1

for _ in range(q):
    win = int(eval(input()))
    #points = [p-1 for p in points]
    points = list(map(mi, points))
    points[win-1] += 1

for i in points:
    if i >= 1:
        print('Yes')
    else:
        print('No')


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


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

points = [p-q for p in points]
for i in points:
    if i >= 1:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int, input().split()))
A = []
for q in range(Q):
    A.append(int(eval(input())))
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)

# Optimized solution
import sys
N, K, Q = list(map(int, input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)
# Original solution
import sys
N, K, Q = list(map(int, input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * N
for a in A:
  score[a - 1] += 1
for s in score:
  print(('Yes' if s > 0 else 'No'))

# Optimized solution
import sys
N, K, Q = list(map(int, input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
  score[a] += 1
print(("\n".join('Yes' if s > 0 else 'No' for s in score[1:])))
# Original solution
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []

SCORE = [K] * N

for i in range(Q):
  XX = [x - 1 for x in SCORE]
  SCORE = list(XX)
  SCORE[int(eval(input()))-1] += 1
for i in range(N):
  if(SCORE[i]<1):
    print("No")
  else:
    print("Yes")

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

SCORE = [0] * N

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

for i in range(q):
    for j in range(n):
        if (A[i] - 1) != j:
            P[j] -= 1

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

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

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

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

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

for q in range(Q):
  win=int(eval(input()))
  for i in range(N):
    if i!=win-1:
      A[i]-=1

def hantei(x):
    if x >0:
        return('Yes')
    else:
        return('No')
      
for answer in map(hantei,A):
    print(answer)

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

#b_list = list(map(int,input().split()))
#print(" ".join(map(str,c_list)))

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

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

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

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

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

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

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

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

for i in range(len(a)):
    clear_num = a[i]-1
    for j in range(n):
        if j != clear_num:
             score[j] += -1

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



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

score = [0 for _ in range(n)]

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


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

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


# Optimized solution
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 k-(q-a[i]) > 0:
        print("Yes")
    else:
        print("No")
# Original solution
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 k-(q-a[i]) > 0:
        print("Yes")
    else:
        print("No")


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

for _p in p:
    if k-(q-_p) > 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()))
for i in range(n):
  if a.count(i+1) > q-k :
    print("Yes")
  else:
    print("No")

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

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

ans = '\n'.join('Yes' if i > 0 else 'No' for i in point[0:])
print(ans)

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

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

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

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

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

for l in range(n):
    if i[l] <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
def slove():
    import sys
    import bisect
    import collections
    import fractions
    import heapq
    input = sys.stdin.readline
    n, k, q = list(map(int, input().rstrip('\n').split()))
    a = [int(input().rstrip('\n')) for _ in range(q)]
    ls = [k-q] * n
    for v in a:
        ls[v-1] += 1
    for i in range(len(ls)):
        if ls[i] > 0:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    slove()


# Optimized solution
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, k, q = list(map(int, input().rstrip('\n').split()))
    a = [int(input().rstrip('\n')) for _ in range(q)]
    ls = [0] * n
    for v in a:
        ls[v-1] += 1
    for i in range(n):
        if q - ls[i] < k:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    solve()
# Original solution
N, K, Q = list(map(int,input().split()))
A = []
for i in range(Q):
    A.append(int(eval(input()))-1)
for i in range(N):
    if A.count(i) >= Q - K + 1:
        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()))-1)
count = [0 for i in range(N)]
for i in A:
    count[i] += 1
for i in range(N):
    if count[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)]

ANS = [k - q] * n

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

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

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

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

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

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