import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	n,k,q = map(int,input().split())	
	v = []
	l = []
	# v = list(map(int,input().strip().split()))[0:n]
	for i in range(q):
		p = int(input().strip())
		v.append(p)
	for i in range(n):
		l.append(0)
	for i in v:
		l[i-1] += 1
	# print(l)
	for i in range(n):
		if(l[i] <= q-k):
			print("No")
		else:
			print("Yes")
	# for i in range(n):
	# 	v[i] = -v[i]
	# heapq.heapify(v)
	# for i in range(m):
	# 	x = heapq.heappop(v)
	# 	x = -x
	# 	x = x//2
	# 	heapq.heappush(v,-x)
	# ans = 0
	# for i in range(n):
	# 	ans += (-heapq.heappop(v))
	# print(ans) import heapq heapq t = 1 t 1 def max(a,b):
	if a > b:
		return a
	return b max if a > b:
		return a
	 a > b a b return a a return b b a a b b while t > 0:
	t -= 1
	n,k,q = map(int,input().split())	
	v = []
	l = []
	# v = list(map(int,input().strip().split()))[0:n]
	for i in range(q):
		p = int(input().strip())
		v.append(p)
	for i in range(n):
		l.append(0)
	for i in v:
		l[i-1] += 1
	# print(l)
	for i in range(n):
		if(l[i] <= q-k):
			print("No")
		else:
			print("Yes")
	# for i in range(n):
	# 	v[i] = -v[i]
	# heapq.heapify(v)
	# for i in range(m):
	# 	x = heapq.heappop(v)
	# 	x = -x
	# 	x = x//2
	# 	heapq.heappush(v,-x)
	# ans = 0
	# for i in range(n):
	# 	ans += (-heapq.heappop(v))
	# print(ans) t > 0 t 0 t -= 1 t 1 n,k,q = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split k q v = [] v [] l = [] l [] for i in range(q):
		p = int(input().strip())
		v.append(p)
	 i range(q) range q p = int(input().strip()) p int(input().strip()) int input().strip() ().strip () input strip v.append(p) v.append v append p for i in range(n):
		l.append(0)
	 i range(n) range n l.append(0) l.append l append 0 for i in v:
		l[i-1] += 1
	# print(l)
	 i v l[i-1] += 1 l[i-1] l i-1 i 1 1 for i in range(n):
		if(l[i] <= q-k):
			print("No")
		else:
			print("Yes")
	# for i in range(n):
	# 	v[i] = -v[i]
	# heapq.heapify(v)
	# for i in range(m):
	# 	x = heapq.heappop(v)
	# 	x = -x
	# 	x = x//2
	# 	heapq.heappush(v,-x)
	# ans = 0
	# for i in range(n):
	# 	ans += (-heapq.heappop(v))
	# print(ans) i range(n) range n if(l[i] <= q-k):
			print("No")
		else:
			print("Yes")
	# for i in range(n):
	# 	v[i] = -v[i]
	# heapq.heapify(v)
	# for i in range(m):
	# 	x = heapq.heappop(v)
	# 	x = -x
	# 	x = x//2
	# 	heapq.heappush(v,-x)
	# ans = 0
	# for i in range(n):
	# 	ans += (-heapq.heappop(v))
	# print(ans) l[i] <= q-k l[i] l i q-k q k print("No") print "No" print("Yes") print "Yes" l = [] [] l q = map(int,input().split()) map(int,input().split()) q t -= 1 1 t n,k,q = map(int,input().split()) map(int,input().split()) n t = 1 1 t k,q = map(int,input().split()) map(int,input().split()) k v = [] [] v def max(a,b):
	if a > b:
		return a
	return b def max(a,b):
	if a > b:
		return a
	return b max p = int(input().strip()) int(input().strip()) p
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	n,k,q = map(int,input().split())	
	v = []
	l = []
	# v = list(map(int,input().strip().split()))[0:n]
	for i in range(q):
		p = int(input().strip())
		v.append(p)
	for i in range(n):
		l.append(0)
	for i in v:
		l[i-1] += 1
	# print(l)
	for i in range(n):
		if(l[i] <= q-k):
			print("No")
		else:
			print("Yes")
	# for i in range(n):
	# 	v[i] = -v[i]
	# heapq.heapify(v)
	# for i in range(m):
	# 	x = heapq.heappop(v)
	# 	x = -x
	# 	x = x//2
	# 	heapq.heappush(v,-x)
	# ans = 0
	# for i in range(n):
	# 	ans += (-heapq.heappop(v))
	# print(ans)
