CodeEff/ECCO huggingface dataset:
# Original solution
import sys
input = sys.stdin.readline
N, K, Q = [int(value) for value in input().split(' ')]
A = [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
import sys
input = sys.stdin.readline
N, K, Q = [int(value) for value in input().split(' ')]
A = [int(eval(input())) for _ in range(Q)]

points = [K - Q] * N

for value in A:
    points[value - 1] += 1

for point in points:
    if point <= 0:
        print('No')
    else:
        print('Yes')
# Original solution
N, K, Q = [int(x) for x in input().strip().split()]
A = [int(input().strip()) for _ in range(Q)]

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

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

dp = {p:0 for p in range(N)}

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

for n in range(N):
  if dp[n] + K - Q > 0:
    print('Yes')
  else:
    print('No')
# Original solution
# 入力
data = input().split()
 
# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])
 
# はじめの各プレイヤのポイント
playerPoint = []
 
for i in range(player):
  playerPoint.append(initPoint)
 
# 問題解答
for i in range(question):
  # 全員のポイントを-1
  playerPoint = [i-1 for i in playerPoint]
  # 正解者
  corrPlayer = int(eval(input()))
  # 正解者のポイントを+1(減らさない)
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  
# 解答
for i in range(player):
  if playerPoint[i] <= 0:
    print('No')
  else:
    print('Yes')

# Optimized solution
# 入力
data = input().split()
 
# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])
 
# 正解しない場合のプレイヤのポイント
playerPoint = []
 
for i in range(player):
  playerPoint.append(initPoint - question)
 
# 問題解答
for i in range(question):
  # 正解者
  corrPlayer = int(eval(input()))
  # 正解者のポイントを+1(減らさない)
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  
# 解答
for i in range(player):
  if playerPoint[i] <= 0:
    print('No')
  else:
    print('Yes')
# Original solution
N,K,Q= [int(s) for s in input().split()]
A = [int(eval(input())) for _ in range(Q)]

temp=[0]*N

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

ans = list([K-(Q-x) for x in temp])

for t in ans:
  if t>0:
    print("Yes")
  else:
    print("No")

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

temp=[0]*N

for i in A:
  temp[i-1]=temp[i-1]+1
ans=[K - (Q- d) for d in temp]

#ans = list(map(lambda x: K-(Q-x), temp))

for t in ans:
  if t>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)]

Point = []

for i in range(N):
    Point.append(K - Q + A.count(i+1))

    if Point[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)]
A = sorted(A)
Acount = 0
j = 0

Point = []

for i in range(N):

    while j != len(A):
        if A[j] == i + 1:
            Acount += 1
            j +=1
        else:
            break

    Point.append(K - Q + Acount)

    Acount = 0

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

    result = [x + y for (x, y) in zip(point, point_add)]

    for i in result[1:]:
        if i <= 0:
            print("No")
        else:
            print("Yes")


if __name__ == '__main__':
    main()


# Optimized solution
def main():
    n, k, q = list(map(int, input().split()))
    point = [0]+[k-q]*n

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

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


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

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

list_A = []

for _ in range(q):
    i = int(eval(input()))
    list_A.append(i)

list_per = [k]*n

for i in list_A:
    i = i -1
    list_per = [x-1 for x in list_per]
    list_per[i] = list_per[i] + 1

for i in list_per:
    if i <=0:
        print("No")

    else:
        print("Yes")


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

list_A = []

for _ in range(q):
    i = int(eval(input()))
    list_A.append(i)

list_per = [0]*n

for i in list_A:
    i = i - 1
    list_per[i] = list_per[i] + 1

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

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

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

arr = [int(k)] * n

for i in range(q):
    q_i = int(eval(input()))

    for j in range(len(arr)):
        arr[j] = arr[j] - 1
    arr[q_i - 1] += 1

for go_or_not in arr:
    if go_or_not > 0:
        print("Yes")
    else:
        print("No")


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

arr = [k - q] * n

for q_i in q_list:
    arr[q_i - 1] += 1

for go_or_not in arr:
    if go_or_not > 0:
        print("Yes")
    else:
        print("No")
# Original solution
a = []
a = input().split()
N = int(a[0])
K = int(a[1])
Q = int(a[2])

A = []

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

Point = [K for i in range(N)]

for i in range(Q) :
  for j in range(N) :
    if j+1 == A[i] :
      Point[j] = Point[j]
    else :
      Point[j] = Point[j] - 1
#  print('Point', Point)

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

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


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

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

point = [K-Q for i in range(N)]

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

for i in range(N) :
  if point[i] > 0 :
    print('Yes')
  else :
    print('No')
# Original solution
# n: 参加者人数
# k: 初期ポイント
# q: ラウント回数
n, k, q = list(map(int, input().split()))
data = [ int(eval(input())) for _ in range(q) ]

table = [k] * n

for winnner in data:
    for j in range(n):
        table[j] -= 1
    
    table[winnner - 1] += 1

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


# Optimized solution
# n: 参加者人数
# k: 初期ポイント
# q: ラウント回数
n, k, q = list(map(int, input().split()))
data = [ int(eval(input())) for _ in range(q) ]

table = [k] * n

for winnner in data:    
    table[winnner - 1] += 1

for j in range(n):
    table[j] -= q

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

correct = []
for _ in range(q):
    a = int(eval(input()))
    correct.append(a)

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

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

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

for p in point:
    if p > 0:
        print("Yes")
    else:
        print("No")
# Original solution
from collections import Counter
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
count_a = Counter(a)

for i in range(1, n+1):
    point = k
    for key, value in list(count_a.items()):
        if key != i:
            point -= value
    if point <= 0:
        print("No")
    else:
        print("Yes")

# Optimized solution
#正解者以外のポイントを1減らすことと、全員のポイントを1減らしてから正解者のポイントだけ1増やすのは同じこと
from collections import Counter
n, k, q = list(map(int, input().split()))
point = k - q
participant = [point] * n
answer = [int(eval(input())) for _ in range(q)]
count_a = Counter(answer)


for key, value in list(count_a.items()):
    participant[key-1] += value

for i in participant:
    if i > 0:
        print("Yes")
    else:
        print("No")
# Original solution
# C - Attack Survival

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

for p in P:
    if 0 < p:
        print('Yes')
    else:
        print('No')


# Optimized solution
# C - Attack Survival

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 0 < K - Q + p:
        print('Yes')
    else:
        print('No')
# Original solution
#!/usr/bin/env python
# coding: utf-8

from collections import Counter

def ri():
    return int(eval(input()))

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    n, k, q = rli()
    ca = Counter()
    for _ in range(q):
        a = ri()
        ca[a] += 1
    for a in range(1, n+1):
        if k + ca[a] - q > 0:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()


# Optimized solution
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(eval(input()))

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def check(s):
    for i in range(len(s)):
        if s[i] != s[len(s)-1-i]:
            return False
    return True

def main():
    n, k, q = rli()
    solve = [0 for _ in range(n+1)]
    for i in range(q):
        a = ri()
        solve[a] += 1
    for i in range(n):
        if k-q+solve[i+1] > 0:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    main()
# Original solution
def resolve():
    n,k,q=list(map(int,input().split()))
    a=[int(eval(input())) for _ in range(q)]
    pnt=[k]*n
    for i in range(q):
        for k in range(n):
            pnt[k]-=1 if k!=a[i]-1 else 0
    for i in range(n):
        print(('Yes' if pnt[i]>0 else 'No'))
resolve()

# Optimized solution
def resolve():
    n,k,q=list(map(int,input().split()))
    a=[int(eval(input())) for _ in range(q)]
    pnt=[k-q]*n
    for i in a:
        pnt[i-1]+=1
    for i in range(n):
        print(('Yes' if pnt[i]>0 else 'No'))
resolve()
# Original solution
N,K,Q = list(map(int,input().split()))
human = [K for i in range(N)]
for i in range(Q):
     p = int(eval(input()))
     human = [human[j]-1 if j != p-1 else human[j] for j in range(N)]
for i in range(N):
    if human[i] <= 0:
        print("No")
    else:
        print("Yes")
    


# Optimized solution
N,K,Q = list(map(int,input().split()))
human_win = [0 for i in range(N)]
win = Q - K

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

for i in range(N):
    if human_win[i] > win:
        print("Yes")
    else:
        print("No")
# Original solution
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]

score=[]
answer=[]

for i in range(N):
    score.append(K)

for j in range(Q):
    for k in range(N):
        if k+1==A[j]:
            pass
        else:
            score[k]-=1


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

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

a=[K-Q]*N

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


for j in a:
    if j>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()))-1)

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

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

for i in range(N):
    if K-Q+S[i]>0:
        print("Yes")
    else:
        print("No")
# Original solution
# 入力の取得(1行目。数値)
i = list(map(int, input().split()))

# 変数セット
# 1.配列[添字=人数、値=初期の点数]
points = [i[1]] * i[0]
# 2.正解数(引数の数)
correntCount = i[2]

# 正解数ループ
for i in range(correntCount):
    correcter = int(eval(input())) - 1    
    #全てを1減算
    points = [ n - 1 for n in points]
    #正解者に1加算(正解者以外を減算するため)
    points[correcter] += 1

# 値が0以下の参加者は敗退(No)、1以上なら勝ち抜け(Yes)
for point in points:
    if point <= 0:
        print("No")
    else:
        print("Yes")

# Optimized solution
# 入力の取得(1行目。数値)
i = list(map(int, input().split()))

# 変数セット
# 1.配列[値=初期の点数-★正解数(解説より)★、個数=人数]
points = [i[1]- i[2]] * (i[0] )
# 2.正解数(引数の数)
correntCount = i[2]

# 正解数ループ
for i in range(correntCount):
    correcter = int(eval(input())) - 1    
    #正解者に1加算
    points[correcter] += 1

# 値が0以下の参加者は敗退(No)、1以上なら勝ち抜け(Yes)
for point in points:
    if point <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
n, k, q = list(map(int, input().split()))
participants = [k for i in range(n)]
a = []

for i in range(q):
    line = eval(input())
    a.append(line)

for i in a:
    for j in range(n):
    	if (int(i)-1) != j:
    		participants[j] -= 1

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

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

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

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

for p in P:
    if Q - p < K:
        print("Yes")
    else:
        print("No")

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

for i in range(1, n + 1):
    if k + (-1)*(q - alist.count(i)) <= 0:
        print('No')
    else:
        print('Yes')

# Optimized solution
n, k, q = map(int, input().split())
alist = [int(input()) for i in range(q)]
ans = [k - q] * n

for Ai in alist:
    ans[Ai - 1] += 1

for Ai in ans:
    print('Yes') if Ai > 0 else print('No')
# Original solution
N, K, Q = list(map(int, input().split()))

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

point_dict = {}
for i in range(1, N+1):
    point_dict[i] = K

for a in acc_list:
    for key, valu in list(point_dict.items()):
        if a != key:
            point_dict[key] = valu - 1

for key, valu in list(point_dict.items()):
    if valu <= 0:
        print('No')
    elif valu > 0:
        print('Yes')


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

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

point_dict = {}
for i in range(1, N+1):
    point_dict[i] = 0

for a in acc_list:
    point_dict[a] += 1

for key, valu in list(point_dict.items()):
    if (K - Q + valu) <= 0:
        print('No')
    elif (K - Q + valu) > 0:
        print('Yes')
# Original solution
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [K] * N
    for i in range(Q):
        q = A[i]
        p = list([x -1 for x in p])
        p[q-1] += 1

    for i in range(N):
        if p[i] > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()


# Optimized solution
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()
# Original solution
N,K,Q = list(map(int, input().split()))
seikaisha = [0 for _ in range(N)]
for _ in range(Q):
  seikaisha[int(eval(input()))-1] += 1
for _ in seikaisha:
  shitten = sum(seikaisha) - _
  if K - shitten > 0:
    print('Yes')
  else:
    print('No')


# Optimized solution
N,K,Q = list(map(int, input().split()))
seikaisha = [0 for _ in range(N)]
for _ in range(Q):
  seikaisha[int(eval(input()))-1] += 1
sum_seikai = sum(seikaisha)
for seikai in seikaisha:
  shitten = sum_seikai - seikai
  if K - shitten > 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 n in range(N):
        print("Yes")
else:
    N_dic={n+1:K for n in range(N)}
    for a in A:
        for k,v in list(N_dic.items()):
            if a!=k:
                N_dic[k]=v-1
    for v in list(N_dic.values()):
        if v>0:
            print("Yes")
        else:
            print("No")

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

for i in a:
    for j in range(1,N + 1):
        if i == j:
            b[j - 1] += 1
for i in b:
    if i > Q - K:
        print('Yes')
    else:
        print('No')






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

for i in a:
    b[i - 1] += 1
for i in b:
    if i > Q - K:
        print('Yes')
    else:
        print('No')
# Original solution
n,k,q = list(map(int, input().split()))
nl = [k]*n

a = []
for i in range(q):
    a.append(int(eval(input())))
for j in a:
    nl = list([x - 1 for x in nl])
    nl[j-1] += 1
for k in range(n):
    if nl[k] > 0:
        print("Yes")
    else:
        print("No")

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

lis_A = []
lis_K = [lis_NKQ[1] for i in range(lis_NKQ[0])]

for i in range(lis_NKQ[2]):
    lis_A.append(int(eval(input())))

for i in range(lis_NKQ[2]):
    lis_K = list([x - 1 for x in lis_K])

for i in lis_A:
    lis_K[i - 1] += 1

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


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

lis_A = []
lis_K = [lis_NKQ[1] for i in range(lis_NKQ[0])]
lis_K = list([x - lis_NKQ[2] for x in lis_K])

for i in range(lis_NKQ[2]):
    inp = int(eval(input()))
    lis_A.append(inp)
    lis_K[inp - 1] += 1  

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

     
for i in range(q):
      P[L[i] - 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()))
A=[int(eval(input())) for i in range(q)]
P=[k-q for i in range(n)]

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

for i in range(n):
      if P[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)]
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 = [0] * N
for i in range(Q):
    A[int(eval(input())) - 1] += 1 
for i in range(N):
    if A[i] > Q - K:
        print('Yes')
    else:
        print('No')
# Original solution
n,k,q=(list(map(int,input().split())))
l=[int(eval(input())) for i in range(q)]
y=k-q
for i in range(1,n+1):
    print(("Yes" if y+l.count(i)>0 else "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):
    print(("Yes" if p[i]>0 else "No"))
# Original solution
n,k,q=list(map(int,input().split()))
a=[]
for i in range(q):
    a.append(int(eval(input())))
import collections
c=collections.Counter(a)
c=list(c.items())
p=[0]*n
for i in c:
    p[i[0]-1]=i[1]
line=1-(k-q)
for i in p:
    if i>=line:
        print('Yes')
    else:
        print('No')

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

for i in range(n):
    a=A.count(i+1)
    ans=k-q+a
    if ans>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)]
li=[k-q for i in range(n)]
for i in range(q):
    li[A[i]-1]=li[A[i]-1]+1
for i in range(n):
    if li[i]>0:
        print("Yes")
    else:
        print("No")