Problem:
 Score: 300 points    Problem Statement  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 1 6 3 4
3
1
3
2      Sample Output 1 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.       Sample Input 2 6 5 4
3
1
3
2      Sample Output 2 Yes
Yes
Yes
Yes
Yes
Yes       Sample Input 3 10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9      Sample Output 3 No
No
No
No
Yes
No
No
No
Yes
No

Solution (Python):
N, K, Q = map(int, input().split())

A = [0]*Q
for i in range(Q):
    A[i] = int(input())

B = [0]*N

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


for i in range(N):
    if K - (Q - B[i]) > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
n,k,q = map(int,input().split())
point = [k-q for i in range(n)]
for i in range(q):
    ans = int(input())
    point[ans - 1] = point[ans - 1] + 1
for i in range(n):
    if point[i] < 1:
        print("No")
    else:
        print("Yes")

Solution (Python):




n, k, q = map(int, input().split())
a = [0] * n
for i in range(q):
    wka = int(input())
    a[wka-1] = a[wka-1] + 1


for i in range(n):
    if k - (q - a[i]) > 0:
        ans = "Yes"
    else:
        ans = "No"
    print(ans)

Solution (Python):
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
c = collections.Counter(A)
for i in range(1, 1+n):
  m = q - c.get(i, 0)
  
  print('Yes' if (k-m) > 0 else 'No')

Solution (Python):
n,k,q=map(int,input().split())

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

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

Solution (Python):
def main():
    N, K, Q = (int(i) for i in input().split())
    A = [int(input()) for _ in range(Q)]
    P = [0 for i in range(N)]
    winner = -1
    for a in A:
        P[a-1] += 1
    for i in range(N):
        if K - (Q - P[i]) <= 0:
            print("No")
        else:
            print("Yes") 

if __name__ == "__main__":
    main()

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

Solution (Python):
def main():
    N,K,Q=map(int,input().split())
    C=[0]*N
    P=[0]*N
    for j in range(Q):
        idx=int(input())-1
        C[idx]+=1

    for i in range(N):
        P[i]=K-Q+C[i]
        if P[i]>0:
            print("Yes")
        else:
            print("No")

main()

Solution (Python):
def main():
    [N, K, Q] = [int(num) for num in input().split()]
    A = []
    for i in range(Q):
        A.append(int(input()))

    points = [K - Q] * N
    for a in A:
        points[a - 1] += 1
    for p in points:
        if p > 0:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

Solution (Python):
z = list(map(int, input().split()))
n = z[0]
k = z[1]
q = z[2]

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

	
for i in range(n):
	p.append(k-q)


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

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

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

Solution (Python):
N,K,Q=map(int,input().split())
ans=[K+(-1)*Q]*N
for _ in range(Q):
    who=int(input())
    ans[who-1]+=1

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

Solution (Python):
S = list(map(int, input().split()))
N = S[0]
K = S[1]
Q = S[2]

point = [K] * N
A = []
for q in range(Q):
    A.append(int(input()) - 1)

for a in A:
    point[a] += 1

for ans in point:
    if ans <= Q:
        print("No")
    else:
        print("Yes")

Solution (Python):
n,k,q = list(map(int, input().split()))
a = [0]*n
for i in range(q):
    tmp = int(input())
    a[tmp-1] += 1

b = ["No"]*n
    

for i in range(n):
    if k - q + a[i] > 0 :
        b[i] = "Yes"

for i in range(n):
    print(b[i])

Solution (Python):
n, k, q = map(int, input().split())
scores = [0] * n
for i in range(q):
    a = int(input())
    scores[a - 1] += 1

for j in range(n):
    if scores[j] <= q- k:
        print("No")
    else:
        print("Yes")

Solution (Python):
import numpy as np
n, k, q = map(int, input().split())

l=[]
for i in range(q):
    x = int(input())
    l.append(x)

p = np.array([k - q] * n)
pp = np.array([0] * n)

for i in range(q):
    index = l[i] - 1
    pp[index] += 1

xx = p + pp

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

Solution (Python):
n, k, q = map(int, input().split())
points = [0]*n

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

for i in range(n):
    print("Yes" if points[i] > q - k else "No")

Solution (Python):
import sys


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

isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
from collections import defaultdict

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

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

res = ['Yes'] * n


for i in range(1, n+1):
    if i in a:
        if k - q + a[i] <= 0:
            res[i-1] = 'No'
        else:
            res[i-1] = 'Yes'
    else:
        if k - q <= 0:
            res[i-1] = 'No'
        else:
            res[i-1] = 'Yes'

for boo in res:
    print(boo)

Solution (Python):
N, K, Q = map(int, input().split())
A = [0]*N
for _ in range(Q):
    q = int(input())
    A[q-1] += 1

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

Solution (Python):
import collections as cl








N,K,Q = map(int, input().split())
A_list = []
for i in range(Q) :
    A_list.append(int(input()))

c = cl.Counter(A_list)



for user in range(1,N+1) :
    atari = c[user]
    
    
    
    if (K-(Q-atari) > 0) :
        print("Yes")
    else :
        print("No")

Solution (Python):
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")

Solution (Python):
import numpy as np

n, k, q = map(int, input().split())
Ans = [int(input()) for i in range(q)]
L = np.array([int(k-q) for i in range(n)], dtype=int)

for i in range(q):
  L[Ans[i]-1] += 1
L = L > 0

for i in range(n):
  if L[i] == False:
    print("No")
  else:
    print("Yes")

Solution (Python):
n,k,q = map(int, input().split( ))
a = []
for _ in range(q):
    inp = int(input())
    a.append(inp)

Q = [0]*(n+1)

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

for i in range(1,n+1):
    if k-q+Q[i]>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
input = sys.stdin.readline
n,k,q = map(int,input().split())
score = [k-q]*n
for i in range(q):
  a = input().strip()
  score[int(a)-1] += 1
for j in score:
  if j > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):



N, K, Q = map(int, input().split())
A = list()
for _ in range(Q):
    A.append(int(input()))


ans = [K - Q] * N
for i in range(Q):
    ans[A[i] - 1] += 1


for i in range(N):
    if ans[i] <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
n, k, q = map(int, input().split())
src = [int(input()) for _ in range(q)]
base = k-q
lis = [base]*n


for s in src:
    lis[s-1] += 1
for l in lis:
    print('Yes' if l>0 else 'No')

Solution (Python):

N, K, Q = map(int, input().split())
A_list = [K - Q] * N

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

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

Solution (Python):
n, k, q = (int(i) for i in input().split())

score = [0] * n

for i in range(q):
    score[int(input())-1] += 1
for i in range(n):
    if score[i] <= q - k:
        print("No")
    else:
        print("Yes")

Solution (Python):
n, k, q = map(int, input().split())
score = [k-q]*n

for i in range(q):
  a = int(input())
  score[a-1] += 1
  
for i in range(n):
  if score[i] > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):
n, k, q = map(int, input().split())
a = [k-q] * n
for s in range(q):
	t = int(input())
	a[t-1] += 1
for u in range(n):
	if a[u] > 0:
		print("Yes")
	else:
		print("No")

Solution (Python):
import numpy as np
from collections import Counter
n, k, q = list(map(int, input().split()))
A = Counter([int(input()) for i in range(q)])
points = (np.ones(n) * k) - q
for k, v in A.items():
  points[k-1] += v
for p in points:
  if p > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):
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')

Solution (Python):


def ans() :
    n, k, q  = map(int, input().split())
    ans = [k - q for i in range(n)]
    for i in range(q) :
        a = int(input())
        ans[a - 1] += 1

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

if __name__ == '__main__':
    ans()

Solution (Python):
import collections
n, k, q = map(int,input().split())
a = [int(input()) for i in range(q)]
c = collections.Counter(a)
for i in range(1, n+1):
    if k - (q-c[i]) > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k, q = map(int, input().split())
S = [k-q]*n
for i in range(q):
    j = int(input())
    S[j-1] += 1

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

Solution (Python):
import sys
sys.setrecursionlimit(int(1e6))

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

scores = [0] * N
for i in range(Q):
    j = int(input()) - 1
    scores[j] += 1

max_score = max(scores)

for s in scores:
    score = K - (Q - s)
    if score <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
from collections import Counter

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

cnt = Counter(a)



for i in range(1,n+1):
    if (k-q+cnt[i]>0):
        print('Yes')
    elif(k-q+cnt[i]<0):
        print('No')
    else:
        print('No')

Solution (Python):
from collections import Counter
N,K,Q=map(int,input().split())
A=[int(input()) for i in range(Q)]
C = Counter(A)
for i in range(N):
    count = C[i+1]
    if K-(Q-count) >0:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k, q = map(int, input().split())
aq = []
for i in range(0, q):
    aq.append(input())

scores = {}
for i in range(1, n + 1):
    scores[str(i)] = 0

for ok_num in aq:
    scores[ok_num] = scores[ok_num] + 1

for i in range(1, n + 1):
    score = scores[str(i)]
    if score + k - q > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N,K,Q=map(int,input().split())
A=[]
for i in range(Q):
  A.append(int(input()))
           
point=[0]*N
for i in A:
  point[i-1]+=1
  
for i in point:
  if K+i-Q>0:
    print("Yes")
  else:
    print("No")

Solution (Python):
n, k, q = map(int, input().split())
points = [0 for _ in range(n + 1)]
for i in range(q):
    answer = int(input())
    points[answer] += 1
for i in range(1, n + 1):
    if (points[i] + k - q) > 0:
        print("Yes")
    else:
        print('No')

Solution (Python):
s = input().split()
N = int(s[0])
K = int(s[1])
Q = int(s[2])

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


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

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

Solution (Python):

N,K,Q = map(int,input().split())

S = []
for _ in range(Q):
    S.append(input())


A = [0]*N

for i in range(len(S)):
    A[int(S[i])-1] += 1

for i in range(N):
    if K-Q+A[i] >0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
N,K,Q=map(int, input().split())
S=[0]*N
for _ in range(Q):
    S[int(input())-1]+=1

for i in range(N):
    if K-Q+S[i]>0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):
n, k, q = map(int, input().split())
a = []
for _ in range(q):
    a.append(int(input()))



points = {i:0 for i in range(n)}


for ai in a:
    points[ai-1] += 1

for i in range(n):
    if k - q + points[i] > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
def main():
  n, k, q = map(int, input().split(' '))
  al = [int(input()) for _ in range(q)]
  ks = [k - q for _ in range(n)]
  for a in al:
    ks[a-1] += 1
  ans = list(map(convert, ks))
  print('\n'.join(ans))


def convert(k):
  return 'Yes' if k > 0 else 'No'


if __name__ == '__main__':
  main()

Solution (Python):
import sys
input = sys.stdin.readline

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

tmplist = [0 for i in range(n)]
tmp = q-k
for i in a:
  tmplist[i-1] += 1

for i in tmplist:
  if i > tmp:
    print('Yes')
  else:
    print('No')

Solution (Python):
n,k,q = list(map(int, input().split()))
lst = []
dct = {}
for _ in range(q):
  num = int(input())
  if num in dct:
    dct[num] += 1
  else:
    dct[num] = 1
for i in range(n):
  person = i + 1
  if person in dct:
    a = dct[person]
  else:
    a = 0
  if k - q + a > 0:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
n, k, q = map(int, input().split())
p = [k]*n
a = []
ans = ['No'] * n
counts = {}

for i in range(q):
    a.append(int(input()))

for i in range(len(a)):
    key = a[i]
    if key in counts:
        counts[key] += 1
    else:
        counts[key] = 1

for key, value in counts.items():
    idx = key - 1
    p[idx] += value


for i in range(len(p)):
    p[i] -= q

for i in range(len(p)):
    if p[i] > 0:
        ans[i] = 'Yes'






for i in range(len(ans)):
    print(ans[i])

Solution (Python):
NKQ = list(map(int, input().split()))
A = [int(input()) for i in range(NKQ[2])]




apps = [0] * NKQ[0]

senzai = len(A)

for s in range(len(A)):
    apps[A[s]-1] += 1

for b in range(len(apps)):
    point = NKQ[1] - senzai + apps[b]
    if point <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
N,K,Q=map(int,input().split(" "))
A=[]
for _ in range(Q):
    A.append(int(input()))

ans=[K for _ in range(N)]
for q in A:
    ans[q-1]+=1
for a in ans:
    if a>Q:
        print("Yes")
    else:
        print("No")

Solution (Python):
rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())

def solve(N,K,Q,A):
    score = [K] * N
    tot = 0
    for a in A:
        a -= 1
        score[a] += 1
        tot += 1
    ans = []
    for i, s in enumerate(score):
        if s-tot > 0:
            ans.append('Yes')
        else:
            ans.append('No')
    return ans


N, K, Q = rrm()
A = [ rri() for _ in xrange(Q) ]
ans = solve(N,K,Q,A)
for row in ans:
    print row

Solution (Python):
inl = input().split(' ')
num = int(inl[0])
k = int(inl[1])
q = int(inl[2])

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

s = [0]*num

for ans in a:
	s[ans] += 1

for score in s:
	result = k-(q-score)
	if result < 1:
		print('No')
	else:
		print('Yes')

Solution (Python):
n, k, q = map(int, input().split())
l = [int(input())-1 for _ in range(q)]
score = [k-q] * n

for m in l:
    score[m] += 1

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

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

Solution (Python):
n, k, q = map(int, input().split())


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


required_ans_num = q - k + 1

for i in range(n):
    if ans_num_list[i] >= required_ans_num:
        print('Yes')
    else:
        print('No')

Solution (Python):
(N, K, Q) = map(int, input().split())
A = []
for _ in range(Q):
  A.append(int(input()))

l = K-Q
points = [l for _ in range(N)]
for a in A:
  points[a-1] += 1
  
for k in ["Yes" if point>0 else "No" for point in points ]:
  print(k)

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

Solution (Python):
N,K,Q = list(map(int, input().split()))
c_nums = [int(input()) for i in range(Q)]
A_points = [K - Q for i in range(N)]

for i in c_nums:
  A_points[i-1] += 1


print('\n'.join(['Yes' if i > 0 else 'No' for i in A_points]))

Solution (Python):
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

l = [k-q]*n

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

Solution (Python):
N, K, Q = map(int,input().split())

point =[0]*N

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

for ii in range(N):
    if K + point[ii] - Q > 0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
n, k ,q = map(int, input().split())
p = [k for i in range(n)]
for i in range(q):
    col = int(input())
    p[col-1] += 1
for i in range(n):
    if p[i] - q > 0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):
import numpy as np

NKQ=np.array(input().split(),dtype=np.int32)

N=NKQ[0]
K=NKQ[1]
Q=NKQ[2]

score=[K]*N
score=np.array(score,dtype=np.int32)

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

A=np.sort(A)

score=score-Q

for i in A:
    score[i]+=1
    

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

Solution (Python):





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






correct_answer_nums = {}
for i in range(Q):
    who = int(input()) - 1  
    current = correct_answer_nums.get(who, 0)
    correct_answer_nums[who] = current + 1

for i in range(N):
    if 0 < (K - (Q - correct_answer_nums.get(i, 0))):
        print("Yes")
    else:
        print("No")

Solution (Python):


N, K, Q = map(int, input().split())

A = [0]*N
for i in range(Q):
    num = int(input())
    A[num-1] += 1

for i in A:
    if K - (Q-i)>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
n,k,q = map(int,input().split())

joi = [0 for i in range(n+1)]

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

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

Solution (Python):
import collections
N, K, Q = map(int, input().split())
A = list([int(input()) for _ in range(Q)])
c = collections.Counter(A)
for i in range(1,N+1):
    if K - Q + c.get(i,0) <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
NKQ = input().split(' ')
N = int(NKQ[0])
K = int(NKQ[1])
Q = int(NKQ[2])

Bn = [0] * N
for _ in range(Q):
    A = int(input()) 
    Bn[A-1] += 1

for i in range(N):
    if K - Q + Bn[i]  > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]

kaisuu=[0 for i in range(n)]

for i in a:
  kaisuu[i-1]+=1

for i in kaisuu:
  if k-q+i>0:
    print("Yes")
  else:
    print("No")

Solution (Python):
import sys
N,K,Q = (int(x) for x in input().split(" "))
result = [0]*N

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

for i in range(0, len(result)):
    if ((K-Q+result[i])<=0):
        print("No")
    else:
        print("Yes")

Solution (Python):
import collections
N,K,Q=map(int,input().split())
A=[int(input()) for q in range(Q)]
c=collections.Counter(A)
for n in range(N):
    if K-Q+c[n+1]>0:
        print("Yes")
    else:
        print("No")

Solution (Python):

n, k, q = map(int, input().split())
A = []

for i in range(q):
		A.append(int(input()))

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

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


for i in  points:
		if i <= 0:
				print("No")
		else: 
				print("Yes")

Solution (Python):
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]

need_s = q - k + 1

if need_s <= 0:
    for i in range(n):
        print('Yes')
    exit()

a.sort()

per = [0]*(n+1)



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



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

Solution (Python):
n, k, q = map(int, input().split())



scores = [0] * n
for x in range(q):
  ac_person = int(input())
  scores[ac_person - 1] += 1

for x in range(n):
  if scores[x] + k - q > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):
n,k,q = map(int,input().split())
an=[0]*n

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

for i2 in range(n):
    if k-(q-an[i2])>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K, Q = [int(v) for v in raw_input().split()]
points = [0] * N
for n in range(Q):
    A = int(raw_input()) -1
    points[A] += 1
for n in range(N):
    res = K + points[n] - Q
    if res > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
temp = list(map(int, input().split()))
N = temp[0]
K = temp[1]
Q = temp[2]
A = []
anscount = []
for i in range(N):
  anscount.append(0)
for i in range(Q):
  A.append(int(input())-1)
  anscount[A[i]] += 1
      
for i in range(N):
  if(K - Q + anscount[i] >0):
    print("Yes")
  else:
    print("No")

Solution (Python):
import sys
from collections import defaultdict, deque


def main():
    N, K, Q = map(int, input().split())
    Score = [0] * N

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

    for i in range(N):
        if Score[i] > Q - K:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

Solution (Python):
N, K, Q = map(int, input().split())
li = [K]*N
li = list(map(lambda x: x-Q, li))

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

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

Solution (Python):







    


if __name__ == "__main__":

    Input1 = [input() for i in range(1)]
    N,K,Q = list(map(int,Input1[0].split()))
    A = [int(input()) for i in range(Q)]

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

Solution (Python):
N, K, Q = [int(v) for v in raw_input().split()]
points = [0] * N
for n in range(Q):
    A = int(raw_input()) -1
    points[A] += 1
for n in range(N):
    res = K + points[n] - Q
    if res > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys




n,k,q = map(int,input().split())
whocorrect = [int(input()) for _ in range(q)]
points = [0] * n
for who in whocorrect:
        points[who-1] += 1
answer = list(map(lambda x: 'No' if k <= q-x else 'Yes',points))
for a in answer:
        print(a)

Solution (Python):
[N, K, Q] = [int(i) for i in input().split()]
A = [0]*N

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

for i in range(N):
    if K - Q + A[i] > 0:
        print('Yes')
    else:
        print('No')

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

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

Solution (Python):
n, k ,q = map(int,input().split())
A = []
for i in range(n):
    A.append(k)
for i in range(q):
    tmp = int(input()) - 1
    A[tmp] += 1
for i in range(n):
    if A[i] - q <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
Tensu = [K-Q-1] * N

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

for i in range(len(Tensu)):
    if Tensu[i] >= 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
str_list = input().split(' ')
int_list = [int(x) for x in str_list]
N, K, Q = int_list[0], int_list[1], int_list[2]
A = []
for _ in range(Q):
    A.append( int(input()) )
point = [int(K)]*N
import numpy as np
point = np.array(point)
for ii in range(Q):
    point[A[ii]-1] += 1
point -= Q
for ii in range(N):
    if point[ii] <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
N,K,Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
B = [0 for _ in range(N)]
for j in range(Q):
    B[A[j]-1] += 1
for k in range(N):
    if Q-B[k] >= K:
        print('No')
    elif Q-B[k] < K:
        print('Yes')

Solution (Python):
import sys
from collections import Counter
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
sys.setrecursionlimit(10 ** 9)


def main():
    N, K, Q = MAP()
    A = [INT() for _ in range(Q)]
    C = Counter(A)

    for i in range(N):
        if K + C[i+1] - Q > 0: print('Yes')
        else: print('No')


if __name__ == '__main__':
    main()

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

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

Solution (Python):
n,k,q = map(int,input().split())
li = [k-q for i in range(n)]
for i in range(q):
  a = int(input())
  li[a-1] += 1
for i in range(n):
  if li[i] > 0:
    print("Yes")
  else:
    print("No")

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

Solution (Python):
N, K, Q = map(int, input().split())
A = [int(input()) for x 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")
    if Ans[i] <=0:
        print("No")

Solution (Python):
from collections import Counter

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

for i in range(n):
    if k - q + c.get(i + 1, 0) > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):





N, K, Q = [int(i) for i in input().split(" ")]
As = [int(input()) for _ in range(Q)]
buff = [K for _ in range(N)]
for a in As:
  i = a - 1
  buff[i] += 1
for b in buff:
    if b - Q > 0: print("Yes")
    else: print("No")

Solution (Python):
N, K, Q = map(int,input().split())

A = [int(input()) for _ in range(Q) ]

L = [0 for _ in range(N) ]

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

for i in range(N):
    L[i] = K - Q + L[i]
    if(L[i]>0):
        print('Yes')
    else:
        print('No')

Solution (Python):
N, K, Q = map(int, input().split())
A = [K-Q]*N
for i in range(Q):
    a = int(input())
    A[a-1] += 1

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

Solution (Python):
n, k, q = map(int, input().split()) 
start = [k-q] * n 
for i in range(q):
    a = int(input())
    start[a-1] += 1

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

Solution (Python):
N,K,Q = map(int,input().split())
minas = [-Q]*N
A = [int(input()) for _ in range(Q)]
for i in A:
  minas[i-1] += 1
  
for i in minas:
  if  K + i<= 0:
    print("No")
  else:
    print("Yes")

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

Solution (Python):
import sys

def main():
    N,K,Q,*A = map(int, open(0).read().split())

    p = [-Q+K]*N
    for a in A:
        p[a-1] += 1

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

if __name__=='__main__':
    main()

Solution (Python):
N,K,Q = map(int,input().split())
B = [0 for i in range(N)]

for i in range(Q):
  a = int(input())-1
  B[a] += 1
  
for b in B:
  if K-Q+b <= 0:
    print("No")
  else:
    print("Yes")

Solution (Python):
import collections
n,k,q = list(map(int, input().split()))
a = [ int(input()) for _ in range(q)]
cnt = collections.Counter(a)
for i in range(1, n+1):
  if(cnt[i] <= q - k):
    print("No")
  else:
    print("Yes")