n, k, q = map(int, input().split())
# n:参加人数
# k:初期ポイント
# q:正解の回数

# 最初のポイント初期化
menber_point = [k for _ in range(n)]

# 正解者リスト
correct_answer = [int(input()) for _ in range(q)]

# 正解したらポイント加算してあげる
for value in correct_answer:
    menber_point[value-1] += 1

# 正解の回数以下なら敗退判定
for mem in menber_point:
    if mem > q:
        print('Yes')
    else:
        print('No') n, k, q = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k q k for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) k menber_point = [k for _ in range(n)] menber_point [k for _ in range(n)] int(input()) for _ in range(q) for _ in range(q) _ range(q) range q for _ in range(q) int(input()) int input() input correct_answer = [int(input()) for _ in range(q)] correct_answer [int(input()) for _ in range(q)] for value in correct_answer:
    menber_point[value-1] += 1

# 正解の回数以下なら敗退判定 value correct_answer menber_point[value-1] += 1 menber_point[value-1] menber_point value-1 value 1 1 for mem in menber_point:
    if mem > q:
        print('Yes')
    else:
        print('No') mem menber_point if mem > q:
        print('Yes')
    else:
        print('No') mem > q mem q print('Yes') print 'Yes' print('No') print 'No' menber_point = [k for _ in range(n)] [k for _ in range(n)] menber_point q = map(int, input().split()) map(int, input().split()) q correct_answer = [int(input()) for _ in range(q)] [int(input()) for _ in range(q)] correct_answer k, q = map(int, input().split()) map(int, input().split()) k n, k, q = map(int, input().split()) map(int, input().split()) n
n, k, q = map(int, input().split())
# n:参加人数
# k:初期ポイント
# q:正解の回数

# 最初のポイント初期化
menber_point = [k for _ in range(n)]

# 正解者リスト
correct_answer = [int(input()) for _ in range(q)]

# 正解したらポイント加算してあげる
for value in correct_answer:
    menber_point[value-1] += 1

# 正解の回数以下なら敗退判定
for mem in menber_point:
    if mem > q:
        print('Yes')
    else:
        print('No')