CodeEff/ECCO huggingface dataset:
# Original solution
N,K,Q=list(map(int, input().split()))
M=K-Q
A=[]
for i in range(0,Q):
    A.append(int(eval(input())))
for i in range(0,N):
    if M+A.count(i+1)>0:
        print("Yes")
    else:
        print("No")

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



# Optimized solution
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 a:
    if i>0:
        print("Yes")
    else:
        print("No")
# Original solution
N, K, Q = list(map(int, input().split()))

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

for n in range(N):
    ans = 'No'
    total = sum(P) - P[n]
    if  K - total > 0:
        ans = 'Yes'
    print(ans)


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

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

sumP = sum(P)
for n in range(N):
    ans = 'No'
    total = sumP - P[n]
    if  K - total > 0:
        ans = 'Yes'
    print(ans)
# Original solution
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(eval(input()))

for i in range(Q):
    for j in range(N):
        if j+1 != A[i]:
            P[j] -= 1
            

for i in range(N):
    if P[i] <= 0:
        print("No")
    elif P[i] > 0:
        print("Yes")


# Optimized solution
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(eval(input()))

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

for i in range(N):
    if P[i] - Q <=0:
        print("No")
    if P[i] - Q > 0:
        print("Yes")
# Original solution
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(Q)]
Z=[K for i in range(N)]
for i in A:
    for c in range(N):
        if c==i-1:
            continue
        else:
            Z[c]=Z[c]-1
for t in Z:
    if t<=0:
        print('No')
    else:
        print('Yes')

# Optimized solution
N,K,Q=list(map(int,input().split()))
l=[0 for i in range(N)]
for t in range(Q):
    A=int(eval(input()))
    l[A-1]+=1
for i in range(N):
    if K-(Q-l[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)]
p=[k]*n

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

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

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

for i in range(q):
  p[a[i]-1]+=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):
    _ = int(eval(input()))
    if _ in A:
        A[_] += 1
    else:
        A[_] = 1
for i in range(N):
    try:
        print(('Yes' if 0 < K - Q + A[i+1] else 'No'))
    except KeyError as e:
        print(('Yes' if 0 < K - Q else '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):
    print(('Yes'if K-Q+A[i]>0 else'No'))
# Original solution
n,k,q = list(map(int,input().split()))
a = [0 for  _ in range(q)]
point = [k for _ in range(n)]
for i in range(q):
    a[i] = int(eval(input()))

for i in range(q):
    for j in range(len(point)):
        point[j] -= 1
    point[a[i]-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()))
a = [0 for  _ in range(q)]
point = [0 for _ in range(n)]

for i in range(q):
    a[i] = int(eval(input()))

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

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

# Optimized 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 j in p:
    if 0 < j:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int, input().split()))

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

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

res = []
for i in point_list:
  i -= Q
  res.append(i)

for i in res:
  if i > 0:
    print('Yes')
  else:
    print('No')

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

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

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

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

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

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

for i in point_list:
  i -= Q
  if i > 0:
    print('Yes')
  else:
    print('No')


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

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

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

for i in point_list:
  i -= Q
  if i > 0:
    print('Yes')
  else:
    print('No')
# Original solution
n,k,q = list(map(int,input().split()))
a = [0] * q
for i in range(q):
    a[i] = 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()))
List = [int(eval(input())) for i in range(Q)]
PList=[K-Q]*N
for i in range(0,Q):
    PList[(List[i])-1]+=1
for j in range(0,N):
    if PList[j]>0:
        print("Yes")
    else:
        print("No")
# Original solution
num, point, ques = list(map(int, input().split(" ")))
ans_list = []
point_list = []

for i in range(ques):
    ans_list.append(int(eval(input())))

for i in range(num):
    point_list.append(point)

for ans in ans_list:
    point_list[ans-1]+=1
    for i in range(num):
        point_list[i] -= 1

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

# Optimized solution
num, point, ques = list(map(int, input().split(" ")))
ans_list = []
point_list = []

for i in range(num):
    point_list.append(point)

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

for i in range(num):
    if(point_list[i]-ques<=0):
        print("No")
    else:
        print("Yes")
# Original solution
n, k, q = list(map(int, input().split()))

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

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

for i in range(q):
    for j in range(n):
        if a[i] != j:
            point[j - 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()))

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

point = [0 for _ in range(n)]

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

for i in range(n):
    if k - q + point[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)]

N_K = [K for i in range(N)]
for a in A:
    N_K = [n_k-1 if a-1 != i else n_k for i, n_k in enumerate(N_K)]

for n_k in N_K:
    if n_k <= 0:
        print("No")
    else:
        print("Yes")


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

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

for i in range(N):
    if K-Q+A[i] <= 0:
        print("No")
    else:
        print("Yes")
# Original solution
N,K,Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)

N_point = []

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

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

def calc_hiku(n):
    return n - 1

for i in A:
  N_point = list(map(calc_hiku, N_point))
  N_point[i-1] = int(N_point[i-1]) + 1

for num in N_point:
  if num > 0:
    print('Yes')
  else:
    print('No')

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

N_point = []

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

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

def calc_hiku(n):
    return n - Q

for i in A:
  #N_point = list(map(calc_hiku, N_point))
  N_point[i-1] = int(N_point[i-1]) + 1

N_point = list(map(calc_hiku, N_point))
#N_point_w = list(map(lambda x: x - K, N_point))

for num in N_point:
  if num > 0:
    print('Yes')
  else:
    print('No')
# Original solution
nkq = list(map(int, input().split()))
n, k, q = nkq[0], nkq[1], nkq[2]
attendees = dict()
for i in range(n):
    attendees[i] = k

attendees = [(i, k) for i in range(n)]

respondents = [int(eval(input())) for i in range(q)]

for r in respondents:
    r_index = r - 1
    for a in attendees:
        i, p = a
        if i != r_index:
            attendees[i] = (i, p - 1)

for a in attendees:
    i, p = a
    if p > 0:
        print("Yes")
    else:
        print("No")


# Optimized solution
nkq = list(map(int, input().split()))
n, k, q = nkq[0], nkq[1], nkq[2]
attendees = dict()
for i in range(n):
    attendees[i] = 0

respondents = [int(eval(input())) for i in range(q)]

for r in respondents:
    r_index = r - 1
    attendees[r_index] += 1

for i, p in list(attendees.items()):
    point = p + k - q
    if point > 0:
        print("Yes")
    else:
        print("No")
# Original solution
# AtCoder
N, K, Q = list(map(int, input().split()))
solved = [int(eval(input())) for i in range(Q)]
ilst = [int(K)] * N


def calc_minus(n):
    return n - 1


for i in solved:
    ilst[i-1] += 1
    ilst = list(map(calc_minus, ilst))


for i in ilst:
    if i >= 1:
        print("Yes")
    else:
        print("No")


# Optimized solution
N, K, Q = list(map(int, input().split()))
ilst = [int(K-Q)] * N

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


for i in ilst:
    if i > 0:
        print("Yes")
    else:
        print("No")
# Original solution
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = eval(input())
    y.append(int(ans))
    l += 1

for i in y:
    for n in range(len(plist)):
        if n != i-1:
            plist[n] -= 1

for p in plist:
    if p > 0:
        print("Yes")
    else:
        print("No")


# Optimized solution
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = eval(input())
    y.append(int(ans))
    l += 1

for i in y:
    plist[i-1] += 1

for p in plist:
    if p - int(x[2]) > 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)]
ans = []
def calc(n):
    return n-1
for i in range(n):
  ans.append(k)
for i in range(q):
  ans = list(map(calc, ans))
  ans[a[i]-1]+= 1

for i in range(n):
  if ans[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)]
ans = []
def calc(n):
    return n-q
for i in range(n):
  ans.append(k)
ans = list(map(calc, ans))
for i in range(q):
  ans[a[i]-1]+= 1
for i in range(n):
  if ans[i] <= 0:
    print("No")
  else:
    print("Yes")
# Original solution
n,k,q=list(map(int,input().split()))
a_list=[int(eval(input())) for i in range(q)]
 
for i in range(n):
  if a_list.count(i+1) > q-k:
    print("Yes")
  else:
    print("No")

# Optimized solution
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()))
A = [int(eval(input()))-1 for _ in range(Q)]
Point = [K]*N
for i in range(Q):
    Point[A[i]] += 1
    for j in range(N):
        Point[j] -= 1

for p in Point:
    if p>0:
        print('Yes')
    else:
        print('No')

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

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

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")


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

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")
# Original solution
# ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

sanka = [k]*n

for i in a:
    sanka[i-1] += 1
    for j in range(n):
        sanka[j] -= 1
# print(sanka)

for i in sanka:
    print(('Yes' if i > 0 else 'No'))

# Optimized solution
# ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

sanka = [0]*n

for i in a:
    sanka[i-1] += 1
# print(sanka)

for i in sanka:
    print(('Yes' if i+k-q > 0 else 'No'))
# Original solution
from collections import Counter, defaultdict

n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
C = Counter(A)
d = defaultdict(int)
for key, val in list(C.items()):
    d[key] = k + val - q
for i in range(1, n+1):
    if i not in A:
        d[i] = k-q
for i in range(1, n+1):
    if d[i] <= 0:
        print('No')
    else:
        print('Yes')


# Optimized solution
from collections import Counter

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

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

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

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


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

point = [K] * N
point = [j - Q for j in point]

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

for i in range(N):
    print("Yes") if point[i] > 0 else print("No")
# Original solution
N, K, Q = list(map(int, input().split()))
val = [K]*N
a = []
for i in range(Q):
    num = [int(i) for i in range(N)]
    num.remove(int(eval(input()))-1)
    for j in num:
        val[j] -= 1

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


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

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

for i in range(q):
  tmp = a[i]
  for j in range(len(K)):
    K[j] -= 1
  K[int(tmp)-1] = K[int(tmp)-1]+1
  
for k in range(len(K)):
  if K[k] > 0:
    print("Yes")
  else:
    print("No")

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

for i in range(q):
  tmp = a[i]
  K[int(tmp)-1] = K[int(tmp)-1]+1
  limit += 1
  
for k in range(len(K)):
  if K[k] > limit:
    print("Yes")
  else:
    print("No")
# Original solution
n, k, q = list(map(int, input().split()))

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

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

p = [k] * (n+1)
for i in range(1, n+1):
    for j in range(1, n+1):
        if i != j:
            p[j] -= t[i]

for i in range(1, n+1):
    if p[i] > 0:
        print('Yes')
    else:
        print('No')


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

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

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

p = [0] * (n+1)
for i in range(1, n+1):
    p[i] = k - q + t[i]

for i in range(1, n+1):
    if p[i] > 0:
        print('Yes')
    else:
        print('No')
# Original solution
# coding utf-8
N, K, Q = input().split()
N, K, Q = int(N), int(K), int(Q)

points = [K-Q for _ in range(N)]
for q in range(Q):
    collect = int(eval(input())) - 1
    points[collect] += 1
for p in points:
    if p>0:
        print('Yes')
    else:
        print('No')

# Optimized solution
# coding: utf-8

def reader(N):
    for n in range(N):
        yield eval(input())

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

main()
# Original solution
from collections import deque
list1=list(map(int,input().split()))
N=list1[0]
K=list1[1]
Q=list1[2]

dl=deque()
point=deque()

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

for i in range(Q):
    dl.append(int(eval(input())))

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

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

#正解者順リスト
al = [int(eval(input())) for i in range(q)]

#このリストのindex+1が参加者ナンバーです
#みんなの持ち点
nl = []
for m in range(n):
    nl.append(k)

for r in range(q):
    for x in range(n):
        nl[x] = nl[x]-1
#とりあえず全員、全正解数＊-1点する作業

for y in al:
    nl[y-1] = nl[y-1]+1

for z in nl:
    if z > 0:
        print('Yes')
    else:
        print('No')


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

#正解者順リスト
al = [int(eval(input())) for i in range(q)]

#このリストのindex+1が参加者ナンバーです
#みんなの持ち点
nl = []
for m in range(n):
    nl.append(k-q)

for y in al:
    nl[y-1] = nl[y-1]+1

for z in nl:
    if z > 0:
        print('Yes')
    else:
        print('No')
# Original solution
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
 
p = [K-Q]*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')

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

# 愚直に考えるとO(QN)で間に合わないので、以下のような操作に置き換える
# 開始時点の全員のポイントはK-Qとする
# Q回の正解それぞれに対し、正解者のポイントを1増やす
# するとO(Q+N)で解け、間に合う
p = [K-Q]*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
l = input().split()
N = int(l[0])
K = int(l[1])
Q = int(l[2])


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

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



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

S = [0 for i in range(N)]

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

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


#print S                                                                                               
for i in range(N):
    if S[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)]
s = k - q
if k <= q:
    for i in range(1, n + 1):
        if s + a.count(i) > 0:
            print('Yes')
        else:
            print('No')
else:
    for _ in range(n):
        print('Yes')

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

nl = [k for i in range(n)]

for i in a:
    nl = [j-1 for j in nl]
    nl[i] += 1

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


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

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

for i in a:
    nl[i] += 1

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

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

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

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

# Optimized solution
n, k, q = input().split()
n, k, q = [int(n), int(k), int(q)]
d = dict()
for i in range(0, n):
    d[i+1] = 0

for i in range(0, q):
    A = int(eval(input()))
    d[A] += 1
for i in range(0, n):
    times = d[i+1]
    if (k-q+times)>0:
        print("Yes")
    else:
        print("No")