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

points = [k] * n
for i in range(q):
    points = list([x - 1 for x in points])
    points[l[i] - 1] += 1
for i in points:
    if i <= 0:
        print('No')
    else:
        print('Yes')


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

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

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


# Optimized solution
n, k, q = (int(_) for _ in input().split())

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

for i in range(1, n+1):
    print(('Yes' if a[i] > 0 else 'No'))
# Original solution
n, k, q = list(map(int, input().split()))
As = [int(eval(input())) for i in range(q)]
points = {i: k for i in range(n)}
for i in range(q):
    solver = As[i] - 1
    for j in range(n):
        if j == solver:
            continue
        else:
            points[j] -= 1
for i in range(n):
    if points[i] <= 0:
        print("No")
    else:
        print("Yes")





# Optimized solution
n, k, q = list(map(int, input().split()))
As = [int(eval(input())) for i in range(q)]
points = {i: k for i in range(n)}
accepted = [0] * n

for i in range(q):
    accepted[As[i]-1] += 1

for i in range(n):

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

# Optimized solution
N,K,Q=list(map(int,input().split()))
B=[0]*N
def minu(n):
  return n-1
for i in range(Q):
  A=int(eval(input()))
  B[A-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(1, Q+1)]
for i in range(1,N+1):
    if A.count(i) > (Q-K):
        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 = [K-Q] * N
for c in A:
    Point[c-1] += 1
for p in Point:
    if p > 0:
        print('Yes')
    else:
        print('No')
    #if A.count(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)]
p = [k for i in range(n)]
def judge(x):
    if p[x] <= 0:
        return 'No'
    else:
        return 'Yes'
for j in range(q):
    for i in range(n):
     if i + 1 == a[j]:
        continue
     else:
        p[i] -= 1
b = [judge(i) for i in range(n)]
print(('\n'.join(b)))

# Optimized solution
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print(('\n'.join(b)))
# Original solution
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7


N, K, Q = rl()
A = []
for i in range(Q):
	a = ri()
	A.append(a)

scores = [K] * N
for a in A:
	idx = a-1
	for i in range(N):
		if i != idx:
			scores[i] -= 1
for s in scores:
	if s > 0:
		print('Yes')
	else:
		print('No')

# Optimized solution
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7


N, K, Q = rl()
A = []
for i in range(Q):
	a = ri()
	A.append(a)

scores = [0] * N
for a in A:
	idx = a-1
	scores[idx] += 1

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

for i in range(len(a_i)):
    for j in range(len(score)):
        if(a_i[i] == j):
            score[j] += 0
        else:
            score[j] -= 1
    
for i in score:
    if(i > 0):
        print('Yes')
    else:
        print('No')

# Optimized solution
import sys
n,k,q = list(map(int,input().split()))
score = [k-q for i in range(n)]
a_i = [int(eval(input()))-1 for i in range(q)]


for i in range(len(a_i)):
    score[a_i[i]] += 1



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


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

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

N = get[0]
K = get[1]
Q = get[2]

point = [K]*N
list = [0]*N

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

for i in range(N):
  if point[i] - (Q - list.count(i+1)) > 0:
    print("Yes")
  else:
    print("No")

# Optimized solution
get = list(map(int, input().split()))

N = get[0]
K = get[1]
Q = get[2]

list = [0]*N

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

for i in range(N):
  if K - (Q - list[i]) > 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)]
hit = [0]*N
poi = [K]*N
for i in range(N):
    hit[i] = A.count(i+1)
    poi[i] = K - Q + hit[i]
    if poi[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)]
poi = [K-Q]*N
for i in range(Q):
    poi[A[i]-1] += 1

for i in range(N):
    if poi[i] > 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)]
points = [k - q]*n
for i in range(n):
    points[i] += a.count(i+1)
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

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

n, k, q = list(map(int, input().split(" ")))
a = []
points = []
for i in range(0,n):
  points.append(k)

for s in range(0,q):
  a = int(eval(input())) - 1
  for l in range(0, len(points)):
    if l != a:
      points[l] = points[l]-1

for t in range(0, n):
  result = "Yes"
  if points[t] <= 0:
    result = "No"
  print(result)


# Optimized solution
n, k, q = list(map(int, input().split(" ")))
a = []
points = []
for i in range(0,n):
  points.append(k - q)

for s in range(0,q):
  a = int(eval(input())) - 1
  points[a] = points[a] + 1

for t in range(0, n):
  result = "Yes"
  if points[t] <= 0:
    result = "No"
  print(result)
# Original solution
N,K,Q = list(map(int, input().split()))
A = []
for a in range(Q):
	A.append(int(eval(input())))


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

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


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

for a in A:
	for i in range(N):
		if i == a:
			continue
		else:
			score[i] -= 1

# 勝ち抜けチェック 
for i in range(N):
	if score[i] > 0:
		print("Yes")
	else:
		print("No")
		

# Optimized solution
#ABC 141
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
score = [0 for i in range(N)]

for a in A:
	score[a-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 = []
for i in range(Q):
    A.append(int(eval(input())))

#print(N,K,Q)
#print(A)

P = [K for _ in range(N)]
#print(P)
for a in A:
    for n in range(N):
        if (n==(a-1)):
            P[n] += 1

#print(P)

for n in range(N):
    if(P[n]-Q>0):
        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())))

#print(N,K,Q)
#print(A)

P = [K for _ in range(N)]
#print(P)
for a in A:
    P[a-1] += 1

#print(P)

for n in range(N):
    if(P[n]-Q>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)]
score = [K]*N

for i in range(Q):
    score[A[i]-1] += 1
    for j in range(N):
        score[j] -= 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 = [int(eval(input())) for i in range(Q)]
score = [0]*N

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

for i in range(N):
    print(('YNeos'[score[i] + K <= Q::2]))
# Original solution
n, k, q = list(map(int, input().split()))
a = []
for _ in range(q):
    a.append(int(eval(input())) - 1)

s = [k] * n
for i in range(q):
    for j in range(n):
        if a[i] != j:
            s[j] -= 1

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

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

for i in range(n):
    if k - q + win[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)]

p=[K]*N

for a in A:
    p = list([x-1 for x in p])
    p[a-1]+=1
for i in p:
    print(('Yes' if 0<i else 'No'))

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

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

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

minus=[]
for i in range(1,n+1):
  minus.append(A.count(i))
for i in range(n):
  if k-(q-minus[i])<=0:
    print('No')
  else:
    print('Yes')

# Optimized solution
import sys
import itertools
input = sys.stdin.readline
n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(q)]

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

if K > Q: 
    for _ in range(N):
        print("Yes")
else:
    for i in range(1, N + 1):
        if i in A:
            print(("{}".format("Yes" if (K + A.count(i) - Q) > 0 else "No")))
        else:
            print("No")

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

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

for i in pnts:
    if K - Q + 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)]

score = [k]*n
for i in A:
    score = list([x-1 for x in score])
    score[i-1] = score[i-1]+1

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

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

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

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


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

for aa in a:
    if aa > 0:
        print('Yes')
    else:
        print('No')


# Optimized solution
N,K,Q = [int(x) for x in input().split()]
AI = [0]*N
for _ in range(Q):
    ai = int(eval(input()))
    AI[ai-1] += 1
sum_a = sum(AI)

for ai in AI:
    if sum_a - ai >= K:
        print('No')
    else:
        print('Yes')
# Original solution
N,K,Q=list(map(int, input().split()))

list=[(K-Q) for j in range(N)]

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

for score in list:
    if 0<score:
        print("Yes")
    else:
        print("No")


# Optimized solution
N,K,Q=list(map(int, input().split()))
 
list=[(K-Q) for j in range(N)]
 
for i in range(Q):
	A=int(eval(input()))-1
	list[A]+=1
 
for score in list:
	if score>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 j in range(1,N+1):
    count=0
    for k in A:
        if k==j:
            count+=1
    if K-(Q-count)>0:
        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 = {}
tmp = 0

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

    else:
        point[tmp] = 1

for b in range(1, n + 1):
    tmp = 0

    if b in point:
        tmp = sum(point.values()) - point[b]

    else:
        tmp = sum(point.values())

    if tmp >= k:
        print("No")

    else:
        print("Yes")


# Optimized solution
n, k, q = list(map(int, input().split()))
point = {}
tmp = 0

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

    else:
        point[tmp] = 1

total = sum(point.values())

for b in range(1, n + 1):
    if b in point:
        if total - point[b] >= k:
            print("No")
        else:
            print("Yes")

    else:
        if total >= k:
            print("No")

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

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

if K > Q:
    for i in range(N):
        print('Yes')
    exit()

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


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

cnt = [0] * n

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

for c in cnt:
    if k - (q - c) > 0:
        print('Yes')
    else:
        print('No')
# 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):
    c = a.count(i)
    print(('Yes' if k - q + c > 0 else 'No'))


# Optimized solution
n, k, q = list(map(int,input().split()))
a = dict((i,0) for i in range(1,n+1))

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

for i in range(1, n + 1):
    print(('Yes' if k - q + a[i] > 0 else 'No'))
# Original solution
def t(n, k, q, a):
    for i in range(n):
        print(("Yes" if (-q + k + a.count(i + 1)) > 0 else "No"))

if __name__ == "__main__":
    n, k, q = list(map(int, input().split()))
    a = [int(eval(input())) for i in range(q)]
    r = t(n, k, q, a)


# Optimized solution
def t(n, k, q, a):
    p = [-q + k] * n
    for i in range(q):
        p[a[i-1]-1] += 1
    return ["Yes" if i > 0 else "No" for i in p]
   

if __name__ == "__main__":
    n, k, q = list(map(int, input().split()))
    a = [int(eval(input())) for i in range(q)]
    r = t(n, k, q, a)
    for i in r:
        print(i)
# Original solution
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]

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

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

for j in range(N):
    if points[j] >= 1:
        print("Yes")
    else:
        print("No")


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

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

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

for j in range(N):
    points[j] -= Q

for j in range(N):
    if points[j] >= 1:
        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(N):
    if K > Q-A.count(i+1):
        print("Yes")
    else:
        print("No")


# Optimized solution
N, K, Q = list(map(int, input().split()))
A = [0]*N
for i in range(Q):
    num = int(eval(input()))
    A[num-1] += 1
# n番目の人の正解数がA[n-1]に入る
for i in range(N):
    if K > Q-A[i]:
        print("Yes")
    else:
        print("No")
# Original solution
N,K,Q = list(map(int,input().split()))
A = []
[A.append(int(eval(input()))) for i in range(Q)]

B = [K]*N

for a in A:
    B = list([x-1 for x in B])
    B[a-1] += 1
for b in B:
    if b>0:
        print("Yes")
    else:
        print("No")


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

B = [K]*N

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

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

for k in b:
    if k > 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())))

cur_k = [k] * n

for i in range(q):
  for j in range(n):
    if (a[i] - 1) != j:
      cur_k[j] -= 1
#  print(a[i], cur_k)
    

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

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

cur_k = [k] * n

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

for i in cur_k:
  if (i > q):
    print("Yes")
  else:
    print("No")
# Original solution
n,k,q = list(map(int, input().split()))
correct_answers = [int(eval(input())) for i in range(q)]
points = [k for i in range(n)]
for i in range(q):
    for m in range(len(points)):
        if m != correct_answers[i]-1:
            points[m] -= 1
for point in points:
    if point < 1:
        print("No")
    else:
        print("Yes")


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

for point in points:
    if point < 1:
        print("No")
    else:
        print("Yes")
# Original solution
n, k, q = list(map(int, input().split()))
a = sorted([0] + list(int(eval(input())) for _ in range(q)))
p = [k - q] * (n + 1)

for i in range(1, n + 1):
    p[i] += a.count(i)
    
for j in range(1, n + 1):
    if p[j] > 0:
        print('Yes')
    else:
        print('No')  

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

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

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