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 = list(map(int, input().split()))
score = [k-q] * n
for i in range(q):
    score[int(input()) - 1] += 1

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

Solution (Python):
N,K,Q=map(int,input().split())
L=[K-Q for i in range(N)]
for _ in range(Q):
  L[int(input())-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())
point = [k-q]*n
for i in range(q):
    answerer = int(input())-1
    point[answerer] += 1
for i in range(n):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import numpy as np
h = list(map(int, input().split()))
ln = []
lost_point = [0]*h[0]
point = [h[1]-h[2]]*h[0]
for i in range(h[2]):
    n = int(input())
    ln.append(n)
for j in range(h[2]):
    lost_point[ln[j]-1]+= 1 
result = np.array(point) + np.array(lost_point)
for k in range(h[0]):
    if result[k] > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import collections

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

    c = collections.Counter(a)

    for i in range(n):
        index = int('{}'.format(i+1))
        point = k + c[index] - q
        if point > 0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

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 i in range(N):
  print('Yes' if point[i]>0 else 'No')

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

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

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

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

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

Solution (Python):
def slove():
    import sys
    import bisect
    import collections
    import fractions
    import heapq
    input = sys.stdin.readline
    n, k, q = list(map(int, input().rstrip('\n').split()))
    a = [int(input().rstrip('\n')) for _ in range(q)]
    ls = [k-q] * n
    for v in a:
        ls[v-1] += 1
    for i in range(len(ls)):
        if ls[i] > 0:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    slove()

Solution (Python):
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
score=[k-q]*n
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=map(int,input().split())

d=[0 for i in range(n)]
for i in range(1,q+1):
    a=int(input())
    d[a-1] +=1

for j in d:
    if k-(q-j) > 0:
        print('Yes')
    else:
        print('No')

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


for  e in p:
    if e >= q-k+1:
        print('Yes')
    else:
        print('No')

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

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

Solution (Python):
import numpy as np
N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
x = np.array([K-Q]*N)
for j in range(Q):
    x[A[j]-1]+=1
for k in range(N):
    if x[k]>=1:
        print('Yes')
    else:
        print('No')

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

Solution (Python):

import sys
import collections

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    d = collections.Counter(A)
    for i in range(N):
        print(YES if K - Q + d[i + 1] > 0 else NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
N,K,Q=map(int,input().split())
l=[0]*N
for _ in range(Q):
    l[int(input())-1]+=1
for i in l:
    if Q-i<K:
        print("Yes")
    else:
        print("No")

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


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


seikai_num = [K-Q] * N

for j in S:
        seikai_num[int(j)-1] += 1



for num in seikai_num:
        if num > 0:
                print("Yes")
        else:
                print("No")

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

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

points_list=[K-Q for j in range(N)]

for k in range(Q):
    points_list[A[k]-1]+=1

for l in range(N):
    if points_list[l]>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())
    point[a-1] += 1

ans = [k] * n
for i, p in enumerate(point):
    ans[i] -= q - p

for a in ans:
    if a > 0:
        print('Yes')
    else:
        print('No')

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

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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = [K-Q] * N

    for answer_id in A:
        answer_id -= 1
        point[answer_id] += 1

    return '\n'.join(list(map(winner_or_loss, point)))


print(solve())

Solution (Python):
import collections
def main():
    li = list(map(int,input().split()))
    respondents = [int(input()) for i in range(li[2])]
    number_of_respondes = respondes_number_of_participants(respondents)
    check_surviver(number_of_respondes,li[0],li[1],li[2])


def respondes_number_of_participants(respondents):
    return collections.Counter(respondents)


def check_surviver(number_of_respondes,number_of_participants,gived_points,number_of_questions):
    for i in range(number_of_participants):
        if number_of_respondes[i+1]:
            if gived_points - number_of_questions + number_of_respondes[i+1] > 0:
                print("Yes")
            else:
                print("No")
        else:
            if gived_points - number_of_questions > 0:
                print("Yes")
            else:
                print("No")

main()

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

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

for i in range(Q):
	A = int(input())
	point[A - 1] = point[A - 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())
lst1 = [K] * N
lst2 = [Q] * N
for _ in range(Q):
    n = int(input()) - 1
    lst2[n] -= 1
for i in range(N):
    if lst1[i] - lst2[i] > 0:
        print('Yes')
    else:
        print('No')

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

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

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

P = [0] * N 
for j in range(Q):
    P[A[j]] +=1
for k in range(N):
    if P[k] > Q - K:
        print("Yes")
    else:
        print("No")

Solution (Python):
N,K,Q=map(int,input().split())
A=[int(input())-1 for _ in range(Q)]
L=[K-Q]*N
for a in A:
    L[a]+=1
for l in L:
    if l>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()))
score = [0]*N
init_score = [K]*N
for i in A:
    score[i-1] += 1
final_score = [init_score[i]-Q+score[i] for i in range(N)]
for i in final_score:
    print("Yes") if i > 0 else print("No")

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

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

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

if Q < K:
    for i in range(N):
        print('Yes')
    sys.exit()
correct_answer_users =[]
for j in range(1,Q+1):
    correct_answer_users.append(int(input()))
user_base_points =[K-Q]*N 
for user in correct_answer_users:
    user_base_points[user-1] += 1
for point in user_base_points:
    if point>0:
        print('Yes')
    else :
        print('No')

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

for i in range(Q):
    num_ans_person = A[i] - 1
    B[num_ans_person] += 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())

A = [K for _ in range(N)]

for _ in range(Q):
    A[int(input())-1] += 1
for i in range(N):
    print("Yes" if A[i] > Q else "No")

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

Solution (Python):
import numpy as np

def main():
    s = input()
    n = int(s.split()[0])
    k = int(s.split()[1])
    q = int(s.split()[2])

    score = np.ones(n + 1) * (k)
    score = score - q

    for _ in range(q):
        answer = input()
        score[int(answer)] = score[int(answer)] + 1

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


if __name__ == '__main__':
    main()

Solution (Python):
from collections import defaultdict

N, K, Q = map(int, input().split(' '))
a = [int(input()) for _ in range(Q)]

num_ans = defaultdict(int)
for i in a:
    num_ans[i-1] += 1

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

Solution (Python):
n, k, q = map(int, input().split(' '))
p_list = [int(input()) for _ in range(q)]
scores = [k for _ in range(n)]
c_num = [0 for _ in range(n)]

if k > q:
    for _ in range(n):
        print('Yes')
else:
    for p in p_list:
        c_num[p-1] += 1
    for i in range(len(scores)):
        scores[i] -= q - c_num[i]
    for s in scores:
        if s > 0:
            print('Yes')
        else:
            print('No')

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

Solution (Python):
from collections import Counter
N, K, Q = map(int, input().strip().split())
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
sumcountl = sum(countl.values())
for i in range(N):
    print('Yes') if sumcountl-countl[i+1] < K else print('No')

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

    all_sum = sum(point_list)

    for point in point_list:
        if k - all_sum + point > 0:
            print('Yes')
        else:
            print('No')

Solution (Python):

n, k, q = list(map(int, input().split()))
tokuten = [0]*n

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

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

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

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

a = [k]*(n+1)

for i in range(q):
    d = int(input())
    a[d]+=1
    
for i in range(1,n+1):
    if(a[i]>q):
        print("Yes")
    else:
        print("No")

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

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

correct = [K-Q] * N

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

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

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

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

Solution (Python):
n,k,q=map(int,input().split())
q1=q
d={}
d1={}
for i in range(1,n+1):
    d[i]=k
    d1[i]=0
while(q!=0):
    d1[int(input())]+=1
    q-=1
for i in range(1,n+1):
    d[i]=(d[i]-(q1-d1[i]))
for i in range(1,n+1):
    if d[i]>0:
        print('Yes')
    else:
        print('No')

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

correct = [K-Q]*N

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

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

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

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

for i in range(n):
  ans[i] = data2[i] + data[i] - q

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

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

Solution (Python):
from collections import deque
N,K,Q=map(int,input().split())
ls=[int(input())-1 for i in range(Q)]
que=deque(ls)
co=[0 for i in range(N)]
for j in range(Q):
  co[que.popleft()]+=1
for i in co:
  if i>Q-K:
    print("Yes")
  else:
    print("No")

Solution (Python):
n,k,q =  map(int,input().split())
scores = [0]*n
b = 0
while b < q:
    ans = int(input()) - 1 
    scores[ans] += 1
    b += 1
for x in scores:
    if k-(q-x) > 0:
        print('Yes')
    else:
        print('No')

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

arr = [k]*n

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

for index, elem in enumerate(arr):
	if (arr[index]-q)<=0:
		print('No')
	else:
		print('Yes')

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

Solution (Python):
import collections
N, K, Q = map(int,input().split())
A = sorted([int(input()) for _ in range(Q)])
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(' '))
a = [0  for i in range(N)]
A = int(Q -K) + 1

for i in range(Q):
  a[int(input()) - 1] += 1
  
for i in a:
  if i >= A:
    print("Yes")
  else:
    print("No")

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

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

lis = [K-Q for _ in range(N)]

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

Solution (Python):
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(n,k-q)
for i in range(q):
  win = int(input())
  point[win-1]+=1
  
  

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

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

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

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

for _ in range(Q):
    A.append(int(input()) - 1)


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

result = list(map(lambda x: x-Q, result))

for i in range(N):
    result[i] += answers[i]

for i in list(map(lambda x: "Yes" if x > 0 else "No", result)):
    print(i)

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


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

for i in participant :
	if i <= 0:
		print('No')
	else:
		print('Yes')

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

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

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

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

Solution (Python):
num_line=input().rstrip().split(" ")

num=int(num_line[0])
firstpoint=int(num_line[1])
times=int(num_line[2])

pointlist=[0 for i in range(num)]


for i in range(times):
    win=int(input())-1
    pointlist[win]+=1


for i in range(num):
    if pointlist[i]>=times-firstpoint+1:
        print("Yes")
    else:
        print("No")

Solution (Python):
n,k,q = map(int,input().split())
score = [k - q]*(n+1)
for i in range(q):
  score[int(input())] += 1
for i in range(1,n+1):
  if score[i] >= 1:
    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]+=1
for i in range(N):
  if K+A[i]>Q:
   print("Yes")
  else:
   print("No")

Solution (Python):
import numpy as np

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

A = list()
while True:
    try:
        A.append(int(input()))
    except EOFError:
        break

scores = np.full((N), K - Q)

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

for score in scores:
    print("Yes" if score > 0 else "No")

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

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

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

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

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

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

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

for i in range (0, N+1):
    B.append(K)

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

for i in range (0, N):
    B[i] -= Q
    if B[i] <= 0:
        print('No')
    else:
        print('Yes')

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

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

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

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

ans = [0] * N
for a in A:
    ans[a - 1] += 1

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

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

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("No")
    else:
        print("Yes")

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

Solution (Python):

import sys
import collections


YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    cc = collections.Counter(A)
    for i in range(N):
        if Q - cc[i+1] < K:
            print(YES)
        else:
            print(NO)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)


if __name__ == '__main__':
    main()

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

Solution (Python):
def t(n, k, q, a):
    p = [-q + k] * n
    for i in range(q):
        p[a[i-1]-1] += 1
    return ["Yes" if i > 0 else "No" for i in p]
   

if __name__ == "__main__":
    n, k, q = map(int, input().split())
    a = [int(input()) for i in range(q)]
    r = t(n, k, q, a)
    for i in r:
        print(i)

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

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

list_seikaisha =[]

for i in range(Q):
    list_seikaisha.append(int(input())-1)

list_pt=[K for i in range(N)]

for seikaisha in list_seikaisha:
    list_pt[seikaisha]=list_pt[seikaisha]+1
list_pt=[x-Q for x in list_pt]

list_YN=[]
f=lambda pt:"Yes" if pt>=1 else "No"
for pt in list_pt:
    print(f(pt))

Solution (Python):
n, k, q = map(int, input().split())
candis = [k] * n
candis = list(map(lambda x: x - q, candis))
for _ in range(q):
    candis[int(input()) - 1] += 1
for score in candis:
    if score <= 0:
        print("No")
    else:
        print("Yes")

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

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

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

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

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

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

Solution (Python):
import sys
 
N, K, Q = [int(n) for n in sys.stdin.readline().strip().split()]
ans_idx = [int(sys.stdin.readline().strip()) for _ in range(Q)]
scores = [0]*N
 
for ai in ans_idx:
  scores[ai-1] += 1
scores = [K-(Q-s) for s in scores]
  
for s in scores:
  print('No' if s<=0 else 'Yes')

Solution (Python):

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

points = [K-Q] * N

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

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

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




ans=[k-q for i in range(n)]
for i in range(q):
    ans[int(input())-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 i in range(Q):
    a = int(input())
    A.append(a)

R = [K-Q] * (N + 1)

for ai in A:
    R[ai] += 1

for ri in R[1:]:
    if ri >= 1:
        print("Yes")
    else:
        print("No")

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

for i in range(Q):
    a = int(input())
    A.append(a)

mn = Q - K + 1
R = [0] * (N + 1)

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



for ri in R[1:]:
    if ri >= mn:
        print("Yes")
    else:
        print("No")

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

Solution (Python):

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

score = [0] * N
score[0] = K
for _ in range(Q):
    A = int(input())
    if A == 1:
        score[1] -= 1
    elif A == N:
        score[0] -= 1
        score[N - 1] += 1
    else:
        score[0] -= 1
        score[A - 1] += 1
        score[A] -= 1

for i in range(1, N):
    score[i] += score[i - 1]

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

Solution (Python):
n,k,q = map(int, input().split())
Q=[]
S=[]
if k>q:
    for i in range(n):
        print("Yes")
else:
    for j in range(q):
        Q.append(int(input()))
    for m in range(n):
        S.append(k)
    for l in range(q):
        S[Q[l]-1]+=1
    for x in range(n):
        S[x]-=q
    for z in range(n):
        if S[z]<=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()) - 1] += 1

counter = 0
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())
points=[k-q]*n
for i in range(q):
  a=int(input())
  points[a-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())

A = [K]*N
C = [0]*N

for r in range(Q):
    correct = int(input())
    C[correct-1] = C[correct-1] + 1

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

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

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

dic = {}

for i in range(N):
    dic[i+1] = 0

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

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

A = [K]*N
C = [0]*N

for r in range(Q):
  correct = int(input())
  C[correct-1] = C[correct-1] + 1

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

Solution (Python):
import numpy as np

n,k,q = input().split()
n = int(n)
k = int(k)
q = int(q)
correct = [int(input()) for index in range(q)]
count = np.bincount(np.array(correct))

count_extend = np.append(count,np.zeros(n-count.size+1))
count_extend = count_extend[1:]
candidates = np.full(n,k-q)
winner = candidates + count_extend

for value in winner:
  if value>0:
    print("Yes")
  else:
    print("No")