AtCoder Beginner Contest 141 - Attack Survival

Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.
A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.
When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.
At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.
In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.
For Kizahashi, write a program that determines whether each of the N players survived this game.

-----Constraints-----
 - All values in input are integers.
 - 2 \leq N \leq 10^5
 - 1 \leq K \leq 10^9
 - 1 \leq Q \leq 10^5
 - 1 \leq A_i \leq N\ (1 \leq i \leq Q)

-----Input-----
Input is given from Standard Input in the following format:
N K Q
A_1
A_2
.
.
.
A_Q

-----Output-----
Print N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.

-----Sample Input-----
6 3 4
3
1
3
2

-----Sample Output-----
No
No
Yes
No
No
No

In the beginning, the players' scores are (3, 3, 3, 3, 3, 3).
 - Player 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).
 - Player 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).
 - Player 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).
 - Player 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).
Players 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.

Source: atcoder | Difficulty: EASY


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


(people, point, quiz) = list(map(int, input().split()))
an = [int(input()) for _ in range(quiz)]
each_p = [point - quiz] * people
for x in an:
	each_p[x - 1] += 1
for y in each_p:
	if y <= 0:
		print('No')
	else:
		print('Yes')


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


(n, k, q) = map(int, input().split())
score = [k - q] * n
for i in range(q):
	score[int(input()) - 1] += 1
for i in range(n):
	if score[i] <= 0:
		print('No')
	else:
		print('Yes')


(N, K, Q) = map(int, input().split())
A = [0] * N
for _ in range(Q):
	A[int(input()) - 1] += 1
p = [K - Q] * N
for (a, b) in zip(A, p):
	print('Yes' if 0 < a + b else 'No')


(n, k, q) = map(int, input().split())
a = [int(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')


(N, K, Q) = (int(x) for x in input().split())
S = [K - Q] * N
n = []
for i in range(Q):
	S[int(input()) - 1] += 1
for i in range(N):
	print('Yes' if S[i] > 0 else 'No')


(n, k, q) = (int(i) for i in input().split())
t = [0] * n
for i in range(q):
	x = int(input()) - 1
	t[x] += 1
for i in range(n):
	print('Yes' if k > q - t[i] else 'No')


(N, K, Q) = map(int, input().split())
P = [0] * N
for i in range(Q):
	P[int(input()) - 1] += 1
for i in P:
	if K + i - Q > 0:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
a = [k - q for i in range(n)]
for _ in range(q):
	a[int(input()) - 1] += 1
print(*['Yes' if i > 0 else 'No' for i in a], sep='\n')


(N, K, Q) = map(int, input().split())
scores = [K - Q] * N
for i in range(Q):
	a = int(input())
	scores[a - 1] += 1
for s in scores:
	print(('No', 'Yes')[s > 0])


(N, K, Q) = map(int, input().split())
dct = {}
for _ in range(Q):
	A = int(input())
	if A in dct:
		dct[A] += 1
	else:
		dct[A] = 1
x = Q - K
if x < 0:
	for _ in range(N):
		print('Yes')
else:
	for i in range(1, N + 1):
		if i in dct and dct[i] >= x + 1:
			print('Yes')
		else:
			print('No')


import sys
import copy
import math
import itertools
import numpy as np
l = [int(c) for c in input().split()]
N = l[0]
K = l[1]
Q = l[2]
A = [int(input()) for c in range(Q)]
S = [K] * N
for i in range(Q):
	S[A[i] - 1] += 1
for i in range(N):
	if S[i] - Q > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
M = [K - Q] * N
for q in range(Q):
	a = int(input())
	M[a - 1] += 1
for m in M:
	if m <= 0:
		print('No')
	else:
		print('Yes')


(n, k, q) = map(int, input().split())
p = [k - q] * n
for i in range(q):
	p[int(input()) - 1] += 1
for i in range(n):
	print('YNeos'[p[i] <= 0::2])


(N, K, Q) = map(int, input().split())
L = [0] * N
for i in range(Q):
	A = int(input())
	L[A - 1] += 1
for j in range(N):
	if K - Q + L[j] > 0:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
p = [k - q] * n
for _ in range(q):
	p[int(input()) - 1] += 1
for x in p:
	print('Yes' if x > 0 else 'No')


(n, k, q) = list(map(int, input().split()))
points = [k] * n
for i in range(q):
	player = int(input())
	points[player - 1] += 1
for i in range(len(points)):
	points[i] -= q
	if points[i] > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
getp = [0 for _ in range(N)]
for _ in range(Q):
	A = int(input())
	getp[A - 1] += 1
for i in range(N):
	if K - Q + getp[i] > 0:
		print('Yes')
	else:
		print('No')


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


(N, K, Q, *A) = map(int, open(0).read().split())
L = [K - Q] * N
for a in A:
	L[a - 1] += 1
for l in L:
	print('YNeos'[l < 1::2])


import sys
(n, k, q) = list(map(int, input().split()))
a = [int(input()) for i in range(q)]
if k > q:
	for i in range(n):
		print('Yes')
	return
d = [0] * n
for i in range(q):
	d[a[i] - 1] = d[a[i] - 1] + 1
for j in d:
	if j > q - k:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
l = [K - Q] * N
for n in range(Q):
	A = int(input())
	l[A - 1] += 1
for n in range(N):
	if l[n] <= 0:
		print('No')
	else:
		print('Yes')


(N, K, Q) = map(int, input().split())
l = [0] * N
for i in range(Q):
	a = int(input())
	l[a - 1] += 1
for x in l:
	if x + K - Q >= 1:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
A = [0] * N
for i in range(Q):
	a = int(input())
	A[a - 1] += 1
print('\n'.join(['No' if K - Q + e <= 0 else 'Yes' for e in A]))


(N, K, Q) = map(int, input().split())
res = [K - Q] * N
for i in range(Q):
	ans = int(input()) - 1
	res[ans] = res[ans] + 1
for j in range(N):
	print(('No', 'Yes')[res[j] > 0])


(N, K, Q) = map(int, input().split())
V = [0] * N
for _ in range(Q):
	a = int(input())
	V[a - 1] += 1
for v in V:
	print('Yes' if Q - v < K else 'No')


(N, K, Q) = map(int, input().split())
points = [0] * N
for i in range(Q):
	a = int(input())
	points[a - 1] += 1
for j in range(N):
	if Q - points[j] >= K:
		print('No')
	else:
		print('Yes')


import sys
import math
input = sys.stdin.readline

def inp():
	return int(input())

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

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return list(map(int, input().split()))
(n, k, q) = invr()
ara = [k] * n
for i in range(q):
	x = inp()
	x -= 1
	ara[x] += 1
for i in range(n):
	if ara[i] - q > 0:
		print('Yes')
	else:
		print('No')


import numpy as np
(n, k, q) = map(int, input().split())
a = np.array([k - q] * n)
for i in range(q):
	a[int(input()) - 1] += 1
for i in a:
	if i > 0:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
b = [k - q] * n
for i in range(q):
	a = int(input())
	b[a - 1] += 1
for i in range(n):
	print(['No', 'Yes'][b[i] > 0])


(n, k, q) = map(int, input().split())
ls = [k - q] * n
for _ in range(q):
	a = int(input()) - 1
	ls[a] += 1
for z in ls:
	if z <= 0:
		print('No')
	else:
		print('Yes')


(n, k, q, *a) = map(int, open(0).read().split())
l = [k - q] * n
for i in a:
	l[i - 1] += 1
for i in l:
	print('YNeos'[1 > i::2])


import math
import collections
import itertools

def resolve():
	(N, K, Q) = list(map(int, input().split()))
	A = [0] * Q
	Aans = [0] * N
	for i in range(Q):
		A[i] = int(input())
		Aans[A[i] - 1] += 1
	for i in range(N):
		if 0 >= K - Q + Aans[i]:
			print('No')
		else:
			print('Yes')
resolve()


(n, k, q) = map(int, input().split())
as_ = [int(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')


(n, k, q) = map(int, input().split())
l = [k - q] * n
for _ in range(q):
	l[int(input()) - 1] += 1
for i in l:
	print('YNeos'[i < 1::2])


(N, K, Q, *A) = map(int, open(0).read().split())
ans = [K - Q] * N
for a in A:
	ans[a - 1] += 1
print('\n'.join(('Yes' if v > 0 else 'No' for v in ans)))


def inpl():
	return list(map(int, input().split()))
(N, K, Q) = inpl()
P = [0] * N
for _ in range(Q):
	a = int(input())
	P[a - 1] += 1
for p in P:
	if K - Q + p > 0:
		print('Yes')
	else:
		print('No')


import bisect as bi
(N, K, Q) = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [K] * N
p = 0
for i in range(N + 1):
	A.append(i + 1)
C = sorted(A)
for i in range(N):
	B[i] += bi.bisect_left(C, i + 2) - p - 1
	p = bi.bisect_left(C, i + 2)
for i in range(N):
	if B[i] > Q:
		print('Yes')
	else:
		print('No')


(n, k, q) = [int(i) for i in input().split()]
dic = {}
for i in range(n):
	dic[i] = k
for _ in range(q):
	dic[int(input()) - 1] += 1
for i in range(n):
	if dic[i] - q > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
A = [int(input()) - 1 for _ in range(Q)]
V = [0 for x in range(N)]
for x in A:
	V[x] += 1
for x in V:
	print('Yes' if x > Q - K else 'No')


import collections
(n, k, q) = map(int, input().split())
pt = [int(input()) for i in range(q)]
ans = collections.Counter(pt)
for i in range(n):
	if k - q + ans[i + 1] >= 1:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
b = [k - q] * n
for i in range(q):
	ai = int(input())
	b[ai - 1] += 1
for j in range(n):
	if b[j] > 0:
		print('Yes')
	else:
		print('No')


import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
input = sys.stdin.readline

def RD():
	return input().rstrip()

def F():
	return float(input().rstrip())

def I():
	return int(input().rstrip())

def MI():
	return map(int, input().split())

def MF():
	return map(float, input().split())

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

def TI():
	return tuple(map(int, input().split()))

def LF():
	return list(map(float, input().split()))

def Init(H, W, num):
	return [[num for i in range(W)] for j in range(H)]

def main():
	(N, K, Q) = MI()
	D = [0] * N
	for i in range(Q):
		a = I() - 1
		D[a] += 1
	num = K - Q
	for i in D:
		if num + i > 0:
			print('Yes')
		else:
			print('No')

def __starting_point():
	main()
__starting_point()


(n, k, m) = map(int, input().split())
a = [k] * n
for i in range(m):
	ind = int(input())
	a[ind - 1] += 1
for i in range(n):
	if a[i] > k + (m - k):
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
p = [k - q] * n
for _ in range(q):
	p[int(input()) - 1] += 1
a = ['YNeos'[x < 1::2] for x in p]
for i in a:
	print(i)


(N, K, Q) = list(map(int, input().split()))
ans = [K for _ in range(N)]
for i in range(Q):
	A = int(input())
	ans[A - 1] += 1
ans = list([x - Q for x in ans])
for j in ans:
	if j <= 0:
		print('No')
	else:
		print('Yes')


(n, k, q) = map(int, input().split())
d = [k - q] * n
s = []
for j in range(q):
	d[int(input()) - 1] += 1
for i in range(n):
	if d[i] <= 0:
		print('No')
	else:
		print('Yes')


import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda : int(sys.stdin.readline())
inl = lambda : [int(x) for x in sys.stdin.readline().split()]
ins = lambda : sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print('\x1b[33m', *a, '\x1b[0m', **dict(file=sys.stderr, **kw))

def solve():
	(n, k, q) = inl()
	A = [ini() - 1 for _ in range(q)]
	points = [k] * n
	for a in A:
		points[a] += 1
	for i in range(n):
		points[i] -= q
		print('Yes' if points[i] > 0 else 'No')
solve()


(N, K, Q) = map(int, input().split())
A = [0] * N
for i in range(Q):
	A[int(input()) - 1] += 1
for i in range(N):
	print('YNeos'[A[i] <= Q - K::2])


import numpy as np
(N, K, Q) = map(int, input().split())
A = []
for i in range(Q):
	a = int(input())
	A.append(a)
participant = []
for i in range(N):
	participant.append(K)
participant_arr = np.array(participant)
for i in range(Q):
	participant_arr -= 1
	participant_arr[A[i] - 1] += 1
for i in range(N):
	if participant_arr[i] > 0:
		print('Yes')
	else:
		print('No')


(n, k, q, *l) = map(int, open(0).read().split())
s = [k - q] * n
for i in l:
	s[i - 1] += 1
for i in s:
	print(['No', 'Yes'][i > 0])


from collections import Counter as c
(N, K, Q, *A) = map(int, open(0).read().split())
C = c(A)
for i in range(1, N + 1):
	print('Yes' if K - Q + C.get(i, 0) > 0 else 'No')


(n, k, q) = map(int, input().split())
a = [0] * n
for i in range(q):
	a[int(input()) - 1] += 1
s = sum(a)
for i in range(n):
	print('YNeos'[s - a[i] >= k::2])


(n, k, q) = map(int, input().split())
sc = [k] * n
for i in range(q):
	a = int(input())
	sc[a - 1] += 1
for i in sc:
	ch = i - q
	if ch <= 0:
		print('No')
	else:
		print('Yes')


(N, K, Q) = list(map(int, input().split()))
A_list = []
for _ in range(Q):
	A_list.append(int(input()))
A_cor_list = [0] * N
for a in A_list:
	A_cor_list[a - 1] += 1
for a_cur in A_cor_list:
	if K - (Q - a_cur) > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = list(map(int, input().split()))
A = [0] * N
for i in range(Q):
	A[int(input()) - 1] += 1
for a in A:
	print('Yes' if K - Q + a > 0 else 'No')


(N, K, Q) = map(int, input().split())
score = [K - Q] * N
for i in range(Q):
	temp = int(input())
	score[temp - 1] += 1
for j in score:
	if j > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [K] * N
p = 0
for i in range(Q):
	B[A[i] - 1] += 1
for i in range(N):
	if B[i] > Q:
		print('Yes')
	else:
		print('No')


import numpy as np
(n, k, q) = list(map(int, input().split()))
A = [k for _ in range(n)]
for i in range(q):
	t = int(input())
	A[t - 1] += 1
for i in range(n):
	if A[i] - q > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
p = [K] * N
for i in range(Q):
	a = int(input())
	p[a - 1] += 1
for i in range(N):
	if p[i] > Q:
		print('Yes')
	else:
		print('No')


(N, K, Q) = list(map(int, input().split()))
if K > Q:
	for i in range(N):
		print('Yes')
	return
T = [0 for i in range(N)]
t = Q - K
for i in range(Q):
	a = int(input())
	T[a - 1] += 1
for i in range(N):
	if T[i] > t:
		print('Yes')
	else:
		print('No')


(n, k, q) = [int(x) for x in input().split()]
a = []
for i in range(q):
	a.append(int(input()))
res = [0] * n
for i in range(q):
	res[a[i] - 1] += 1
b = q - k
for i in range(n):
	if res[i] > b:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
a = [k - q] * n
for i in range(q):
	o = int(input())
	a[o - 1] += 1
for s in range(n):
	if a[s] > 0:
		print('Yes')
	else:
		print('No')


import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
(N, K, Q) = map(int, input().split())
scores = [K - Q] * N
for _ in range(Q):
	scores[int(input()) - 1] += 1
for score in scores:
	print('Yes' if score > 0 else 'No')


(n, k, q) = map(int, input().split())
al = [int(input()) - 1 for _ in range(q)]
ansl = [-q + k] * n
for i in al:
	ansl[i] += 1
for i in ansl:
	print('Yes' if i > 0 else 'No')


from collections import Counter
(n, k, q, *a) = map(int, open(0).read().split())
a = Counter(a)
for i in range(1, n + 1):
	print('Yes' if k - q + a[i] > 0 else 'No')


(N, K, Q) = list(map(int, input().split()))
P = [K - Q] * N
for _ in range(Q):
	P[int(input()) - 1] += 1
for p in P:
	print('Yes' if p > 0 else 'No')


(n, k, q) = map(int, input().split())
win = [int(input()) for i in range(q)]
from collections import Counter
winC = Counter(win)
l = [k - q] * n
for (key, value) in winC.items():
	l[key - 1] += value
for j in range(n):
	if l[j] <= 0:
		print('No')
	else:
		print('Yes')


3
import sys
input = lambda : sys.stdin.readline().strip()
(n, k, q) = [int(x) for x in input().split()]
c = [k for i in range(n)]
for _ in range(q):
	c[int(input()) - 1] += 1
for x in c:
	print('Yes' if x > q else 'No')


import sys
input = sys.stdin.readline
import numpy as np

def main():
	(n, k, q) = map(int, input().split())
	points = np.array([k] * n)
	i = 0
	while i < q:
		point = int(input().rstrip())
		points -= 1
		points[point - 1] += 1
		i += 1
	for data in points:
		if data > 0:
			print('Yes')
		else:
			print('No')

def __starting_point():
	main()
__starting_point()


(n, k, q) = map(int, input().split())
start_point = k - q
list = [start_point for i in range(n)]
for i in range(q):
	list[int(input()) - 1] += 1
for i in range(n):
	if list[i] >= 1:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
scores = [K - Q] * N
for _ in range(Q):
	scores[int(input()) - 1] += 1
for score in scores:
	print('Yes' if score > 0 else 'No')


(N, K, Q) = list(map(int, input().split()))
M = []
for i in range(N):
	M.append(K - Q)
for j in range(Q):
	a = int(input())
	M[a - 1] += 1
for k in range(N):
	if M[k] <= 0:
		print('No')
	else:
		print('Yes')


(n, k, q) = map(int, input().split())
p = [k - q] * n
for i in range(q):
	tmp = int(input())
	p[tmp - 1] += 1
for ans in p:
	print('Yes' if ans >= 1 else 'No')


(N, K, Q) = map(int, input().split())
A = [int(input()) for _ in range(Q)]
L = [K - Q] * N
for a in A:
	L[a - 1] += 1
for l in L:
	print('No' if l < 1 else 'Yes')


(N, K, Q) = map(int, input().split())
answers = [K - Q] * N
for _ in range(Q):
	a = int(input())
	answers[a - 1] += 1
for ans in answers:
	if ans > 0:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
a_l = [int(input()) for _ in range(q)]
d = {}
for a in a_l:
	if a in d.keys():
		d[a] += 1
	else:
		d[a] = 1
for i in range(n):
	if i + 1 in d:
		if k - (q - d[i + 1]) > 0:
			print('Yes')
		else:
			print('No')
	elif k - q > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = [int(x) for x in input().split()]
A = [int(input()) for _ in range(Q)]
Point = [Q for _ in range(N)]
for i in range(Q):
	Point[A[i] - 1] -= 1
for i in range(N):
	if K - Point[i] > 0:
		print('Yes')
	else:
		print('No')


def __starting_point():
	(N, K, Q) = map(int, input().split())
	A = [0] * N
	for i in range(Q):
		n = int(input())
		A[n - 1] += 1
	for x in A:
		if K - (Q - x) > 0:
			print('Yes')
		else:
			print('No')
__starting_point()


def resolve():
	(n, k, q) = map(int, input().split())
	ans = [0] * n
	for _ in range(q):
		a = int(input())
		ans[a - 1] += 1
	for i in ans:
		if 0 < k - q + i:
			print('Yes')
		else:
			print('No')
resolve()


(n, k, q) = map(int, input().split())
a = []
for i in range(q):
	A = int(input())
	a.append(A)
ans = [0] * n
for i in range(q):
	ans[a[i] - 1] += 1
for i in range(n):
	if q - k + 1 <= ans[i]:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
l = [K] * N
for i in range(Q):
	s = int(input())
	l[s - 1] += 1
for j in l:
	if j - Q <= 0:
		print('No')
	else:
		print('Yes')


(N, K, Q, *A) = map(int, open(0).read().split())
ans = [K] * N
for a in A:
	ans[a - 1] += 1
for x in ans:
	y = x - Q
	print('Yes' if y > 0 else 'No')


(N, K, Q) = map(int, input().split())
S = [K - Q] * N
for i in range(Q):
	A = int(input())
	S[A - 1] += 1
for s in S:
	if s > 0:
		print('Yes')
	else:
		print('No')


(N, K, Q) = map(int, input().split())
A = [int(input()) for _ in [0] * Q]
S = [0] * N
for a in A:
	S[a - 1] += 1
for s in S:
	print('Yes' if K - Q + s > 0 else 'No')


(N, K, Q) = map(int, input().split())
ans = [0] * (N + 1)
for i in range(Q):
	ans[int(input())] += 1
sum_ans = sum(ans)
for i in range(1, N + 1):
	print('Yes' if K - (sum_ans - ans[i]) > 0 else 'No')


(N, K, Q) = map(int, input().split())
L = [0 for i in range(N)]
for _ in range(Q):
	L[int(input()) - 1] += 1
for l in L:
	if K - Q + l > 0:
		print('Yes')
	else:
		print('No')


(n, k, q) = map(int, input().split())
count_dict = {s: 0 for s in range(1, n + 1)}
for i in range(q):
	seikaisha = int(input())
	if seikaisha in count_dict:
		count_dict[seikaisha] += 1
	else:
		count_dict[seikaisha] = 0
count_dict_sorted = sorted(count_dict.items(), key=lambda x: x[0])
for (i, j) in count_dict_sorted:
	if k + j - q > 0:
		print('Yes')
	else:
		print('No')


(people_num, start_point, correct_num) = map(int, input().split())
table = [start_point] * people_num
for i in range(correct_num):
	correct_person = int(input())
	table[correct_person - 1] += 1
for j in range(people_num):
	table[j] -= 1 * correct_num
for k in range(people_num):
	if table[k] <= 0:
		print('No')
	else:
		print('Yes')


(n, m, k) = map(int, input().split())
j = [m] * n
for i in [int(input()) - 1 for _ in range(0, k)]:
	j[i] += 1
for i in j:
	print('Yes') if i - k > 0 else print('No')


def main():
	(N, K, Q) = list(map(int, input().split()))
	A = [0] * N
	for _ in range(Q):
		tmp = int(input())
		A[tmp - 1] += 1
	for i in range(N):
		if A[i] + K > Q:
			print('Yes')
		else:
			print('No')

def __starting_point():
	main()
__starting_point()


(N, K, Q) = list(map(int, input().split()))
A = [int(input()) for _ in range(Q)]
party = [-Q + K] * N
for a in A:
	party[a - 1] += 1
for p in party:
	if p > 0:
		print('Yes')
	else:
		print('No')


import numpy as np
(n, k, q) = map(int, input().split())
p = np.full(n, k, dtype=np.int)
first = 0
for i in range(q):
	a = int(input())
	p -= 1
	p[a - 1] += 1
for i in p:
	if i <= 0:
		print('No')
	else:
		print('Yes')


(n, k, q) = map(int, input().split())
res = [q - k] * n
a = [int(input()) - 1 for _ in range(q)]
for e in a:
	res[e] -= 1
for e in res:
	print('Yes' if e < 0 else 'No')


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


(n, k, q) = map(int, input().split())
L = list((int(input()) for _ in range(q)))
A = [k - q] * n
for l in L:
	A[l - 1] += 1
for a in A:
	print('Yes' if a > 0 else 'No')


from collections import Counter
(n, k, q) = map(int, input().split())
if k > q:
	[print('Yes') for i in range(n)]
	return
a = [int(input()) for i in range(q)]
A = Counter(a)
ans = ['No'] * n
for i in A:
	if k - q + A[i] > 0:
		ans[i - 1] = 'Yes'
for i in ans:
	print(i)


(N, K, Q) = list(map(int, input().split()))
correct_list = [0] * N
for _ in range(Q):
	correct = int(input())
	correct_list[correct - 1] += 1
for i in range(N):
	print('Yes' if K - Q + correct_list[i] > 0 else 'No')


(N, K, Q) = map(int, input().split())
aa = [0] * N
for _ in range(Q):
	q = int(input()) - 1
	aa[q] += 1
for a in aa:
	print('Yes' if K - (Q - a) > 0 else 'No')


(a, b, c) = map(int, input().split())
d = [b] * a
for i in [int(input()) - 1 for _ in range(0, c)]:
	d[i] += 1
for i in d:
	print('Yes') if i - c > 0 else print('No')


(N, K, Q) = [int(n) for n in input().split()]
l = [0] * N
for i in range(Q):
	l[int(input()) - 1] += 1
ans = ['Yes' if K + v - Q > 0 else 'No' for v in l]
for a in ans:
	print(a)


(n, k, q) = map(int, input().split())
points = [0] * n
for _ in range(q):
	number = int(input())
	points[number - 1] += 1
for i in points:
	if k - (q - i) <= 0:
		print('No')
	else:
		print('Yes')


(n, k, q) = list(map(int, input().split()))
arr = [k - q] * n
for _ in range(q):
	winner_id = int(input()) - 1
	arr[winner_id] += 1
for ele in arr:
	if ele > 0:
		print('Yes')
	else:
		print('No')


(n, k, q) = list(map(int, input().split()))
a = []
count = []
for i in range(q):
	a.append(int(input()))
for i in range(n):
	count.append(0)
for i in range(q):
	count[a[i] - 1] += 1
for i in range(n):
	if k - q + count[i] <= 0:
		print('No')
	else:
		print('Yes')