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

# 回答者毎の正解数を0で初期化
ns_corrects = [0] * n

for i in range(q):
    # 回答者毎の正解数をカウント
    ns_corrects[int(input())-1] += 1


for j in range(n):
    # 回答者毎に「問題数―正解数=減点数」をカウントし持ち点が無くなれば'No'
    if k - (q - ns_corrects[j]) <= 0:
        print('No')
    else:
        print('Yes') n, k, q = list(map(int, input().split())) n list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split k q ns_corrects = [0] * n ns_corrects [0] * n [0] 0 n for i in range(q):
    # 回答者毎の正解数をカウント
    ns_corrects[int(input())-1] += 1 i range(q) range q ns_corrects[int(input())-1] += 1 ns_corrects[int(input())-1] ns_corrects int(input())-1 int(input()) int input() input 1 1 for j in range(n):
    # 回答者毎に「問題数―正解数=減点数」をカウントし持ち点が無くなれば'No'
    if k - (q - ns_corrects[j]) <= 0:
        print('No')
    else:
        print('Yes') j range(n) range n if k - (q - ns_corrects[j]) <= 0:
        print('No')
    else:
        print('Yes') k - (q - ns_corrects[j]) <= 0 k - (q - ns_corrects[j]) k q - ns_corrects[j] q ns_corrects[j] ns_corrects j 0 print('No') print 'No' print('Yes') print 'Yes' n, k, q = list(map(int, input().split())) list(map(int, input().split())) n k, q = list(map(int, input().split())) list(map(int, input().split())) k ns_corrects = [0] * n [0] * n ns_corrects q = list(map(int, input().split())) list(map(int, input().split())) q
n, k, q = list(map(int, input().split()))

# 回答者毎の正解数を0で初期化
ns_corrects = [0] * n

for i in range(q):
    # 回答者毎の正解数をカウント
    ns_corrects[int(input())-1] += 1


for j in range(n):
    # 回答者毎に「問題数―正解数=減点数」をカウントし持ち点が無くなれば'No'
    if k - (q - ns_corrects[j]) <= 0:
        print('No')
    else:
        print('Yes')