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())
l=[k-q for _ in range(n)]
for i in range(q):
    l[int(input())-1]+=1

for i in l:
    if i>0:
        print("Yes")
    else:
        print("No")

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

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

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

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

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


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

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

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

Solution (Python):


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

point = [k - q] * n

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

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

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

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

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

for score in list:
    if 0<score:
        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)]

cnt = Counter(A)

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

print("\n".join("Yes" if val > 0 else "No" for val in ans))

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

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

    for player_answer in A_list:
        
        player_score[player_answer - 1] = player_score[player_answer - 1] + 1

    player_score = list(map(lambda i: i - len(A_list), player_score))
    
    for score in player_score:
        print("Yes" if score > 0 else "No")
    
if __name__ == "__main__":
    main()

Solution (Python):

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

point_list = [ (k - q) for _ in range(n) ]
 
for round in range(q):
    
    person_index = int(input()) - 1
    
    
    point_list[person_index] += 1
 
for item in point_list:
    if (0 < item):
        print('Yes')
    else:
        print('No')

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

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

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

players = [0 for n in range(N)]
for q in range(Q):
  players[int(input())-1] += 1

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

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

scores = [k - q] * n

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

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

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

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

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

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

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

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

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

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

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

    num_of_ans = [0 for _ in range(N)]
    for _ in range(Q):
        num_of_ans[int(input())-1] += 1
    
    for i in range(N):
        points = K - (Q - num_of_ans[i])
        if points <= 0:
            print("No")
        else:
            print("Yes")

solve()

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

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

score_list = [K - Q] * N

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

for s in score_list:
    if s > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):

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


A = [0] * N


line = Q - K + 1


if line - 1 < 0:
    for i in range(N):
        print('Yes')
    exit()


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

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

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

Solution (Python):
import sys
N, K, Q = map(int, input().split())
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)

Solution (Python):
N, K, Q = map(int, input().split())
A = []
for q in range(Q):
    A.append(int(input()))
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)

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

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

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

for j in range(len(points)):
  if points[j] <= 0:
    print('No')
  else:
    print('Yes')

Solution (Python):

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

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

for i in range(q):
  b = int(input())
  a[b-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())
A = [int(input()) for _ in range(Q)]

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

Solution (Python):

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

Solution (Python):

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

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):
  score[ a[i]-1 ] += 1
  
  
for i in range(n):
  print("Yes" if score[i] > 0 else "No")

Solution (Python):
import math
import queue

mod = 1e9+7

def swap(a,b):
    return (b,a)

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

def divisors(a):
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

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

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter as co
h,s,q=map(int,input().split())
l=co([int(input()) for e in range(q)])
for i in range(h+1)[1:]:
  print("Yes") if s-q+l[i]>0 else print("No")

Solution (Python):
import numpy as np

n, k, q = [int(nkq) for nkq in input().split()]
arr = np.full(n, k-q, dtype=np.int64)

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

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

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

N,K,Q = LI()
A = [0 for i in range(Q)]
for i in range(Q):
    A[i] = int(input()) - 1

cnt = {}

for i in range(N):
    cnt[i] = 0

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

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

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

N,K,Q = LI()
A = [0 for i in range(Q)]
for i in range(Q):
    A[i] = int(input()) - 1

cnt = {}

for i in range(N):
    cnt[i] = 0

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

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

Solution (Python):
n,k,q=map(int,input().split(' '))
qq=q
l=[k]*(n+1)

times=[0]*(n+1)
while qq:
    a=int(input())
    times[a]+=1
    qq-=1

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
x,y,z = map(int,input().split())
li=[int(input()) for i in range(z)]
ans = y - z 
ans_li = [ans] * x
for i in li:
  ans_li[i - 1] += 1
for j in ans_li:
  if j <= 0:
    print("No")
  else:
    print("Yes")

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

Solution (Python):


import sys

sys.setrecursionlimit(100000)
MOD = 10 ** 9 + 7

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

T = [K-Q] * N
for _ in range(Q):
    a = int(input())
    a -= 1
    T[a] += 1

for t in T:
    if t > 0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import collections

N, K, Q = map(int,input().split())
A_list = [int(input())-1 for _ in range (Q)]

A_dic = collections.Counter(A_list)

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

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

Solution (Python):
lis_NKQ = list(map(int, input().split()))

lis_A = []
lis_K = [lis_NKQ[1] for i in range(lis_NKQ[0])]
lis_K = list(map(lambda x: x - lis_NKQ[2],lis_K))

for i in range(lis_NKQ[2]):
    inp = int(input())
    lis_A.append(inp)
    lis_K[inp - 1] += 1  

for i in lis_K:
    if i > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
n,k,q=map(int,input().split())
a=[]
for i in range(q):
    a.append(int(input()))
p=[k-q]*n
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):
S = input().split()
N = int(S[0])
K = int(S[1])
Q = int(S[2])

each_point = [0 for _ in range(N)]
for _ in range(Q):
    a = int(input())
    each_point[a-1] += 1

for point in each_point:
    if K - Q + point <= 0:
        print("No")
    else:
        print("Yes")

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

Solution (Python):

 
num_member, life, num_question = [int(s) for s in input().split()]

win_num_list = [0]*num_member
for i in range(num_question):
  winner_no = int(input())
  win_num_list[winner_no-1] += 1
  
for win_num in win_num_list:
  if life > num_question - win_num:
    print('Yes')
  else:
    print('No')

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

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

for _ in range(Q):
    a.append(int(input()))

for _ in range(N):
    A.append(int(K))

for n in range(Q):
    A[a[n]-1]+=1
    
for s in range(N):
    if A[s]-Q<1:
        print("No")
    else:
        print("Yes")

Solution (Python):

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

p = [0] * N







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

sum_p = sum(p)

for pp in p:
    if (pp + K) > sum_p:
        print("Yes")
    else:
        print("No")

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

zero_list = [0 for n in range(N)]

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

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

right_answers = list(int(input()) for _ in list(range(Q)))
indexes = [v-1 for v in right_answers]

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

for i in indexes:
    scores[i] = scores[i]+1

for j in scores:
    if j > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
def main():
    n,k,q = list(input().split())
    answer = [0]*int(n)
    for i in range(int(q)):
        num = int(input())
        answer[num-1] += 1

    diff = int(q) - int(k)

    for i in answer:
        if i > diff:
            print("Yes")
        else:
            print("No")


if __name__ =="__main__":
    main()

Solution (Python):
import numpy as np
_N, _K, _Q = input().split()
N, K, Q = int(_N), int(_K), int(_Q)
A = []
for i in range(Q):
  A.append(int(input()))

if K > Q:
  for i in range(N):
    print("Yes")
else:
  score = K * np.ones(N) - Q
  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())
A=[int(input()) for _ in range(Q)]
B=[K-Q]*N
for i in range(Q):
  B[A[i]-1]+=1
for i in range(N):
  print('Yes' if B[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, *a = map(int, open(0).read().split())
out = [k-q for _ in range(n)]
for i in range(q):
    out[a[i]-1] += 1
for i in out:
    msg = "Yes" if i > 0 else "No"
    print(msg)

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

Solution (Python):
import sys
from collections import Counter
input=sys.stdin.readline
n,k,q=map(int,input().split())
a=[int(input()) for _ in range(q)]
cnt=Counter(a)

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

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

Solution (Python):
import numpy as np

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

players_score = np.full(n, k-q)

for item in a:
    players_score[item-1] += 1

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

Solution (Python):
import sys
input = sys.stdin.readline
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]
import collections
c = collections.Counter(a)

list_count = [0]*n
for i in range(n):
    list_count[i] = c[i+1]

list_score = [k]*n
for i in range(n):
    list_score[i] = list_score[i] + list_count[i] - q

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

Solution (Python):
n,k,q=map(int,input().split())
a=[k-q]*n
for _ 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())
s = [k - q] * n
for _ in range(q):
  i = int(input())
  s[i - 1] += 1
for si in s:
  if si > 0:
    print('Yes')
  else:
    print('No')

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

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

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

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

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

Solution (Python):
n,k,q = [int(i) for i in input().split()]
ans = [0]*n
judge = []

for _ in range(q):
    a = int(input())
    ans[a-1] += 1
    
for i,x in enumerate(ans):
    if k+x > q:
        judge.append("Yes")
    else:
        judge.append("No")

for i,v in enumerate(judge):
    print(v)

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

tokuten=[0]*n

for i in range(q):
    tokuten[A[i-1]-1]=tokuten[A[i-1]-1]+1

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

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

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

for i in range(n):

    if a[i] > q-k:
        print("Yes")
    else:
        print("No")

Solution (Python):

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

list = [0] * n

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

for j in range(n):

    if(k - q + list[j] > 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):
    if i in c:
        if (k - q + c[i]) > 0:
            print("Yes")
        else:
            print("No")
    else:
        if k - q > 0:
            print("Yes")
        else:
            print("No")

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

Solution (Python):
N, K, Q = map(int, input().split())
result = {}
for i in range(Q):
    winner = int(input())
    result[winner] = result.get(winner, 0) + 1

for i in range(N):
    if K - (Q - result.get(i + 1, 0)) > 0:
        print("Yes")
    else:
        print("No")

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

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

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

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

Solution (Python):
from collections import OrderedDict
N,K,Q = map(int,input().split())
answer = []
dic = OrderedDict()
for i in range(N):
    b = "name" + str(i+1)
    dic[b] = K - Q
for i in range(Q):
    answer = int(input())
    ans = "name" + str(answer)
    dic[ans]= dic[ans] + 1
for key,value in dic.items():
    if value <= 0:
        print("No")
    else:
        print("Yes")

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

list_winner=[]

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

for i in range(q):
    list_[list_winner[i]-1]+=1

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

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

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

Solution (Python):
import numpy as np
N, K, Q  = map(int, input().split())
score = np.zeros(N)
for i in range(Q):
  num = int(input())
  score[num-1] += 1

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

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

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

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

for i in range(Q):
  a = input()
  if str(A.get(a)) == 'None':
    A[a] = 1
  else:
    A[a] += 1
    
for i in range(1,N+1):
  _i = str(i)
  if _i in A:
    if K - (Q - A[_i]) > 0:
      print('Yes')
    else:
      print('No')
  else:
    if K - Q > 0:
      print('Yes')
    else:
      print('No')

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

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

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

Solution (Python):
import sys
import numpy as np
n,k,q=map(int,input().split())
list=[]
for i in range(q):
    list.append(int(input()))

point = [k] * n
for i in range(len(list)):
    point[list[i]-1] += 1

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

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

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

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

n,k,q = map(int, input().split())
d = [0] * (n+1)
for _ in range(q):
    x = int(input())
    d[x] += 1

for i in range(1, n+1):
    if 0 < k - q + d[i]:
        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()) - 1
    P[a] += 1

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

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

Solution (Python):
man, point, times = map(int, input().split())
standard = point - times
list = [standard] * man
for i in range(times):
  list[int(input())-1] += 1
for j in range(man):
  if list[j] > 0:
    print("Yes")
  else:
    print("No")

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

for _ 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):
import sys

N,K,Q = map(int,input().split())
A = (int(x) for x in sys.stdin.read().split())
 
score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1
 
answer = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(answer)

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


b = [0]*n


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


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

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] = scores[a-1] + 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 = []
P = [0]*N
for q in range(Q):
	A.append(int(input()))
 
for q in range(Q):
	P[A[q]-1] += 1
	
for n in range(N):
	if K - (Q - P[n]) > 0:
		print('Yes')
	else:
		print('No')

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


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


for i in range(N):
	charanger_points[i] -=  Q - gained_points[i]


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

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

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

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

for j in range(q):
  ans_list.append(int(input()))

for k in ans_list:
  point[k-1] += 1

for l in range(n):
  point[l] -= q
  if point[l]>0:
    print("Yes")
  else:
    print("No")

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