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

n = list(map(int, input().split()))

a = []

for i in range(n[2]):
    a.append(int(input()))

if n[1] > n[2]:
    for c in range(n[0]):
            print('Yes')

else:
    m = [n[1]]*n[0]

    x = np.array(m)
    x -= n[2]
    for j in range(n[2]):
        x[a[j]-1] += 1

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

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

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

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

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

if K-1 >= Q:
    for _ in range(N):
        print("Yes")

else:
    for a in A:
        Point[a-1] += 1

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

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

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

for n in nlist:
    if q - n < k:
        print('Yes')
    else:
        print('No')

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

for i in answer:
  score[i] += 1
  
for s in score:
  if s > 0 :
    print('Yes')
  else:
    print('No')

Solution (Python):
import numpy as np

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

A_list = []

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

Get_point_list = [0] * N
  
for i in range(len(A_list)):
  idx = A_list[i] - 1
  Get_point_list[idx] += 1
  
Minus_list = [K-Q] * N

ans_list = np.array(Get_point_list) + np.array(Minus_list)

ans_list2 = []

for i in range(len(ans_list)):
  if ans_list[i] > 0:
    ans_list2.append("Yes")
  else:
    ans_list2.append("No")

print(*ans_list2)

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

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

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

for i in range(n):
    pnt = a[i] + t
    if pnt > 0:
        print("Yes")
    else:
        print("No")

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

	
	

AttackSurvival()

Solution (Python):
import os

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

B = [K-Q]*N

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

for j in range(0,N):
    if B[j] > 0:
        print("Yes")
    else:
        print("No")

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

b = [k]*n

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

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

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

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

A = [int(input()) for i in range(Q)]
Anslist = [0 for i in range(N)]

for a in range(Q):
    Anslist[A[a] - 1] += 1

for b in range(N):
    if Anslist[b] - Q + K <= 0:
        print("No")
    else:
        print("Yes")

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

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

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

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

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

def_socre = K - Q
for j in score_lst:
    if def_socre + j > 0:
        print("Yes")
    else:
        print("No")

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

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 i in range(q):
    b[a[i] - 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())
A = []
for i in range(Q):
    A.append(int(input())-1)
count = [0 for i in range(N)]
for i in A:
    count[i] += 1
for i in range(N):
    if count[i] >= Q - K + 1:
        print("Yes")
    else:
        print("No")

Solution (Python):
from collections import defaultdict
d = defaultdict(int)

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


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

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

Solution (Python):


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

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

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

for x in part:
    if x <= 0:
        print('No')
    else:
        print('Yes')

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

Solution (Python):







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

Solution (Python):
n,k,q=map(int,input().split())
A=list(int(input()) for i in range(q))
p_l=list(k-q for i in range(n))

for i in range(q):

  p_l[A[i]-1]+=1

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

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

import numpy as np
S = np.ones(N)*(K - Q)

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

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

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

Solution (Python):
n, k, q = map(int, input().split())
point = {}
tmp = 0

for i in range(q):
    tmp = int(input())
    if tmp in point:
        point[tmp] += 1

    else:
        point[tmp] = 1

total = sum(point.values())

for b in range(1, n + 1):
    if b in point:
        if total - point[b] >= k:
            print("No")
        else:
            print("Yes")

    else:
        if total >= k:
            print("No")

        else:
            print("Yes")

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

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

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

minus = [0]*N

for i in range(Q):
    num = int(input())-1
    minus[num] += 1
    
point = ["Yes"  if (point[i]+ minus[i])>0 else "No" for i in range(N)]

point = "\n".join(point)

print(point)

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

Score = [0]*N

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



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

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

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

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

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

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

if k > 0:
    for i in range(n):
        print('Yes')
    exit()

a = [int(input()) for i in range(q)]
n_a = [k] * n

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

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

Solution (Python):
from collections import Counter
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
C = Counter(A)
ans = ["No"] * N
ok = Q - K
if ok < 0:
  ans = ["Yes"] * N
  for ANS in ans:
    print(ANS)
  exit()

c = [key - 1 for key,val in C.items() if val > ok]
for i in c:
  ans[i] = "Yes"
for ANS in ans:
  print(ANS)

Solution (Python):






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





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





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

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

sn = [0]*n

for i in list_a:
  sn[i-1] += 1


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

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

p=[0]*n

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

Solution (Python):
N,K,Q=map(int,input().split())
ls_ = [K]*N
for i in range(Q):
  ls_[int(input())-1]+=1
ls__ = ["No" if i <= Q else "Yes" for i in ls_]
string = "\n".join(ls__)
print(string)

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

x = 1 - k + q

for i in nn:
    if i >= x:
        print("Yes")
    else:
        print("No")

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

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

def win(n):
    return n + 1
def lose(n):
    return n - 1


scores = [k] * n

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

for i in scores:
    x = int(i)-q
    if x>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import numpy as np

inputData = input().split()
N, K, Q = [int(x) for x in inputData]
points = np.array([K]*N)

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

Solution (Python):
import numpy as np

N,K,Q = map(int,input().split())
A = []
for i in range(Q):
  A.append(int(input()))
p = np.ones(N)*(K-Q)
pm = np.zeros(N)
for i in range(Q):
  pm[A[i]-1] += 1
pa = p + pm
for i in  range(N):
  if pa[i] > 0:
    print("Yes")
  else:
    print("No")

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

a = [int(input()) for i in range(q)]
m = [k-q] * n

for c in a :
    m[c-1] += 1

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

Solution (Python):

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

Solution (Python):
master = list(map(int, input().split()))
participant = []
criteria = master[1] - master[2]

for i in range(master[0]):
    participant.append(0)


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

for p in participant:
    if (criteria + p > 0):
        print("Yes")
    else:
        print("No")

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

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

for Ai in A:
    right_points[Ai-1] += 1

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

Solution (Python):
import sys
input=sys.stdin.readline
n,k,q=map(int,input().split())
C=[0]*n
for _ in range(q):
    i=int(input())
    C[i-1]+=1
Ans=[False]*n
for i,c in enumerate(C):
    score=k-q+c
    if score>0:
        Ans[i]=True
for ans in Ans:
    print('Yes' if ans else 'No')

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

for p in points:
  _p = p - q
  if _p <= 0:
    print("No")
  else:
    print("Yes")

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

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

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

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

Solution (Python):
N, K, Q = (int(x) for x in input().split())
H = [K] * N
a = [input() for y in range(Q)]
A = [int(y) for y in a]

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

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

Solution (Python):
n,k,q=map(int,raw_input().split())
l=[k]*(n+1)
for i in xrange(q):
    x=int(input())
    l[x]+=1

for i in l[1:]:
    if i-q>0:
        print "Yes"
    else:
        print "No"

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

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

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

Solution (Python):
n,k,q =  list(map(int, input().split()))
a = [int(input()) for i in range(q)]
import numpy as np
p = np.ones(n) * (k-q)

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

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

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

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

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

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

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

for i in range(n):
    p.append(0)

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

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

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

player = []
for j in range(N):
    player.append(0)


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


for k in range(len(winner)):
    player[winner[k]-1] += 1
    
for m in range(len(player)):
    player[m] = K-Q+player[m]


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

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

points = {}

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


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

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

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

point=[K]*N

for j in range(Q):
    point[A[j]-1]+=1
    
    

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

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

Solution (Python):
N,K,Q=[int(i) for i in input().split()]
A = []
for i in range(Q):
  A.append(int(input()))
P=[Q-K]*N
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 = []
for i in range(q):
    a.append(int(input()))
    
players = []
for j in range(n):
    players.append(k-q)
    
for j in a:
    players[j-1] += 1

for l in players:
    if l > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
from collections import Counter


def main():
    n, k, q = map(int, input().split())
    a = Counter([int(input()) for _ in range(q)])
    p = [0 for _ in range(n)]
    for key, v in a.items():
        p[key-1] += v

    for s in p:
        if s-q <= -k:
            print("No")
        else:
            print("Yes")


if __name__ == "__main__":
    main()

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

pnt = [K] * N

for i in range(N):
    pnt[i] -= Q
    
for a in A:
    pnt[a-1] += 1
    
for p in pnt:
    if p <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
import sys
import collections
import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)

import math

N, K, Q = map(int, input().split())
init = [K] * N
res = [0] * N

for _ in xrange(Q):
    cur = int(input())
    res[cur-1] += 1

for i in xrange(N):
    init[i] -= (Q - res[i])
    print('No' if init[i] <= 0 else 'Yes')

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

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

for ss in sei:
    if k + ss - q > 0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
from collections import Counter

n, k, q = map(int,input().split())
winner = [int(input()) -1 for i in range(q)]
mycount = Counter(winner)
point = [k - (q - mycount[i])for i in range(n)]

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

Solution (Python):
N, K, Q = [int(nkq) for nkq in input().split()]
score = [K-Q] * N

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

for n in range(N):
  s = score[n]
  if s > 0:
    print("Yes")
  else: 
    print("No")

Solution (Python):

import numpy as np
import sys


def main():
    N, K, Q = map(int, input().split())
    score = np.zeros(N)
    for i in range(Q):
        score[int(input())-1] += 1
    for i in range(N):
        if K - Q +score[i] > 0:
            print("Yes")
        else:
            print("No")








if __name__ =='__main__':
    main()

Solution (Python):
str = input()

split = str.split(" ")

Member = int(split[0])
Point = int(split[1])
Ans = int(split[2])
MemPoint = [0 for i in range(Member)]

for i in range(Ans):
  MemPoint[int(input())-1] += 1

for i in range(Member):
  if Point - (Ans - MemPoint[i]) > 0:
    print("Yes")
  else:
    print("No")

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

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

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

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

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

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

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

noko = Q-K
for a in A:
    H[a-1] += 1

for h in H:
    if h > noko:
        print("Yes")
    else:
        print("No")