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):
import numpy as np

num_of_candidate, start_point, num_of_questions = map(int, input().split())

if start_point > num_of_questions:
	for i in range(num_of_candidate):
		print("Yes")
	exit()


start_points = np.array([start_point for i in range(num_of_candidate)])

got_points = np.array([0 for i in range(num_of_candidate)])
for i in range(num_of_questions):
	winner_id = int(input())
	got_points[winner_id - 1] += 1

lost_points = np.array([num_of_questions for i in range(num_of_candidate)]) - got_points

result_points = start_points - lost_points

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

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

for _p in p:
    if k-(q-_p) > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):

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

Solution (Python):

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

Solution (Python):

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

Solution (Python):

import numpy as np
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')

for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')

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

for n in now:
  print('Yes' if n > 0 else 'No')

Solution (Python):
nkq = input().split()
n = int(nkq[0])
k = int(nkq[1])
q = int(nkq[2])
count_ans = [0 for i in range(n)]
for i in range(q):
	count_ans[int(input())-1] += 1

require_ans = q-k+1
for i in range(n):
	if count_ans[i] < require_ans:
		print('No')
	else:
		print('Yes')

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

Solution (Python):
from collections import defaultdict as dd
N, K, Q = map(int, input().split())
A = []
B = dd(int)
for _ in range(Q):
    a = int(input())
    a -= 1
    A.append(a)
    B[a] += 1



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

Solution (Python):
n,k,q = map(lambda x: int(x), input().split())
a = []
score = [k-q]*n
for i in range(q):
    a.append(int(input()))

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

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

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

init_point = K - Q

contestants = [init_point for i in range(N)]


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


for p in contestants:
    if p<= 0:
        print('No')
    else :
        print('Yes')

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

Solution (Python):
def main():
    import sys
    n,k,q=map(int,input().split())
    if k-q>0:
        for i in range(n):
            print('Yes')
        sys.exit()

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

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    import sys
    n,k,q=map(int,input().split())
    if k-q>0:
        for i in range(n):
            print('Yes')
        sys.exit()

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

if __name__ == '__main__':
    main()

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




if __name__ == '__main__':
    main()

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

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

cnt = [k - q] * n

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

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

Solution (Python):
from collections import Counter

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

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

Solution (Python):
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):
    if Q-a[i]<K:
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):
import numpy as np
N,K,Q=map(int,input().split())
score=np.full(N,K-Q)
for i in range(Q):
  a=int(input())
  score[a-1]+=1
for j in score:
  if j>0:
    print("Yes")
  else:
    print("No")

Solution (Python):
import numpy as np
N,K,Q=map(int,input().split())
score=np.full(N,K)
for i in range(Q):
  a=int(input())
  score[a-1]+=1
for j in score:
  if j-Q>0:
    print("Yes")
  else:
    print("No")

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

Solution (Python):
N,K,Q=map(int, input().split())
A=[int(input()) for i in range(Q)]
from collections import Counter
A=Counter(A)
B=list(A.most_common())

C = [0]*N
for i in B:
  C[i[0]-1]=i[1]
for i in range(N):
  if (Q - C[i])< K:
    print("Yes")
  else:
    print("No")

Solution (Python):
import numpy as np
import sys
inp = sys.stdin.readline

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

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

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

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

for n in range(N):
    num = listq[n]
    ansn = K - Q + num
    if ansn>0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):

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

for j in range(n):
        b[j] += -q

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

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

Solution (Python):
import numpy as np
Nn, Kk, Qq = input().split()
N, K, Q = int(Nn), int(Kk), int(Qq)
a = []
for q in range(Q):
    a.append(int(input()))
result = np.ones(N) * (K - Q)
for i in a:
    result[i-1] += 1
result = result > 0
for r in result:
    if r:
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
def MAP(): return [int(s) for s in input().split()]

if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline

N, K, Q = MAP()
M = [0] * N
for i in range(Q):
	M[int(input())-1] += 1

for m in M:
	print('No' if (K - Q + m) <= 0 else 'Yes')

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

points = [a[1]] * a[0]
points = list(map(lambda x: x - a[2], points))

for result in results:
    points[result - 1] = points[result - 1] + 1


for point in points:
    if point > 0:
        print('Yes')
    else:
        print('No')

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

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

a = [int(input()) for _ in range(q)]
dict = {i:k for i in range(1,n+1)}

for i in range(len(a)):
  dict[a[i]] += 1

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

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

Solution (Python):

import collections
input_list = list(map(int, input().split()))
n = input_list[0]
k = input_list[1]
q = input_list[2]

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

if q-k < 0:
    for i in range(n):
        print("Yes")
else:
    c = collections.Counter(pointed_player)
    c_sorted = sorted(c.items(), key=lambda x: x[1], reverse=True)
    ans_index = []
    for tup in c_sorted:
        if tup[1] > q - k:
            ans_index.append(tup[0])
        else:
            break
    for i in range(n):
        if i in ans_index:
            print("Yes")
        else:
            print("No")

Solution (Python):

import math
import heapq
import bisect

MOD = 10**9+7

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

point = [K-Q]*N

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

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

Solution (Python):
if __name__ == "__main__":
	N,K,Q = map(int,input().split())
	answerList = [input() for i in range(0,Q)]

	pointList = []
	for i in range(0,N):
		pointList.append(K)
		

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

	for i in range(0,N):
		pointList[i] = pointList[i] - (Q)
		

		if pointList[i] <= 0:
			pointList[i] = "No"
		else:
			pointList[i] = "Yes"

	[print(i) for i in pointList]

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

for a in A:
    x = a - Q + K
    if x <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
import collections


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

    answers = []
    for i in range(Q):
        answers.append(int(input())-1)
    counter = collections.Counter(answers)

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):
n,k,q = (int(i) for i in input().split())
d = -q+k
p =[d]*(n+1)


for i in range(q):
    v = int(input())
    p[v] += 1


for i in range(1,len(p)) :
  if 0 < p[i] :
    print("Yes")
  else:
    print("No")

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

for i in range(q):
  x = int(input())
  scores[x-1] += 1
  
for x in scores:
  out = 'Yes' if q - x < k else 'No'
  print(out)

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

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

for score in scores:
    result = 'Yes' if score > thr else 'No'
    print(result)

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

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

ans = [K-Q]*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")

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

Solution (Python):
n,k,q = (int(i) for i in input().split())
a0 = [int(input()) for i in range(q)]
a = sorted(a0)
l = 0
for i in range(1,n+1):
    s = 0
    for j in range(l,q):
        if a[j] > i:
            break
        elif a[j] == i:
            s += 1
            l += 1
        else:
            l += 1
    if k+s-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()))

ans = [k] * n

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

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

Solution (Python):
import numpy as np

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

scores = np.zeros(N, int)
for _ in range(Q):
    i = int(input()) - 1
    scores[i] = scores[i] + 1

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

Solution (Python):
n, k, q = map(int, input().split())
A = []
for _ in range(q):
    a = int(input())
    A.append(a)
    
p = [k-q]*n
for i in range(len(A)):
    val = A[i]-1
    p[val] += 1

for l in range(len(p)):
    if p[l] > 0:
        print('Yes')
    elif p[l] <= 0:
        print('No')

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

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

l = [0]*n

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

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

Solution (Python):
n, shoki, correct = map(int, input().split())
b = list()
for i in range(correct):
    b.append(int(input()))
a = [shoki]*n
a = [i-correct for i in a]
for i in b:
    a[i-1] += 1
for i in range(n):
    if a[i] <= 0:
        print("No")
    else:
        print("Yes")

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

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

for j in A:
    if K-Q+j > 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 = [k] * n

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

point = list(map(lambda x: x - q, point))

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


YES = "Yes"  
NO = "No"  


def solve(N, K, Q, A):
    score = [K + -1 * Q] * N
    for i in range(len(A)):
        score[A[i]] += 1

    for i in range(N):
        if score[i] <= 0:
            print(NO)
        else:
            print(YES)


def main():
    N, K, Q = map(int, input().split())
    A = []
    for i in range(Q):
        A.append(int(input()) - 1)
    solve(N, K, Q, A)


if __name__ == '__main__':
    main()

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

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


P = [K - Q] * N


for _ in range(Q):
    p = int(input())
    P[p - 1] = P[p - 1] + 1


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

Solution (Python):

import sys
import collections













def main():
    n, k, q, *a = [int(x) for x in sys.stdin.read().split()]

    c = collections.Counter(a)
    for i in range(1, n+1):
        if not i in c:
            print('No' if k - q <= 0 else 'Yes')
        else:
            print('No' if k - (q - c[i]) <= 0 else 'Yes')
    

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import numpy

def main():
    n, k, q = (int(x) for x in input().split() )
    
    
    a = [0 for i in range(n)]
    
    for i in range(q):
      ai = int(input())
      a[(ai-1)] = a[(ai-1)] + 1
      
    
    
    
    for i in range( n ):
      if k - q + a[i] > 0:
        print("Yes")
      else:
        print("No")
      
if __name__ == '__main__': main()

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

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

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

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

Solution (Python):
A,K,Q = map(int,input().split())
A_list = [int(input()) for i in range(0,Q)]
A_count =[0]*A
A_flag =[0]*A
for x in A_list:
    A_count[x-1]+=1

for i,x in enumerate(A_count):
    point = K-Q+x
    if point >0:
        A_flag[i] = "Yes"
    else:
        A_flag[i] = "No"
for x in A_flag:
    print(x)

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

p = [k - q] * n

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

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

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

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

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


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

for i in ac_list:
  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)]
B = [k] * n

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



for k in range(n):
    if B[k]-q > 0:
        print('Yes')
    else:
        print('No')

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

main()

Solution (Python):
Str = input().split()
N = int(Str[0]) 
K = int(Str[1]) 
Q = int(Str[2]) 
li = [0 for i in range(N)]

for num in range(Q):
  i = int(input())
  li[i-1] += 1
  
for a in range(N):
  if li[a]>=Q-K+1:
    print('Yes')
  else:
    print('No')

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


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

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

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)

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

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


def main():
    sc = Scan()
    n, k, q = sc.intarr()
    member = [k-q] * n
    for i in range(q):
        member[sc.intarr()[0]-1] += 1

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


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


main()

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

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())


[n,k,q] = inpl()
pcount = defaultdict(int)
for _ in range(q):
    i = inp()
    pcount[i] += 1
    
for _ in range(1,n+1):
    print('Yes' if k-q+pcount[_]>0 else 'No')

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

Solution (Python):
import numpy as np
import sys

n,k,q=map(int, input().split())
p = np.full(n,k-q)

for i in range(q):
    a=int(sys.stdin.readline())
    p[a-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())
points = []
for i in range(n):
	points.append(k-q)
for i in range(q):
	points[int(input())-1]+=1
for i in range(n):
	if points[i]>0:
		print("Yes")
	else:
		print("No")

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

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

Solution (Python):
N,K,Q =  map(int, input().split())
pointList = [0]*N

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

for p in pointList:
    if K-Q+p > 0:
        print('Yes')
    else:
        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(1, N+1):
    print('Yes' if K - Q + C[i] > 0 else 'No')

Solution (Python):
def solve():
    
    N,K,Q = map(int, input().split())
    points = [K-Q]*N
    for _ in range(Q):
        correct_idx = int(input())
        points[correct_idx-1] += 1
        
    print('\n'.join(['Yes' if p>0 else 'No' for p in points]))
    
solve()

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

for li in l:
  if Q - li < K:
    print("Yes")
  else:
    print("No")

Solution (Python):
import numpy as np
import collections

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

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

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

point =[0]*n

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




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

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

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

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

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

Solution (Python):




def calculate(n,k,q,arr):
    result = [k]*n
    for index in range(q):
        result[arr[index] - 1] = result[arr[index] - 1] + 1

    for index in range(len(result)):
        if (result[index] - q) > 0:
            print("Yes")
        else:
            print("No")

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

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

calculate(N,K,Q,arr)

Solution (Python):
N, K, Q = map(int, input().split())
A = [0] * N
B = []

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

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

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

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

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

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

ans = [0] * N

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

for x in ans:
  if x <= Q-K:
    print("No")
  else:
    print("Yes")

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

N, K, Q = [int(x) for x in input().strip().split()]

A = [0] * N

for q in range(Q):
    a = int(input().strip())
    A[a-1] += 1

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

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

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

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

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

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

ans = ['Yes' if points[i] > 0 else 'No' for i in range(N)]
print(*ans, sep='\n')