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



Sample input:
6 3 4
3
1
3
2


Sample output:
No
No
Yes
No
No
No

Submission status: Accepted

Solution code:
# 要復習
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    N, K, Q = MAP()
    A = [INT() for i in range(Q)]
    point = [K - Q for i in range(N)]
    for a in A:
        point[a-1] += 1
    ans = []
    for i in range(N):
        if point[i] > 0:
            ans.append("Yes")
        else:
            ans.append("No")
    print(*ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

for x in range(q):
    lst[a[x]-1] += 1

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

Submission status: Accepted

Solution code:
import numpy as np

def main():
    n, k, q = map(int, input().split())
    
    ls = [q] * n

    rls = [k] * n

    maru_list = [0] * n

    ls = np.array(ls)
    rls = np.array(rls)
    maru_list = np.array(maru_list)

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

    ls = ls - maru_list

    rls = rls - ls

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

p = [k - q + t[i] for i in range(0, n+1)]
p[0] = 0

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

Submission status: Accepted

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

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

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

p = [0] * (n+1)
for i in range(1, n+1):
    p[i] = k - q + t[i]

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

Submission status: Accepted

Solution code:
inp = list(map(int, input().split()))
N = inp[0]
K = inp[1]
Q = inp[2]

ansum =[]

for count in range(N):
    ansum.append(0)

for count in range(Q):
    seikaisya = int(input())
    ansum[seikaisya-1] += 1

for count in range(N):

    if K - Q + ansum[count] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

res = [k] * n

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

ans = []

for i in range(n):
    if res[i] > q:
        ans.append('Yes')
    else:
        ans.append('No')

i = 0
while i != n:
    print(ans[i])
    i += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
 
n, k, q = map(int, input().split())
l = [k-q]*n
 
for _ in range(q):
  a = int(input())-1
  l[a] += 1
for i in l:
  print('Yes' if i>0 else 'No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

n, k, q = map(int, input().split())
l = [k-q]*n

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
l = [int(input())-1 for _ in range(q)]
l.sort()

for i in range(n):
  cnt = 0
  if l and l[0] == i:
    while l and l[0] == i:
      l.pop(0)
      cnt += 1
  print(('No','Yes')[k > q - cnt])

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
cnt={}
for i in range(q):
    per=input()
    cnt.setdefault(per,0)
    cnt[per]+=1
for i in range(1,n+1):
    if cnt.get(str(i),0)+k-q>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

my_append = katen.append # appendを(間接的に)直接呼び出す
for i in range(q):
    my_append(int(input()))

for j in katen: # pop、insertを使わない、使うとTLE！
    l[j-1] += 1 

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

Submission status: Accepted

Solution code:
list = input().split(' ')
n = int(list[0])
k = int(list[1])
q = int(list[2])

score = [k - q] * n  # 最初にn人のスコアをk-q点で初期化
for i in range(q):
    a = int(input())
    score[a - 1] += 1  # 正解した人に1点を加える

for item in score:
    if(0 < item): print("Yes")  # 0より大きいスコアの場合、Yesを出力
    else: print("No")  # 0以下のスコアの場合、Noを出力

Submission status: Accepted

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

my_append = katen.append # appendを(間接的に)直接呼び出す
for i in range(q):
    my_append(int(input()))

for j in katen: # pop、insertを使わない、重要！
    l[j-1] += 1 

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

Submission status: Accepted

Solution code:
import numpy as np
n,k,q = map(int, input().split())
a = [int(input()) for i in range(q)]
win = [0 for _ in range(n)]
for ai in a:
  win[ai-1] += 1
for w in win:
  if k-q+w<=0: print('No')
  else: print('Yes')

Submission status: Accepted

Solution code:
import numpy as np
n,k,q = map(int, input().split())
a = [int(input()) for i in range(q)]
#cnt = [0 for _ in range(n)]
win = [0 for _ in range(n)]
#p = np.array([k for _ in range(n)])
for ai in a:
  win[ai-1] += 1
#print(win)

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
#print(n,k,q)
l = [0] * n
#print(l)
katen = []
my_append = katen.append
for i in range(q):
    my_append(int(input()))
#print(katen)

    
for j in katen:
    l[j-1] += 1 

    
#print(l)

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

Submission status: Accepted

Solution code:
n , k, q = list(map(int, input().split()))
ans = [int(input()) for i in range(q)]
points = [k for i in range(n)]
for i in ans:
    points[i - 1] += 1
new_points = list(map(lambda x:x - q, points))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N_nin, K_poi, Q_mon = list(map(int, input().split()))
Pt = [K_poi] * N_nin

for i in range(Q_mon):
    cor = int(input())
    Pt[cor-1] += 1


for i in range(N_nin):
    if (Pt[i] > Q_mon):
        print('Yes')
    else :
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict


def main():
    n, k, q = map(int, input().split())
    alist = [int(input()) for _ in range(q)]
    scores = [0] * n

    for winner in alist:
        scores[winner - 1] += 1

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, raw_input().split())

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

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

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


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

Submission status: Accepted

Solution code:
import numpy as np
 
def LI():
  return [int(s) for s in input().split()]
 
N,K,Q = LI()
Seikai_s = np.array([Q]*N)
 
for i in range(Q):
  seikai = int(input())
  Seikai_s[seikai-1]-=1
      
for i in range(N):
  if K-Seikai_s[i] > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter
n,k,q,*a=map(int,open(0).read().split())
s=[k-q]*n
ca=Counter(a)
for i in ca:
  s[i-1]+=ca[i]
for i in s:
  print("Yes" if i>0 else "No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
L=[Q*(-1)+K]*N

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

Submission status: Accepted

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

Submission status: Accepted

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

points = [K - Q] * N
for a in As:
    points[a - 1] += 1

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

Submission status: Accepted

Solution code:
import sys


def solve(inp):
    (N, K, Q) = map(int, inp.readline().strip().split(' '))
    A = [int(inp.readline().strip()) for i in range(Q)]

    wins = [0 for i in range(N)]
    for a in A:
        wins[a - 1] += 1

    for win in wins:
        if Q - win < K:
            print("Yes")
        else:
            print("No")

    return ""


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import groupby
N,K,Q = map(int,input().split())
Alist = [0 for i in range(Q)]
result = [(K-Q) for i in range(N)]
for i in range(Q):
    Alist[i] = int(input())
newAlist = list([list(g) for k,g in groupby(sorted(Alist))])

for i in range(len(newAlist)):
    result[newAlist[i][0]-1] = result[newAlist[i][0]-1] + len(newAlist[i])
for i in range(N):
    if result[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
p = int(k - q)
if p > 0:
    for _ in range(n): print("Yes")
else:
    a = {}
    for _ in range(q):
        a_i = str(input())
        if a_i not in a.keys():
            a[a_i] = 1
        else:
            a[a_i] += 1
    for i in range(1, n+1):
        if str(i) not in a.keys(): print("No")
        else: print("Yes") if p + a[str(i)] > 0 else print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#141
N, K, Q = map(int, input().split())

cnt = 0
P = [K - Q] * N
for i in range(Q):
    idx = int(input()) - 1    
    P[idx] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

    point = np.array([K for _ in range(N)])
    ct = np.array([Q for _ in range(N)])
    for i in range(Q):
        A = int(input())
        ct[A-1] = ct[A-1] - 1
    point = point - ct
    for p in point:
        if p < 1:
            print("No")
        else:
            print("Yes")
    return 0



if __name__ == '__main__':
    main()

Submission status: Accepted

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

if k - q > 0:
  res = ['Yes'] * n
else:
  res = ['No'] * n
  ans = [0] * n
  for i in range(len(a)):
    ans[a[i]-1] += 1
  for i in range(n):
    if k - q + ans[i] > 0:
      res[i] = 'Yes'
print('\n'.join(map(str, res)))

Submission status: Accepted

Solution code:
import numpy as np

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

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

Submission status: Accepted

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

score = [K-Q]*N

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

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

Submission status: Accepted

Solution code:
nkq = list(map(int, input().split()))
n, k, q = nkq[0], nkq[1], nkq[2]
attendees = dict()
for i in range(n):
    attendees[i] = 0

respondents = [int(input()) for i in range(q)]

for r in respondents:
    r_index = r - 1
    attendees[r_index] += 1

for i, p in attendees.items():
    point = p + k - q
    if point > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

l = [0] * N

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


K_ = [K] * N

fin = list(map(lambda x: "Yes" if x[0] - Q + x[1] > 0 else "No", zip(K_, l)))

print("\n".join(fin))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ans = '\n'.join('No'if x <=0 else 'Yes' for x in P[1:])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

for a_i in a_n:
    p_n[a_i-1] += 1

[print("Yes") if p_i > 0 else print("No") for p_i in p_n]

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n,k,q = map(int,input().split()) 
a=[]
for i in range(q):
    a.append(int(input()))

count = [k - q] * n #みんなからｑポイント引いとく
for i in range(q):
    count[a[i] - 1] += 1 #正解者に１ポイント足す
#print(count)
for i in range(n):
    if count[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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


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

    for x in A:
        pt[x-1] += 1

    for y in pt:
        if y >= 1:
            print('Yes')
        else:
            print('No')



main()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,k,q = LI()
    c = collections.Counter([I() for _ in range(q)])
    r = []
    for i in range(1,n+1):
        if q-c[i] >= k:
            r.append("No")
        else:
            r.append("Yes")

    return JA(r, "\n")


print(main())

Submission status: Accepted

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

a = [int(input()) for _ in range(q)]

b = [int(0) for _ in range(n)]

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

Submission status: Accepted

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

ai = [int(input()) for _ in range(q)]

bi = [k-q] * n

for a in ai:
    bi[a-1] += 1

for b in bi:
    if b > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

pi = {}

for i in range(1, n+1):
    pi.setdefault(i, k-q)

for i in range(1, q+1):
    ai = int(input())
    pi[ai]=pi[ai]+1

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import collections

n, k, q = [int(elem) for elem in input().split()]

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

res = [k - q] * n
c = collections.Counter(a_lst)
for k in c.keys():
  res[k - 1] += c[k]

for elem in res:
  if elem > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
l = [0 for i in range(n)]
#print(l)
for i in range(q):
 a = int(input())-1
 l[a] += 1

#print(l)

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

Submission status: Accepted

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

points = [k - q] * n

for answerer in a:
    points[answerer - 1] += 1

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

print('\n'.join(points))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
n,k,q=map(int,input().split())
point=[0]*n
for a in range(q):
    a=int(input())
    point[a-1]+=1
#print(point)
for i in point:
    if i>q-k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
N, K, Q = map(int, input().split())
L = [0] * N
for i in range(Q):
    a = int(input()) - 1
    L[a] += 1
for i in range(N):
    tmp = K - Q + L[i]
    if tmp > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
a=[]
for i in range(q):
    a.append(int(input()))
import collections
c=collections.Counter(a)
c=list(c.items())
p=[0]*n
for i in c:
    p[i[0]-1]=i[1]
line=1-(k-q)
for i in p:
    if i>=line:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q = 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 Q-B[i]>=K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

th = q - k

result = list(map(lambda x: 'Yes' if x > th else 'No', pt))
print('\n'.join(result))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

A = [0] * n

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
n,k,q=map(int,input().split())
a=[]
ones=np.ones((1,n,))
point=k*ones
de_point=-q*ones
for i in range(q):
    num=int(input())
    de_point[0,num-1]=de_point[0,num-1]+1
point=point+de_point
for i in range(n):
    if point[0,i]>0:
        print("Yes")
    elif point[0,i]<=0:
        print("No")

Submission status: Accepted

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

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

for i in range(Q):
    Ans_i[A_i[i] - 1] += 1

for i in range(N):
    if Ans_i[i] > Q - K:
        print("Yes")

    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

for num in point:
    if num > 0:
        print('Yes')
        continue
    print('No')

Submission status: Accepted

Solution code:
import collections

N, K, Q = [int(_) for _ in input().split()]
d = collections.defaultdict(int)

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import numpy as np
N,K,Q = list(map(int,input().split(" ")))
A = np.full(N,K)
A -= Q
for i in range(Q):
    B = int(input())
    A[B - 1] += 1
for i in A:
    if i < 1:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

import collections
c = collections.Counter(A)
c_i=c.items()

m=[K-Q]*N
for i in c_i:
    m[i[0]-1]=m[i[0]-1]+i[1]
o=[]

for i in m:
    if i<=0:
        o.append('No')
    else:
        o.append('Yes')
print('\n'.join(o))

Submission status: Accepted

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

N = [k]*n
Q = [q]*n
l = [0]*n
for i in a:
    l[i-1] += 1
hiku = [x-y for (x, y) in zip(Q, l)]
result = [x-y for (x, y) in zip(N, hiku)]
for i in result:
    if i>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N,K,Q=(int(x) for x in input().split())
a=[int(input()) for i in range(Q)]#正解者
l=[]
for j in range(N):
    l.append(K-Q)
for k in range(Q):
  l[a[k]-1]+=1

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

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A_list = [int(input()) for _ in range(Q)]
ans = [K]*N
con = [0]*N

for i in A_list:
    con[i-1] += 1

ans = [x+y-Q for (x,y) in zip(ans,con)]

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

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())
each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
# inp1 = input()
# n = int(inp1.split(" ")[0])
# k = int(inp1.split(" ")[1])
# q = int(inp1.split(" ")[2])

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