CodeEff/ECCO huggingface dataset:
# Original solution
n,k,q = list(map(int,input().split()))
ans = [0] * n
data = [k] * n
data2 = [0] * n
for i in range(q):
  tmp = int(eval(input()))
  data2[tmp-1] += 1

for i in range(n):
  ans[i] = data2[i] + data[i] - q

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

  

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

for i in range(n):
  data[i]  = data[i] - q

for i in range(n):
  if data[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)]

point = [k - q] * (n + 1)

for x in range(q):
    for y in range(n) :
        if y + 1 == a[x] :
            point[y] += 1

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

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

point = [k - q] * (n + 1)

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

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

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

p = [k for _ in range(n)]

for s in a:
  p = list([x -1 for x in p])
  p[s-1] = p[s-1] + 1

for i in p:
  if i > 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())))

p = [k for _ in range(n)]
p = list([x -q for x in p])
for s in a:
  
  p[s-1] = p[s-1] + 1

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

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

cnt = 0
for j in range(N):
    for k in range(Q):
        if A[k] == j+1:
            cnt += 1
    print(('No' if (Q - cnt) >= K else 'Yes'))
    cnt = 0

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

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

for j in range(N):
    if P[j] > 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 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()))
point = [k]*n
for i in range(q):
  point[int(eval(input()))-1] += 1
for i in range(n):
  if point[i]-q > 0:
    print('Yes')
  else:
    print('No')
# Original solution
   
L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
S=[]
for i in range(Q):
  S.append(int(eval(input())))
S.sort()
for i in range(N):
  num_ans=S.count(i+1)
  point=K-Q+num_ans
  if point>0 :
    print("Yes")
  else:
    print("No")
  S=S[num_ans:]

# Optimized solution
L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
point=[K-Q]*N
for i in range(Q):
  ans=int(eval(input()))
  point[ans-1]+=1
for i in range(N):
  if point[i]>0 :
    print("Yes")
  else:
    print("No")
# Original solution
n,k,q=list(map(int,input().split()))
as_=[int(eval(input())) for _ in range(q)]
for p in range(n):
    if k-q+as_.count(p+1)>0:
        print('Yes')
    else:
        print('No')

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

right_answers = list(int(eval(input())) for _ in list(range(Q)))
indexes = [v-1 for v in right_answers]

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

for i in indexes:
    scores[i] = scores[i]+1
    scores = [w-1 for w in scores]

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


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

right_answers = list(int(eval(input())) for _ in list(range(Q)))
indexes = [v-1 for v in right_answers]

scores = [K-Q for _ in range(N)]

for i in indexes:
    scores[i] = scores[i]+1

for j in scores:
    if j > 0:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int, input().split()))
A = [0]*N
for _ in range(Q):
    q = int(eval(input()))
    A[q-1] += 1

for a in A:
    if K-Q+a>0:
        print('Yes')
    else:
        print('No')

# Optimized solution
import sys
input = sys.stdin.readline
 
def main():
    N, K, Q = list(map(int, input().split()))
    A = [0]*N
    for _ in range(Q):
        q = int(eval(input()))
        A[q-1] += 1

    for a in A:
        if K-Q+a>0:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()
# Original solution
import sys
from collections import Counter
input=sys.stdin.readline

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

ans=[False]*n
for key,v in list(a.items()):
    if k-(q-v)>0:
        ans[key-1]=True

ss=set(a.keys())

for i in range(n):
    if i+1 in ss:continue
    if k-q>0:
        ans[i]=True
    


for e in ans:
    if e:
        print('Yes')
    else:
        print('No')

# Optimized solution
# 2019/09/16
# 解説のやつ
import sys
input=sys.stdin.readline

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

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

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

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

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


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

for s in range(n):
  if a[s]>0:
    print("Yes")
  else:
    print("No")
# Original solution
N=list(map(int,input().split(" ")))
ans=[int(eval(input())) for i in range(N[2])]	

point=[N[1] for i in range(N[0])]
def down(y):
	return y-1
for i in ans:
	point=list(map(down,point))
	point[i-1]+=1
#print(point)
for i in range(N[0]):
	if point[i]>0:
		print("Yes")
	else:
		print("No")

# Optimized solution
N=list(map(int,input().split(" ")))
ans=[int(eval(input())) for i in range(N[2])]	

point=[N[1]-N[2] for i in range(N[0])]

for i in ans:
	point[i-1]+=1
#print(point)
for i in range(N[0]):
	if point[i]>0:
		print("Yes")
	else:
		print("No")
# Original solution
N, K, Q = list(map(int, input().split()))
member = [K] * N
flag = False

for i in range(0, Q):
    n = int(eval(input()))

    for j in range(0, N):
        member[j] = member[j] - 1
    member[n-1] = member[n-1] + 1

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


# Optimized solution
N, K, Q = list(map(int, input().split()))
member = [K] * N
flag = False

for i in range(0, Q):
    n = int(eval(input()))
    member[n-1] = member[n-1] + 1

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

for j in range(N):
  print((("No","Yes")[res[j]>0]))


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

# (Q - 正解数)点減る

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

for p in P:
  if K - (Q - p) > 0:
    print("Yes")
  else:
    print("No")
# Original solution
import sys
import bisect
input = sys.stdin.readline

def main():
    n,k,q = list(map(int,input().split()))
    a=[int(eval(input())) for _ in range(q)]
    point=[k for i in range(n)]
    for i in range(q):
        for j in range(n):
            if(j!=(a[i]-1) and point[j]>0):
                point[j]-=1
    
    for i in range(n):
        if(point[i]>0):
            print("Yes")
        else:
            print("No")

main()

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

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

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

p = [0]*(n+1)

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

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

final = [K-Q for i in range(N)]
add = [Ai.count(i+1) for i in range(N)]

scores = list(map(lambda x, y: x+y, final, add))

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

# Optimized solution
N, K, Q = list(map(int, input().split()))
Ai = list(map(int, [eval(input()) for i in range(Q)]))
 
scores = [K-Q for i in range(N)]
 
for i in range(Q):
    scores[Ai[i] - 1] += 1
    scores = scores
 
for k in range(len(scores)):
    if scores[k] > 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)]

tmp = []
for i in range(N):
    tmp.append(A.count(i+1)) #正解数
# 得点は, 最初の点数 - 他人の正解数
# 他人の正解数は, 問題数 - 自分の正解数
# 得点は, 最初の点数 - 問題数 + 自分の正解数
# 得点 > 0 であれば, "Yes"
for i in range(N):
    if K - Q + tmp[i] > 0:
        print("Yes")
    else:
        print("No")

# Optimized solution
N, K, Q = list(map(int, input().split(" ")))    # N:人数, K:初期スコア, Q:問題数
A = [int(eval(input())) for i in range(Q)]    # 正解者のリスト
B = [0 for i in range(N)]    # 正解数

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

# 得点は, 最初の点数 - 他人の正解数
# 他人の正解数は, 問題数 - 自分の正解数
# 得点は, 最初の点数 - 問題数 + 自分の正解数
# 得点 > 0 であれば, "Yes"
for i in range(N):
    if K - Q + B[i] > 0:
        print("Yes")
    else:
        print("No")
# Original solution
#input
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]

points = [K] * N

for ans in A:
    for i in range(len(points)):
        if ans - 1 == i:
            continue
        points[i] -= 1

for point in points:
    if (point > 0):
        print("Yes")
    else:
        print("No")

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

points = [K-Q] * N

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

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

for i in ans:
    points = [n-1 for n in points]
    points[i] += 1

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

# Optimized solution
N, point, Q = list(map(int, input().split()))
ans = [int(eval(input())) for i in range(Q)]
ans = [n-1 for n in ans]
# participants = [i for i in range(N)]
points = [point for i in range(N)]

points = [n-len(ans) for n in points]

for i in ans:
    points[i] += 1

#print(N, point, Q, ans, points)

for i in range(N):
    if points[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)]
sc = [k] * n

for i in a:
    sc = [j - 1 for j in sc]
    sc[i - 1]+=1
for j in sc:
    print(('Yes' if j > 0 else 'No'))

# Optimized solution
n, k, q = list(map(int, input().split()))
sc = [k - q] * n

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

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

# Optimized solution
n, k, q = list(map(int, input().split()))
pp = [0] * n
for _ in range(q):
    a = int(eval(input()))
    pp[a - 1] += 1
for i in range(n):
    print(('Yes' if k - (q - pp[i]) > 0 else 'No'))
# Original solution
a,b,c = input().split()
n = int(a)
K = int(b)
Q = int(c)
CAList = []
AllP = []
for i in range(0,Q):
    CAList.append(int(eval(input())))

for j in range(0,n):
    AllP.append(K)

for k in range(0,Q):
    box = AllP[CAList[k]-1]
    for l in range(0,n):
        AllP[l] = AllP[l] - 1
    AllP[CAList[k]-1] = box
    
for m in range(0,n):
    if AllP[m] >= 1:
        print('Yes')
    else:
        print('No')

# Optimized solution
a,b,c = input().split()
n = int(a)
K = int(b)
Q = int(c)
CAList = []
AllP = []
for i in range(0,Q):
    CAList.append(int(eval(input())))

for j in range(0,n):
    AllP.append(K-Q)

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

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

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

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

for i in range(q):
    ans = int(eval(input()))
    point[ans-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 _ in range(q)]
a=tuple(a)
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=[]
for i in range(n):
  a.append(k-q)
for i in range(q):
  a[int(eval(input()))-1]+=1
for i in range(n):
  print(('Yes' if a[i]>0 else 'No'))
# Original solution
#!/usr/bin/env python
# -*- coding:utf-8 -*-


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

winner_list = []
for _ in range(Q):
    A_i = int(input().strip())
    winner_list.append(A_i)

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

for A_i in winner_list:
    point_list = [k if i+1 == A_i else k - 1 for i, k in enumerate(point_list)]

is_win = [True if point_list[i] > 0 else False for i in range(N) ]

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


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


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

win_count = [0] * N
for _ in range(Q):
    A_i = int(input().strip())
    win_count[A_i - 1] += 1

is_ok = [True if Q - cnt < K else False for cnt in win_count]

for i in range(N):
    if is_ok[i]:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int, input().split()))
L = []
for i in range(Q):
  L.append(int(eval(input())))
for i in range(N):
 print(("Yes" if K - Q + L.count(i+1) > 0 else "No"))

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

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

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

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

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

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


# Optimized solution
n, k, q = list(map(int, input().split()))
points = [0] * n

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

for i in range(n):
    print(('Yes' if k - q + points[i] > 0 else 'No'))
# Original solution
# -*- coding: utf-8 -*-

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

pts = [k for _ in range(n)]

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

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


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

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


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

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

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


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

# Optimized solution
n, k, q = list(map(int, input().split()))
tokuten = [k-q]*n

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


for i in range(n):
    if tokuten[i] <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
def main():
    n, k, q = [int(x) for x in input().split()]

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

    for pt in pts:
        print(("Yes" if pt > 0 else "No"))

if __name__ == "__main__":
    main()

# Optimized solution
def main():
    n, k, q = [int(x) for x in input().split()]

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

    sum_up = sum(cleared)
    point = [k]*n
    for i in range(n):
        print(("Yes" if k + (cleared[i] - sum_up) > 0 else "No"))


if __name__ == "__main__":
    main()
# Original solution
N,K,Q = list(map(int,input().split(" ")))
score = [0]
for _ in range(N):
    score.append(K)

for _ in range(Q):
    ans = int(eval(input()))
    for i in range(1,N+1):
        if i != ans:
            score[i]-=1

for i in range(1,N+1):
    if score[i] > 0:
        print("Yes")
    else:
        print("No")

# Optimized solution
N,K,Q = list(map(int,input().split(" ")))
score = [0]
for _ in range(N):
    score.append(K)

for _ in range(Q):
    ans = int(eval(input()))
    score[ans] +=1

for i in range(1,N+1):
    if score[i] > Q:
        print("Yes")
    else:
        print("No")
# Original solution
# -*- coding: utf-8 -*-
def main():
    N,K,Q = list(map(int,input().split()))
    A=[int(eval(input())) for i in range(Q)]
    Ns = []
    for _ in range(N):
        Ns.append(0)
    for i in A:
        Ns[i-1] += 1
    for j in range(N):
        if K<=sum(Ns)-Ns[j]:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()

# Optimized solution
# -*- coding: utf-8 -*-
def main():
    N,K,Q = list(map(int,input().split()))
    A=[int(eval(input())) for i in range(Q)]
    Ns=[0 for i in range(N)]
    for i in A:
        Ns[i-1] += 1
    SUM = sum(Ns)
    for j in range(N):
        if K<=SUM-Ns[j]:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()
# Original solution
N , K , Q = list(map(int , input().split()))
point = [K] * N
for _ in range(Q):
    answer = int(eval(input()))
    point = list([x - 1 for x in point])
    point[answer - 1] += 1
for i in range(N):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")


# Optimized solution

N , K , Q = list(map(int , input().split()))
point = [K] * N
for _ in range(Q):
    answer = int(eval(input()))
    point[answer - 1] += 1
point = list([x - Q for x in point])
for i in range(N):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")
# Original solution
#ABC-141-C
N, K, Q = list(map(int, input().split()))
point_list = [K] * N
seikai_list = [0] * N

for _ in range(Q):
    Ai = int(eval(input()))
    seikai_list[Ai-1] += 1
    
for i in range(N):
    final_point = point_list[i] - Q + seikai_list[i]
    if final_point > 0:
        print("Yes")
    else:
        print("No")

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

memo = [-(Q-K)] * N

for _ in range(Q):
    A = int(eval(input()))
    memo[A-1] += 1

for num in memo:
    if num > 0:
        print("Yes")
    else:
        print("No")
# Original solution
import collections

def main():
    n,k,q = [int(x) for x in input().split()]
    a = []
    for i in range(q):
        a.append(int(eval(input())))

    c = collections.Counter(a)

    for i in range(n):
        index = int('{}'.format(i+1))
        point = k + c[index] - q
        if point > 0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()


# Optimized solution
import math


def main():
    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 score:
        if i>0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()
# Original solution
N,K,Q = list(map(int, input().split()))
 
A = []
 
for _ in range(Q):
    A.append(int(eval(input())))
	
P = [K] * N
 
r = 0
 
for i in range(0,len(A)):
	r = A[i] - 1
	P[r] += 1
	P = list([x-1 for x in P])
	
for i in range(0,len(P)):
	if P[i] > 0:
		print("Yes")
	else:print("No")

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

P = [0] * N


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


for j in range(0,len(P)):
	if K - Q + 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)]
b = [k]*n
for i in a:
    b = [b[j] if i-1==j else b[j]-1 for j in range(n)]
for i in b:
    print(('Yes' if i>0 else 'No'))

# Optimized 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
for i in b: print(('Yes' if i>q else 'No'))
# Original solution
N, K, Q = list(map(int, input().split()))
charanger_list = [K] * N
answer_list = []

# 正答者を記録
for i in range(Q):
	answer_list.append(int(eval(input())) - 1)

# 点数計算
for answer in answer_list:
	charanger_list = [ charanger-1 for charanger in charanger_list]
	charanger_list[answer] += 1

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

# Optimized solution
N, K, Q = list(map(int, input().split()))
charanger_points = [K] * N
gained_points = [0] * N

# 正答者を記録
for i in range(Q):
	gained_points[int(eval(input())) - 1] += 1

# 点数計算
for i in range(N):
	charanger_points[i] -=  Q - gained_points[i]

# 提示
for i in range(N):
	print(('Yes' if charanger_points[i] > 0 else 'No'))