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())
anslist = [0] * n
ans = ["No"] * n
for i in range(q):
    a = int(input())
    anslist[a-1]+=1
for i in range(len(anslist)):
    if anslist[i] >= (q - k + 1):
        ans[i]="Yes"
[print(i) for i in ans]

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

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

n, k, q = list(map(int, readline().split()))
a = [(k - q) for i in range(n)]
for i in range(q):
    a[int(readline())-1] += 1

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

Solution (Python):
n,k,q = list(map(int,input().split()))
a= [int(input()) for _ in range(q)]
b = [0]*n
for i in range(q) :
    b[a[i]-1] +=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())
s = [k for i in range(n)]
d = {}
for i in range(q):
    z = int(input())
    if z-1 not in d:
        d[z-1] = 1
    else:
        d[z-1] += 1 

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

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

    points = [K for _ in range(N)]
    points = list(map(lambda x: x - Q, points))

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
se=[]

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

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

points = [k]
points *= n

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



for i in range(q):
  points[se[i]-1] += 1



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

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

First = [K-Q] * N

for i in A_i:
    First[i-1] += 1
for j in First:
    if j <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):


import sys

input = sys.stdin.readline
n, k, q = map(int, input().split())
a = []

for i in range(n):
    a.append(k - q)

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 = [input() for i in range(q)]
K = [k]*n
limit = 0

for i in range(q):
  tmp = a[i]
  K[int(tmp)-1] = K[int(tmp)-1]+1
  limit += 1
  
for k in range(len(K)):
  if K[k] > limit:
    print("Yes")
  else:
    print("No")

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

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

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

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

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

Solution (Python):

from collections import defaultdict




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


score = defaultdict(int)
for i in range(Q):
    n = int(input())
    score[n - 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)]

l = [0]*(N+1)
for a in A:
    l[a] += 1

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

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

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

Point_Q = [0 for _ in range(N)]
for a in A:
    Point_Q[a-1] += 1
Point = [i+j for i,j in zip(Point_0,Point_Q)]
hantei = [print("Yes") if p>0 else print("No") for p in Point]

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):
import sys
from collections import Counter
input = sys.stdin.readline
N,K,Q = map(int,input().split())
QCounter = Counter([int(input()) for _ in range(Q)]).most_common()
defult_over = Q-K 

if defult_over>=0:
    s = set()
    for win in QCounter:
        if win[1]>defult_over:
            s.add(win[0]-1)
    for i in range(N):
        if i in s:
            print("Yes")
        else:
            print("No")
else:
    for _ in range(N):
        print("Yes")

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

yn = ['No', 'Yes']
ans = [yn[min(1,max(K+x-Q,0))] for x in score]

for y in ans:
    print(y)

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

A = [0] * Q
for i in range(Q):
    A[i]=int(input())


    
P = [K-Q] * N

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



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

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

victory_cnt = [0] * N 

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

for v in victory_cnt:
    if (Q-v) >= K:
        print('No')
    else:
        print('Yes')

Solution (Python):
import collections

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

all_result = []
for a_i in range(Q):
    all_result.append(int(input()))

c = collections.Counter(all_result)

for num in range(N):
    point = c[num + 1]
    if (K - Q + point) > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import collections
n = list(map(int,input().split()))

a = [int(input()) for i in range(n[2])]
kk = n[1]-n[2]


counter = collections.Counter(a)

for i in range(n[0]):
    if kk+counter[i+1] <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
import collections
N,K,Q=[int(thing) for thing in input().split(" ")]
A_list=[int(input()) for thing in range(Q)]

c=collections.Counter(A_list)
cc={str(i):c[i] for i in c}
c=cc
for i in range(N):
    if str(i+1) in c:
        seikai=c[str(i+1)]
    else:
        seikai=0

    point=K-Q+seikai
    if point>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()))

default = K - Q
person = [default for n in range(N)]

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

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

Solution (Python):
import collections

n, l, q = map(int, input().split())
a = [input() for _ in range(q)]
c = collections.Counter(a)

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

Solution (Python):



from sys import stdin
import math
import collections


int_list  = [int(x) for x in stdin.readline().rstrip().split()]

N = int_list[0]
K = int_list[1]
Q = int_list[2]

A = []

for i in range(Q):
    A.append(stdin.readline().rstrip())

c_dict = collections.Counter(A)

border = Q -K  + 1

for i in range(1,N+1):
    if border <= 0:
        print('Yes')
    elif c_dict[str(i)] >= border:
        print('Yes')
    else:
        print('No')

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

l = [int(input()) for _ in range(q)]
point = [k-q]*n
c = Counter(l)

[print('Yes') if j + c[idx+1] > 0 else print('No') for idx,j in enumerate(point)]

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

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

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

import numpy as np
a = np.array([K]*N)
a -= Q

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

for j in range(N):
    if a[j]<=0:
        print("No")
    else:
        print("Yes")

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

data = {}
for i in range(Q):
  user = str(int(input()) - 1)
  data[user] = data.get(user, 0) + 1
    
for i in range(N):
  if data.get(str(i), 0) + K - Q > 0:    
    print('Yes')
  else:
    print('No')

Solution (Python):
import numpy as np
N,K,Q=np.array(list(map(int, input().split())))

N_i=np.zeros(N)+K-Q
A=np.zeros(Q)
for i in range(Q):
    A[i]=int(input())

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

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

Solution (Python):
import sys
n, k, q = map(int, sys.stdin.readline().split())
L = [k-q for i in range(n)]

for _ in range(q):
    a = int(sys.stdin.readline())
    L[a-1] +=1

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

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

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

import collections
c = collections.Counter(p)
cc=[]
for i in range(n):
  cc.append(c[i+1])

ans=[]
for d,e in zip(ans0,cc):
  ans.append(d+e)


for f in ans:
  if f<=0:
    print("No")
  else:
    print("Yes")

Solution (Python):
n_players, init_point, n_questions = [int(x) for x in input().split(" ")]
answerer_ids = []
for i in range(n_questions):
    answerer_ids.append(int(input()) - 1)

survivers_list = ["Yes" for i in range(n_players)]
n_answers = [0 for i in range(n_players)]
for i in range(n_questions):
    n_answers[answerer_ids[i]] += 1

for i in range(n_players):
    score = init_point - n_questions + n_answers[i]
    if score > 0:
        print("Yes")
    else:
        print("No")

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

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

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



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



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

Solution (Python):
a, b, c = map(int, input().split())
d = [b] * a

for i in range(c):
  e = int(input())
  d[e-1] +=1
  
f = [i-c for i in d]

for i in f:
  if i<1:
    print('No')
  else:
    print('Yes')

Solution (Python):


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

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

array = [0] * (N + 10)
for i in range(Q):
    array[A[i]] += 1

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

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

A_point = [K] * N

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

A_point = map(lambda x:x-Q, A_point)

for r in A_point:
  if r > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):
yn = lambda b: print('Yes') if b else print('No')


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

A=[K-Q]*N

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

for a in A:
	yn( a>0 )

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

c = collections.Counter(a)

sa = k-q

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

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

Solution (Python):
import numpy as np

N, K, Q, *A, = map(int, open(0).read().split())
P = np.zeros(N)
for i in A:
    P[i - 1] += 1
for j in P:
    if K <= Q - j:
        print("No")
    else:
        print("Yes")

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

for i in list:
    if q - i >= k:
        print("No")
    else:
        print("Yes")

Solution (Python):
from collections import defaultdict
counter = defaultdict(int)
n, k, q = map(int, input().split())
for _ in range(q):
    a = int(input()) - 1
    counter[a] += 1

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

Solution (Python):
def main():
  n,k,q = [int(x) for x in raw_input().split()]
  memo = {}

  for _ in xrange(q):
      pid = int(raw_input()) - 1
      if pid not in memo:
          memo[pid] = 0
      memo[pid] += 1

  for pid in xrange(n):
      score = k - q + memo.get(pid, 0)
      print("Yes" if score > 0 else "No")

main()

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

import numpy as np
P = np.ones(N)*K

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

P[:]-=Q

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

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

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

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

for i in n_list:
    if i - q <= 0:
        print('No')
    else:
        print('Yes')

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

Answer_list = list()
point_list = [0] *N
for i in range(0,Q):
    Answer_list.append(int(input()))

for j in Answer_list:
    point_list[j-1] += 1

for l in point_list:
    if Q - l >= K:
        print("No")
    else:
        print("Yes")

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

A = list(map(int, [K]*N))
s = [input() for i in range(Q)]

for i in s:
    A[int(i)-1] += 1

num = 0
for i in A:
    A[num] -= int(len(s))
    num += 1

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

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

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

Solution (Python):
N,K,Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
from collections import Counter
R = [K-Q]*N
c = Counter(A)
for i in c.items():
    R[i[0]-1] += i[1]
    
for j in R:
    if j<=0:
        print('No')
    else:
        print('Yes')

Solution (Python):
list1=input().split(' ')
N=int(list1[0])
K=int(list1[1])
Q=int(list1[2])
listQ=[]
for i in range(Q):
    listQ.append(int(input()))
listScores=[K for i in range(N)]
sum=0
for i in listQ:
    sum=sum+1
    listScores[i-1]=listScores[i-1]+1
for i in listScores:
    i=i-sum
    if i>0:
        print('Yes')
    elif i<=0:
        print('No')

Solution (Python):
import numpy as np
import sys

input = sys.stdin.readline

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

score = np.full(N, K, dtype=int)

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

score -= Q

is_win = score > 0

res = ["Yes" if a else "No" for a in is_win]

print("\n".join(res) + "\n")

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

Solution (Python):

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

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

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

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

Solution (Python):
import numpy as np
N, K ,Q = map(int, input().split())
participant = np.full(N, K)
As = []
for i in range(Q):
    answer = int(input())
    participant[answer-1] +=1
participant -= Q
for surviver in np.where(participant>0, "Yes", "No"):
    print(surviver)

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

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

correctList = list()
for i in range(N):
    correctList.append(0)

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

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

Solution (Python):
def A():
    w = ['Sunny', 'Cloudy', 'Rainy']
    today = input()
    index = w.index(today)
    if index == 2:
        index = -1
    print(w[index+1])

def B():
    odd = 'RUD'
    even = 'LUD'

    s = input()
    for i in range(len(s)):
        if (i+1)%2 == 0:
            if s[i] not in even:
                print('No')
                return
        else:
            if s[i] not in odd:
                print('No')
                return
        
    print('Yes')

def C():
    temp = [int(i) for i in input().split()]
    N = temp[0]
    K = temp[1]
    Q = temp[2]
    points = {}

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

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

    for i in points.keys():
        if K - (Q - points[i]) > 0:
            print('Yes')
        else:
            print('No')
    
C()

Solution (Python):
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")



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

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

    for i in L_2:
        N_points[i - 1] += 1

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

            
    
if __name__ == "__main__":
    main()

Solution (Python):
import sys

N, K, Q = map(int, input().split())
a = list(int(input()) for i in range(Q))

anslst = ['YES'] * N
plst = [0] * N

for i in range(Q):
    plst[a[i] - 1] += 1

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

for i in anslst:
    print(i)

Solution (Python):
from collections import Counter
N,K,Q=map(int,input().split())
a=[]
for q in range(Q):
  a.append(int(input()))
C=Counter(a)
for i in range(N):
  if i+1 in C.keys():
    if K-Q+C[i+1]>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())
l = []
for i in range(n):
    l.append(0)

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


for i in l:
    if i + k - q <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
import numpy as np

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

points = np.asarray([K for _ in range(N)])

points -= Q
for A in As:
    points[A - 1] += 1

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

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

for i in range(q):
    li2[li[i]-1] += 1

for i in range(n):
    if li2[i]>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())-1)
b = [k-q]*n
for i in a:
    b[i] += 1
for i in range(len(b)):
    print('Yes' if b[i]>=1 else 'No')

Solution (Python):

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

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

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

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

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

Solution (Python):
n, k, q = input().split()
N = int(n)
K = int(k)
Q = int(q)
Q_list = [0] * N
for i in range(Q):
    num = int(input())
    Q_list[num - 1] += 1

for i in range(N):
    p = K - (Q - Q_list[i])
    if p <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
data = input()
l = data.split()
l = list(map(int, l))
p = l[1] - l[2]

points = [p for i in range(l[0])]

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

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

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

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

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

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

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

for j in range(len(A)):
  B[A[j]-1] += 1
  
for l in range(len(B)):
  if B[l] > Q - K:
    print('Yes')
  else:
    print('No')

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

    

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

Solution (Python):
tmp = input()
tmp_s = [int(x.strip()) for x in tmp.split(' ')]
N = tmp_s[0] 
K = tmp_s[1] 
Q = tmp_s[2] 
A = []
num_of_win = [0]*N
point = []
lost_point = [0]*N
for i in range(0, Q):
    A.append(int(input()))
    num_of_win[A[i]-1] += 1
S = sum(num_of_win)
for i in range(0, N):
    lost_point[i] = S - num_of_win[i]
    point.append(K-lost_point[i])
    if point[i] <= 0:
        print('No')
    else:
        print('Yes')

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

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

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

score = [k-q]*n
for i in A:
    score[i-1] = score[i-1]+1

for s in score:
    if s > 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()))

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


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

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

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

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

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

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

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

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

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

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

count = []
for i in range(N):
    count.append(K-Q)

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

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

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

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

Solution (Python):
import collections

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

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

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

P = [(K-Q) for i in range(N+1)]
for i in range(Q):
    P[A[i]] = P[A[i]] + 1 

for i in range(1,N+1):
    if P[i] > 0 :
        print('Yes')
    else:
        print('No')

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

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

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

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

Solution (Python):
s=list(input().split())
N=int(s[0])
K=int(s[1])
Q=int(s[2])
minus=[Q]*N

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

Solution (Python):

if __name__ == "__main__":
    N = list(map(int,input().split()))
    K = N[1]
    Q = N[2]
    N = N[0]
    A = [0] * N
    maxp = 0
    for i in range(Q):
        tmpi = int(input())
        A[tmpi-1] += 1
    
    for i in range(N):
        if K - (Q - A[i]) <= 0:
            print("No")
        else:
            print("Yes")

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

if K > Q:
    for i in range(N):
        print('Yes')
    exit()

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