CodeEff/ECCO huggingface dataset:
# Original solution
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K]*N
for i in range(Q):
  a = A[i]
  for p in range(N):
    if p+1 != a:
      point[p] -= 1
for p in range(N):
  if point[p] <= 0:
    print("No")
  else:
    print("Yes")

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

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

for j in P:
    if j > 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):
    w = int(eval(input()))
    P[w-1] += 1

for j in P:
    if j > 0:
        print("Yes")
    else:
        print("No")
# Original solution
# -*- coding: utf-8 -*-

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

point = [k] * n

for _ in range(q):
    answer = int(eval(input())) - 1
    for i in range(n):
        if i != answer:
            point[i] -= 1

for j in point:
    if j > 0:
        print('Yes')
    else:
        print('No')


# Optimized solution
# -*- coding: utf-8 -*-

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

point = [k - q] * n

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

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

for i in range(n):
  print((('No','Yes')[k > q - l.count(i)]))

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

for i in range(n):
  cnt = 0
  if l and l[0] == i:
    while l and l[0] == i:
      l.pop(0)
      cnt += 1
  print((('No','Yes')[k > q - cnt]))
# Original solution
n, k, q = list(map(int, input().split()))
l = [k-q]*n

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

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

n, k, q = list(map(int, input().split()))
l = [k-q]*n

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

# Optimized solution
n,k,q = list(map(int,input().split()))
l = [k-q]*n
for _ in range(q): l[int(eval(input()))-1]+=1
for i in l: print(('YNeos'[i<1::2]))
# Original solution
a = list(map(int, input().split()))
inp = []
for i in range(a[2]):
    inp.append(int(eval(input())))
n_dict = {}
for i in range(a[0]):
    n_dict[i+1] = a[1]
for i in range(a[2]):
    for k , v in list(n_dict.items()):
        n_dict[k] -= 1
for i in range(a[2]):
    n_dict[inp[i]] += 1
for kk , vv in list(n_dict.items()):
    if int(vv) <= 0:
        print('No')
    else:
        print('Yes')

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

hito_dict = {(i+1) : ((n[2]-n[1])*-1) for i in range(n[0])}
for i in range(n[2]):
    d = int(eval(input()))
    hito_dict[d] = hito_dict[d] + 1
for j in range(n[0]):
    if hito_dict[j + 1] > 0:
        print('Yes')
    else:
        print('No')
# Original solution
data = input().split()
tab = [int(data[1])]*int(data[0])
n = int(data[2])
    
for i in range(n):
    value =int(eval(input()))
    tab[value - 1] += 1
    j =0
    while (j < len(tab)):
        tab[j] -= 1
        j += 1
        
for i in tab:
    if (i > 0):
        print ("Yes")
    else:
        print ("No")


# Optimized solution
data = input().split()
score = int(data[1])
tab = [score]*int(data[0])
n = int(data[2])
    
for i in range(n):
    value =int(eval(input()))
    tab[value - 1] += 1
    j =0
for i in tab:
    if (i > n):
        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())))

def minus(data):
  return data - 1

points = [k]*(n+1)
for i in range(q):
  points = list(map(minus, points))
  points[a[i]] += 1

for i in range(1,n+1):
  if points[i] >= 1:
    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())))

points = [k]*(n+1)
plus = [0]*(n+1)
for i in range(q):
  plus[a[i]] += 1

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

# get answer list
answer_list = [ int(eval(input())) for _ in range(q) ]

# init correct num list
correct_num_list = [ answer_list.count(answer + 1) for answer in range(n) ]

for answer in range(n):
    if (0 < (k - (q - correct_num_list[answer]))):
        print('Yes')
    else:
        print('No')


# Optimized solution
# get initial input parameter
n, k, q = list(map(int, input().split()))
 
# init point
point_list = [ (k - q) for _ in range(n) ]
 
for round in range(q):
    # get correct answer persion
    person_index = int(eval(input())) - 1
    
    # point decrement
    point_list[person_index] += 1
 
for item in point_list:
    if (0 < item):
        print('Yes')
    else:
        print('No')
# Original solution
import math
def py():
    print("Yes")
def pn():
    print("No")
def iin():
    x = int(eval(input()))
    return x

neko = 0

n,k,q = list(map(int,input().split()))
p = [k-q] * n
for i in range(q):
    p[iin()-1]+=1
for i in range(n):
    if p[i] > 0:
        py()
    else:
        pn()

# Optimized solution
n,k,q = list(map(int,input().split()))
player = [0] * n
for i in range(q):
    player[int(eval(input()))-1] += 1
result = ['Yes' if k - q + player[i] > 0 else 'No' for i in range(n)]
for i in result:
    print(i)
# Original solution
def A():
    w = ['Sunny', 'Cloudy', 'Rainy']
    today = eval(input())
    index = w.index(today)
    if index == 2:
        index = -1
    print((w[index+1]))

def B():
    odd = 'RUD'
    even = 'LUD'

    s = eval(input())
    for i in range(len(s)):
        if (i+1)%2 == 0:
            if s[i] not in even:
                print('No')
                return
        else:
            if s[i] not in odd:
                print('No')
                return
        
    print('Yes')

def C():
    temp = [int(i) for i in input().split()]
    N = temp[0]
    K = temp[1]
    Q = temp[2]
    points = [0]*N
    # for i in range(N):
    #     points[i] = K

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

    for i, p in enumerate(points):
        if K-sum([x for j,x in enumerate(points) if j!=i]) > 0:
            print('Yes')
        else:
            print('No')
    
C()


# Optimized solution
def A():
    w = ['Sunny', 'Cloudy', 'Rainy']
    today = eval(input())
    index = w.index(today)
    if index == 2:
        index = -1
    print((w[index+1]))

def B():
    odd = 'RUD'
    even = 'LUD'

    s = eval(input())
    for i in range(len(s)):
        if (i+1)%2 == 0:
            if s[i] not in even:
                print('No')
                return
        else:
            if s[i] not in odd:
                print('No')
                return
        
    print('Yes')

def C():
    temp = [int(i) for i in input().split()]
    N = temp[0]
    K = temp[1]
    Q = temp[2]
    points = {}

    for i in range(N):
        points[i] = 0

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

    for i in list(points.keys()):
        if K - (Q - points[i]) > 0:
            print('Yes')
        else:
            print('No')
    
C()
# Original solution
N, K, Q = list(map(int, input().split()))
import sys
input = sys.stdin.readline
A = [K] * N
def calc(n):
  return n-1
for i in range(Q):
  M = int(input().rstrip())
  A = list(map(calc, A))
  A[M-1] += 1
for k in A:
  if k <= 0:
    print("No")
  else:
    print("Yes")

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

for _ in range(q):
    i = int(eval(input())) - 1
    for j in range(n):
        if j != i:
            li[j] -= 1

for j in li:
    if j > 0 :
        print("Yes")
    else:
        print("No") 

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

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

for j in li:
    if k - q + j > 0:
        print("Yes")
    else:
        print("No")
# Original solution
#coding:utf-8

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

for i in range(0, q):
    point = [j-1 for j in point]
    point[int(a[i])-1] += 1
    #print(point)

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

# Optimized solution
#coding:utf-8

n, k, q = list(map(int, input().split()))
a = [eval(input()) for i in range(q)]
point = [k-q] * n
#print(point)

for i in range(0, q):
    point[int(a[i])-1] += 1
    #print(point)

for i in point:
    if i <= 0:
        print('No')
    else:
        print('Yes')
# Original solution

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

ans = [K] * N

for i in range(Q):
    n = int(eval(input()))
    ans = list([x - 1 for x in ans])
    ans[n - 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()))

ans = [K] * N

for i in range(Q):
    n = int(eval(input()))
    ans[n - 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()))-1 for i in range(q)]
point=k-q

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

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

for i in point:
    print(("Yes" if i>0 else "No"))
# Original solution
pnum, default, correct = list(map(int, input().split()))
pep = [default]*pnum
a = list()
for i in range(correct):
    a.append(int(eval(input())))
for i in a:
    for j in range(pnum):
        pep[j] -= 1
    pep[i-1] += 1
for i in pep:
    if i > 0:
        print("Yes")
    else:
        print("No")

# Optimized solution
n, shoki, correct = list(map(int, input().split()))
b = list()
for i in range(correct):
    b.append(int(eval(input())))
a = [shoki]*n
a = [i-correct for i in a]
for i in b:
    a[i-1] += 1
for i in range(n):
    if a[i] <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
# -*- coding: utf-8 -*-
#入力

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

for i in range(1,N+1,1):
    l=a.count(i)
    if(K+l-Q>0):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)]
b=[0]*N
for i in a:
    b[i-1]+=1
for l in range(0,N,1):
    if(K+b[l]-Q>0):print("Yes")
    else:print("No")
# Original solution
N,K,Q = (int(x) for x in input().split())

#initialize
score = []
for x in range(N):
	score.append(K)

#point
for x in range(Q):
	A = int(eval(input()))
	for y in range(N):
		if y+1 != A:
			score[y] -= 1;

for x in range(N):
	if score[x] > 0:
		print("Yes")
	else:
		print("No")


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

score = [0] * N

for x in range(Q):
	A = int(eval(input()))
	score[A-1] += 1;

for x in range(N):
	if score[x] > Q - K:
		print("Yes")
	else:
		print("No")
# Original solution
N,K,Q = [int(i) for i in input().split(' ')]
pointList = [K for _ in range(N)]

for _ in range(Q):
    answer = int(eval(input()))
    i = 0
    for point in pointList:
        if answer-1 != i:
            pointList[i] = point-1
        i += 1
for point in pointList:
    if point <= 0:
        print('No')
    else:
        print('Yes')

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

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

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

# 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 range(q):
    B[A[i]-1] += 1

for i in range(n):
    if B[i] <= 0:
        print('No')
    else:
        print('Yes')
# Original solution
n, k, q = (int(x) for x in input().split())
A = [int(eval(input())) for _ in range(q)]

scores = [k-q for _ in range(n)]
for a in A:
    scores[a-1] += 1

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


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

scores = [k-q]*n
for a in A:
    scores[a-1] += 1

for score in scores:
    print(('Yes' if score > 0 else 'No'))
# Original 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 p:
  if i > 0:
    print('Yes')
  else:
    print('No')

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

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

s = [k-q]*n
for i in range(q):
  x = int(eval(input()))
  s[x-1] += 1
  
for i in s:
  if i > 0:
    print('Yes')
  else:
    print('No')

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

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

for i in l:
  print(("Yes" if i > 0 else "No"))
# Original solution
n, k, q = list(map(int, input().split()))

b = [k]*n

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

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

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

b = [k]*n

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

b = list([x-q for x in b])

for i in range(len(b)):
    if b[i] > 0:
        print('Yes')
    else:
        print('No')
# Original solution
N,K,Q = (int(x) for x in input().split())
#参加者全員分の残りポイントが入ったリスト[3,3,3,3,3,3]を作る
point = []
for i in range(N):
    point.append(K)
#正解者の入力に応じてpointを減らしていく[3,3,3,3,3,3]→[2,2,3,2,2,2]
for i in range(Q):
    currect_person = int(eval(input()))
    for j in range(N):
        if j != currect_person-1:
            point[j] -= 1
    #print(point)

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

# Optimized solution
N,K,Q = (int(x) for x in input().split())
#参加者全員分の残りポイントが入ったリスト[3,3,3,3,3,3]を作る
point = []
for i in range(N):
    point.append(K)
#N人のポイントをはじめに全員分-Qしておく
for i in range(N):
    point[i] -= Q
#正解者ごとに+1する
for i in range(Q):
    point[int(eval(input()))-1] += 1
#結果を出力
for i in range(N):
    if point[i] <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
n,k,q = list(map(int,input().split()))
a=[int(eval(input())) for i in range(q)]
b=[k]*n
c=[0]*n

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

for i in range(n):
    if b[i]<=0:
        c[i]='No'
    else:
        c[i]='Yes'

for i in range(n):
    print((c[i]))


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

for i in range(q):
    b[a[i]-1] +=1
    
for i in range(n):
    if b[i]<=0:
        c[i]='No'
    else:
        c[i]='Yes'

for i in range(n):
    print((c[i]))
# Original solution
N, K, Q = list(map(int, input().split()))

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

for i in range(N):
    a = len(list([x for x in A_i if x == (i+1)]))
    if (K-Q+a) > 0:
        print('Yes')
    else:
        print('No')


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

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

for i in range(N):
    if (K-Q+S_i[i]) > 0:
        print('Yes')
    else:
        print('No')
# Original solution
def main():
    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 range(n):
        print(('Yes' if a[i]>0 else 'No'))




if __name__ == '__main__':
    main()

# Optimized solution
def main():
    import sys
    n,k,q=list(map(int,input().split()))
    if k-q>0:
        for i in range(n):
            print('Yes')
        sys.exit()

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

if __name__ == '__main__':
    main()
# Original solution
n,k,q=list(map(int,input().split()))

al=[int(eval(input())) for i in range(q)]
pointl=[k for i in range(n)]

for i in range(q):
  pointl=[point-1 for point in pointl]
  pointl[al[i]-1]+=1
  #print(pointl)
#print(pointl)
for p in pointl:
  if p <= 0:
    print("No")
  else :
    print("Yes")

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

#al=[int(input()) for i in range(q)]
d={}
for i in range(q):
  s=int(eval(input()))
  if not s in list(d.keys()):
    d[s]=1
  else :
    d[s]+=1
#print(d)

pointl=[k-q for i in range(n)]

for k,v in list(d.items()):
  pointl[k-1]+=v
for p in pointl:
  if p <= 0:
    print("No")
  else :
    print("Yes")
# Original solution
n,k,q=list(map(int,input().split()))

pointl=[k-q for i in range(n)]

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

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

# Optimized solution
#n=int(input())
n,k,q=list(map(int,input().split()))
#t=int(input())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
windic={i:0 for i in range(1,n+1)}
for i in range(q):
    a=int(eval(input()))
    windic[a]=windic[a]+1

for i in range(1,n+1):
    if k-q+windic[i]>=1:
        print("Yes")
    else:
        print("No")
# Original solution
n,k,q = list(map(int,input().split()))
points = [k for i in range(n)]
winner = [int(eval(input())) for i in range(q)]
# print(points,winner)
for i in range(q):
    # print(i,'番目の問題')
    points = [j-1 for j in points]
    # print(winner[i])
    points[winner[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()))
points = [k for i in range(n)]
winner = [int(eval(input())) for i in range(q)]
points = [i-q for i in points]
for i in range(q):
    points[winner[i]-1] += 1
for i in points:
    if i <= 0:
        print('No')
    else:
        print('Yes')
# Original solution
# -*- coding: utf-8 -*-
n, k, q= list(map(int, input().split()))
a=[k]*n
for i in range(q):
    p = int(eval(input()))
    for j in range(n):
        if (p-1) != j:
            a[j]-=1
for i in range(n):
    if a[i] > 0:
        print("Yes")
    else:
        print("No")

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

ptsList = []
handy = Q - K
for i in range(N):
    ptsList.append(0)
if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i, Ai in enumerate(aList):
        AiPts = ptsList[Ai-1]
        AiPts += 1
        ptsList.pop(Ai-1)
        ptsList.insert(Ai-1, AiPts)

    for i, e in enumerate(ptsList):
        if e > handy:
            print("Yes")
        else:
            print("No")


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

ptsList = [K-Q]*N

if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(eval(input()))-1] += 1

    for i, e in enumerate(ptsList):
        if e > 0:
            print("Yes")
        else:
            print("No")
# Original solution
N,K,Q=list(map(int,input().split()))
A = []
def minus(n):
    return n-1
for _ in range(Q):
    A.append(int(eval(input())))#縦入力
Nlist = []
for i in range(N):
    Nlist.append(K)
for j in range(0,Q):
    Nlist = list(map(minus,Nlist))
    Nlist[A[j]-1] += 1
for k in range(0,N):
    if Nlist[k]>=1:
        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())))#縦入力
Nlist = []
for i in range(N):
    Nlist.append(K-Q)
for j in range(0,Q):
    Nlist[A[j]-1] += 1
for k in range(0,N):
    if Nlist[k]>=1:
        print("Yes")
    else:
        print("No")
# Original solution
N, K, Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)

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

people = []
for i in range(N):
    people.append(K)

for index in A:
    for i, p in enumerate(people):
        if i != index - 1:
            people[i] -= 1

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


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

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

people = []
for i in range(N):
    people.append(K - Q)

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

for i in people:
    if i <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
n, k, q = list(map(int, input().split()))
alist = [int(eval(input())) for i in range(q)]
pts = [k for i in range(n)]

for a in alist:
    for j in range(n):
        if not j == (a-1):
        	pts[j] -= 1

for b in range(n):
    if pts[b] < 1:
        print('No')
    else:
        print('Yes')


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

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

for n in nlist:
    if q - n < k:
        print('Yes')
    else:
        print('No')
# Original solution
N , K , Q = list(map(int,input().split()))
A = [0] * Q
score = [K] * N

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

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

for i in range(N):
  if score[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)]
score = [K-Q] * N
for i in range(Q):
  score[A[i] - 1] += 1

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

# Optimized solution
n, k, q = (int(i) for i in input().split())
t = [0]*n
for i in range(q):
  x= int(eval(input()))-1
  t[x]+=1
for i in range(n):
  print(("Yes" if k>q-t[i] else "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] += 1
for i in b:
    i -= q
    if i <= 0:
        print('No')
    else: print('Yes')




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