import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I()
N,K,Q = LI()
A = [I() for _ in range(Q)]

c = collections.Counter(A)
# print(c)

B = np.zeros(N,dtype='int')
for i in range(1,N+1):
    B[i-1] = c[i]

# print(B)
ans = (B - Q + K) > 0
for b in ans:
    # print(b)
    if b:
        print('Yes')
    else:
        print('No')

#A,B = zip(*AB)
# A = np.array(_A)

# B = np.zeros(N)
# B[0:-K+1] = A

# 和 - 自分の得点
# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))
# print(C>-K)

# if ans:
#     print('Yes')
# else:
#     print('No') import bisect,collections,copy,heapq,itertools,math,string bisect collections copy heapq itertools math string import numpy as np numpy from numba import njit import sys sys sys.setrecursionlimit(10**7) sys.setrecursionlimit sys setrecursionlimit 10**7 10 7 def _S(): return sys.stdin.readline().rstrip() _S def I(): return int(sys.stdin.readline().rstrip()) I def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) LI def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I() LS N,K,Q = LI() N LI() LI K Q I() for _ in range(Q) for _ in range(Q) _ range(Q) range Q for _ in range(Q) I() I A = [I() for _ in range(Q)] A [I() for _ in range(Q)] c = collections.Counter(A) c collections.Counter(A) collections.Counter collections Counter A B = np.zeros(N,dtype='int') B np.zeros(N,dtype='int') np.zeros np zeros N dtype='int' dtype 'int' for i in range(1,N+1):
    B[i-1] = c[i]

# print(B) i range(1,N+1) range 1 N+1 N 1 B[i-1] = c[i] B[i-1] B i-1 i 1 c[i] c i ans = (B - Q + K) > 0 ans (B - Q + K) > 0 B - Q + K B - Q B Q K 0 for b in ans:
    # print(b)
    if b:
        print('Yes')
    else:
        print('No')

#A,B = zip(*AB)
# A = np.array(_A)

# B = np.zeros(N)
# B[0:-K+1] = A

# 和 - 自分の得点
# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))
# print(C>-K)

# if ans:
#     print('Yes')
# else:
#     print('No') b ans if b:
        print('Yes')
    else:
        print('No')

#A,B = zip(*AB)
# A = np.array(_A)

# B = np.zeros(N)
# B[0:-K+1] = A

# 和 - 自分の得点
# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))
# print(C>-K)

# if ans:
#     print('Yes')
# else:
#     print('No') b print('Yes') print 'Yes' print('No') print 'No' A = [I() for _ in range(Q)] [I() for _ in range(Q)] A c = collections.Counter(A) collections.Counter(A) c def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) LI Q = LI() LI() Q ans = (B - Q + K) > 0 (B - Q + K) > 0 ans N,K,Q = LI() LI() N def _S(): return sys.stdin.readline().rstrip() def _S(): return sys.stdin.readline().rstrip() _S K,Q = LI() LI() K def I(): return int(sys.stdin.readline().rstrip()) def I(): return int(sys.stdin.readline().rstrip()) I B = np.zeros(N,dtype='int') np.zeros(N,dtype='int') B def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I() def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I() LS
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I()
N,K,Q = LI()
A = [I() for _ in range(Q)]

c = collections.Counter(A)
# print(c)

B = np.zeros(N,dtype='int')
for i in range(1,N+1):
    B[i-1] = c[i]

# print(B)
ans = (B - Q + K) > 0
for b in ans:
    # print(b)
    if b:
        print('Yes')
    else:
        print('No')

#A,B = zip(*AB)
# A = np.array(_A)

# B = np.zeros(N)
# B[0:-K+1] = A

# 和 - 自分の得点
# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))
# print(C>-K)

# if ans:
#     print('Yes')
# else:
#     print('No')