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 collections
N,K,Q = list(map(int,input().split()))
point = [0 for i in range(N)]
bor = Q - K + 1
A = []
for i in range(Q):
    A.append(int(input()))
for i in A:
    point[i-1] += 1
for i in point:
    if i >= bor:
        print('Yes')
    else:
        print('No')

Solution (Python):
def ma():return map(int,input().split())
def nli(x):return [int(input()) for _ in range(x)]
def hukusuu():
  listA=[] 
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break 
  return listA

def ifif(s):
  if s:print("Yes")
  else:print("No")

n,k,q=ma()

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

for i in range(n):
  ifif(k-q+b[i]>0)

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

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

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

s = sum(L)

for i in range(N):
  if K + L[i] -s <= 0:
    print("No")
  else:
    print("Yes")

Solution (Python):
n_people, full_p, n_ques = map(int, input().split())

count = [0]*n_people

for i in range(n_ques):
  people = int(input())
  count[people-1] += 1

     
for i in range(n_people):
  if count[i] > n_ques-full_p:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]

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

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

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

Solution (Python):


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


B=[0 for i in range(N)]

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

for i in B:
    if Q-i<K:
        print("Yes")
    else:
        print("No")

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

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):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n,k,q = iim()
l = [k]*n
for i in range(q):
    p = ii()
    l[p-1] += 1

for j in l:
    if j < q+1:
        print('No')
    else:
        print('Yes')

Solution (Python):
import sys
import numpy as np

N, K, Q = map(int, input().split())
A = []
for _ in range(Q):
    a = int(sys.stdin.readline())
    A.append(a)

score = [K - Q] * N

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

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

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

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

res = [0] * N

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

ans = [''] * N

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

Solution (Python):


int1 = lambda x: int(x) - 1

def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())


def LI(): return list(map(int, input().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]


def solve():
    n, k, q = MI()
    A = [II() for _ in range(q)]

    ini = k-q
    point = [ini for _ in range(n)]
    for a in A.copy():
        point[int1(a)] += 1

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


if __name__ == '__main__':
    solve()

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] += 1
for p in point:
    print('Yes' if p > 0 else 'No')

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

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

for i in range(n):
    ans.append(k - q + cnt[i])

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

Solution (Python):

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

p = [k for _ in range(n)]

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

Solution (Python):
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]
p = [k-q for _ in range(n)]
WIN = []
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())
C = dict([i+1, K - Q] for i in range(N))
for _ in range(Q):
    A = int(input())
    C[A] += 1
for v in C.values():
    print('Yes' if v > 0 else 'No')

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

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

Solution (Python):
import sys
import collections
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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


for i in range(N):
    
    
    print('No' if (ans_l[i]<1) else 'Yes')

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

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

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

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

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

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

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

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

p = [k - q] * n

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

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

Solution (Python):
import sys
N,K,Q = map(int,input().split())
if K > Q:
    for i in range(N):
        print('Yes')
    sys.exit(0)
else:
  res = dict()
  for i in range(N+1):
      res[i] = 0
  for i in range(Q):
    answ = int(input())
    if answ not in res:
      res[answ] = 0
    res[answ] += 1
res2 = [answ[0] for answ in res.items() if answ[1] >= (Q-K+1)]
for i in res2:
    res[i] = -1
for i in range(1,N+1):
    if (res[i] == -1):
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k, q = map(int, input().split())
dic = {i:0 for i in range(1, 1+n)}
for i in range(1, 1+q):
    dic[int(input())] += 1
for key, value in sorted(dic.items(), key=lambda x: x[0]):
    if k-q+value > 0:
        print('Yes')
    else:
        print('No')

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

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

l = [ k - q ] * n

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

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

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect



import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial, log, log10, log2
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

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

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def check(s):
    for i in range(len(s)):
        if s[i] != s[len(s)-1-i]:
            return False
    return True

def main():
    n, k, q = rli()
    solve = [0 for _ in range(n+1)]
    for i in range(q):
        a = ri()
        solve[a] += 1
    for i in range(n):
        if k-q+solve[i+1] > 0:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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



if __name__ == '__main__':
    main()

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

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

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

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

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

for i in range(n):
    if point_list[i]>0:
        print('Yes')
    else:
        print('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("Yes" if P[i]>0 else "No")

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

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

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

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



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

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

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

Solution (Python):
from collections import Counter
n,k,q = map(int,input().split())
a=[]
for i in range(q):
    a.append(int(input()))
point=[k-q]*n
r=Counter(a)
for i,j in r.items():
    point[i-1] += j
for i in point:
    if i>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)]
data = [K-Q]*N
C = Counter(A)
for i,j in C.items():
  data[i-1] += j
for i in range(N):
  if data[i] > 0:
    print("Yes")
  else:
    print("No")

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

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

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

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

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

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

for n in N_count:
    if K - (Q - n) > 0:
        print('Yes')
    else:
        print('No')

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

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

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

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

p = [K - (Q - ai) for ai in A[1:]]

for pi in p:
    print('YNeos'[pi < 1::2])

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

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

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

Solution (Python):
import sys
import math
import collections
from collections import deque

n, k, q = map(int, sys.stdin.readline().split())



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


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

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

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

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

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

Solution (Python):
import collections

n, k, q = map(int,input().split())
A = [int(input()) for i in range(q)]
c = collections.Counter(A)

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

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

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

for j in range(n):
    if k - q + point_get[j] >= 1:
        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())
    A[a-1] += 1

print('\n'.join(['No' if K-Q+e <= 0 else 'Yes' for e in A]))

Solution (Python):

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

Solution (Python):
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, K, Q = lr()
points = np.full(N, K - Q)
for _ in range(Q):
    a = ir() - 1
    points[a] += 1

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

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

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

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


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

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

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

for i in range(n):
    if player_point[i] < k:
        print('Yes')
    else:
        print('No')

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

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

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

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

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
input = sys.stdin.readline
N,K,Q = map(int,input().split())
A = [0] * Q
for i in range(Q):
    A[i] = int(input())
    
judge = [K-Q] * N
for j in A:
    judge[j-1] += 1

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

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

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
input = sys.stdin.readline
N,K,Q = map(int,input().split())
A = [0] * Q
for i in range(Q):
    A[i] = int(input())
    
judge = [K-Q] * N
for j in A:
    judge[j-1] += 1

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def load_n_times(n, vtype=int):
    r = []
    for _ in range(n):
        r.append(load(vtype=vtype))
    return r
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s

n, k, q = load_list()

A = load_n_times(q)

d = defaultdict(int)

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

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

Solution (Python):
N,K,Q = list(map(int,input().split()))
A = [K] * N
C = 0
for i in range(Q):
  B = int(input())
  A[B-1] += 1
  C += 1
for j in range(N):
  if A[j] > C:
    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(N):
  print('Yes') if K - Q + c[i+1] > 0 else print('No')

Solution (Python):

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

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



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

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

Solution (Python):
import collections

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

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

for i in range(q):
    correct_ans[aq[i] - 1] += 1
    
point = ['Yes'  if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]

for p in point:
    print(p)

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 i in l:
    if i > 0:
        print("Yes")
    
    else:
        print("No")

Solution (Python):

"""
C - Attack Survival
https://atcoder.jp/contests/abc141/tasks/abc141_c

"""
import sys


def solve(N, K, Q):
    scores = {n: K for n in range(1, N+1)}
    for _ in range(Q):
        a = int(input())
        scores[a] += 1
    ans = ['Yes' if scores[i] - Q > 0 else 'No' for i in range(1, N+1)]
    return ans


def main(args):
    N, K, Q = map(int, input().split())
    ans = solve(N, K, Q)
    print(*ans, sep='\n')


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    N, K, Q = input_nums()

    score = {}
    for i in range(N):
        score[i] = 0

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

    for k, v in score.items():
        
        if K + v - Q > 0:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):



from collections import deque,Counter








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

ans = [k-q for _ in range(n)]

cormem_count = Counter(correct_member)

for k,v in cormem_count.items():
    ans[k] += v

for i in ans:
    YorN = "Yes" if i > 0 else "No"
    print(YorN)

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 range(n):
    if q - a[i] < k:
        print("Yes")
    else:
        print("No")

Solution (Python):
import numpy as np

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

B =[K] * N


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

B = np.array(B)
C = [Q] * N
C = np.array(C)
ans = B - C
ans =ans.tolist()


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

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

points = [K - Q] * N

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

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

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

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

p = [k for _ in range(n)]
p = list(map(lambda x: x -q, p))
for s in a:
  
  p[s-1] = p[s-1] + 1

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

Solution (Python):

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

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

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

points = [K-Q] * N

for _ 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):
def resolve():
    n,k,q = map(int, input().split())
    a = [int(input()) for i in range(q)]
    point = [0]*n
    for i in range(q):
        point[a[i]-1] += 1
    for j in range(n):
        if k-q+point[j] > 0:
            print("Yes")
        else:
            print("No")
resolve()

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

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

    scores = [K - Q] * N

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

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


if __name__ == "__main__":
    main()

Solution (Python):
n, k, q = map(int, input().split())
quiz = [int(input()) for i in range(q)]
point = [k-q]*n
for i in quiz:
  point[i-1] += 1
[print("Yes") if i > 0 else print("No") for i in point]
'''
1. あらかじめ全員のポイントを Q 減らしておく (つまり，開始時点のポイントは K − Q)．
2. Q 回の正解それぞれに対して，正解者のポイントを 1 増やす．

リストの中身すべてに計算すると「リスト要素」＊「ループ回数」の計算量になる
'''

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

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

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

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

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

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


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

Solution (Python):








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

    S=[0]*N
    for i in A:
        S[i-1]+=1

    for i in S:
        if K-(Q-i)<=0:
            print('No')
        else:
            print('Yes')


resolve()

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

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