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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import sys
# input = sys.stdin.readline
sys.setrecursionlimit(100000)
MOD = 10 ** 9 + 7

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

A_dic = collections.Counter(A_list)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
num_member, life, num_question = [int(s) for s in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

p = [0] * N
# p = np.array(p)

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

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

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

Submission status: Accepted

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

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

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

# shakayamiさんのコードを参考にしました
# for文が入れ子になると遅くなるから，出来るだけそうしない

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

    diff = int(q) - int(k)

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


if __name__ =="__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split());p=[k-q]*n
for i in range(q):p[int(input())-1]+=1
for i in range(n):print("YNeos"[p[i]<=0::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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)])

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

tokuten=[0]*n

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# C - Attack Survival
n,k,q= map(int, input().split())

list = [0] * n

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

for j in range(n):

    if(k - q + list[j] > 0):
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

list_winner=[]

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

#番号iの参加者が何回正解したかを格納する配列
b = [0]*n

#番号iの参加者が何回正解したかをカウントしていく
for i in a:
    #↑参加者は1〜N番なのに対して、配列は0〜N-1なので、
    #b[i-1] += 1というようにしている。
    b[i-1] += 1


for i in range(n):
    #i番目の参加者が何点引かれるか計算
    minus_point = q - b[i]
    #それが持ち点（K点）を超えてなければ勝ち
    if k - minus_point > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

# 正答者を記録
for i in range(Q):
	gained_points[int(input()) - 1] += 1

# 点数計算
for i in range(N):
	charanger_points[i] -=  Q - gained_points[i]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,Q = [int(X) for X  in input().split()]
scores = [0 for i in range(N)]
for k in range(Q):
  q = int(input()) -1
  scores[q] +=1
  
for score in scores:
  if score >= Q - K + 1:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
# N:人数, K:初期ポイント, Q:クイズ数
N, K, Q = map(int,input().split())

s = K-Q

points = [s] * N

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

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

Submission status: Accepted

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

score = [Q-K] * N

for i in range(K):
  score[int(input())-1] += 1
for i in score:
  if i > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,Q = [int(i) for i in input().split(' ')]
pointList = [K-Q for _ in range(N)]

for _ in range(Q):
    answer = int(input())
    pointList[answer-1] += 1
    
for point in pointList:
    if point <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
N, K, Q = list(map(int, input().split()))
Alist = [int(input()) for i in range(Q)] 
Slist=[0]*N
for i in Alist:
  Slist[i-1]+=1
L=Q-K
for i in range(N):
  if Slist[i]>L:
    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)]

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

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

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

Submission status: Accepted

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


Slist=[0]*N


for i in Alist:

  Slist[i-1]=Slist[i-1]+1

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

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
import copy

def main():
    n, k, q = [int(t) for t in input().split()]
    dat = [k-q for _ in range(n)]
    for i in range(q):
        a = int(input())
        a -= 1
        dat[a] += 1

    print(*["Yes" if t > 0 else "No" for t in dat], sep="\n")


    return 0

if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

Solution code:
from collections import Counter
 
N, K, Q = list(map(int, input().split()))
Alist = [int(input()) for i in range(Q)] 
cnt = Counter(Alist)
 
for i in range(1, N + 1):
    print('Yes' if Q - cnt[i] < K else 'No')

Submission status: Accepted

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

for item in A:
    p[item-1] += 1

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
#全問不正解者を基準にする
ans = [int(input()) for _ in range(q)]
l = [k-q]*n

for a in ans:
  #正解者に+１する
  l[a-1]+=1
for i in l:
  #全ラウンド終了後の結果を出力
  if i>0: print("Yes")
  else: print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int, raw_input().split())
K_list = [Q-K]*N
for i in range(0,Q):
  index = int(raw_input())
  K_list[index-1] = K_list[index-1] -1

for i in K_list:
  if 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)]
x=[]
for i in range(n):
    x.append([i,k-q])
for i in range(q):
    x[a[i]-1][1]+=1
for i in range(n):
    if x[i][1]<1:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p=input().rstrip().split(' ')
l=[int(p[1])]*int(p[0])
q=[0]*1000000;
for i in range(0,int(p[2])):
    o=int(input())
    q[o-1]+=1;
for i in range(0,int(p[0])):
    A=int(p[2])-q[i];
    l[i]-=A;
#print(l)
for i in range(0,len(l)):
    if l[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 j in range(N):
  if A[j] > Q-K :
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
l = []
for i in range(q):
    l.append(int(input()))
s = []
d = {}
for i in l:
    if(i in d):
        d[i]+=1
    else:
        d[i]=1
for i in range(1,n+1):
    if (i in d):
        continue
    else:
        d[i] = 0
for i in range(1,n+1):
    if(k+d[i]-q)>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

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

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

Submission status: Accepted

Solution code:
def main():
  N, K, Q = map(int, input().split()) # スペース区切り入力
  A = [int(input()) for i in range(Q)]  # 1つずつ連続入力
  # print(N)
  # print(A)
  # 参加者はN人、Kポイントを持つ
  # A[i]は正解者の番号
  # 全員からQ引いて、A[i]番目の参加者に1を足す
  # 正ならYes、else No
  first = [K for i in range(N)]
  # print(first)
  second = list(map(lambda x: x - Q, first))
  # print(second)
  for i in range(Q):
    second[A[i]-1] += 1

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


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
#141c
N,K,Q = map(int, input().split()) #1≤N≤10^5 , 1≤Q≤10^5
point_list=[K-(1*Q)]*N #最初から正解者以外の文の減算をしておく

for i in range(Q):
    A = int(input())
    point_list[A-1] += 1 #減算分を戻す
#このラウンドの参加者は N 人であり、1 から N までの番号がついています。ラウンド開始時点では全員が Kポイントを持っています。
#誰かが問題に正解すると、その人以外の N−1人のポイントが 1減ります。これ以外によるポイントの変動はありません。
#ラウンド終了時にポイントが 0以下の参加者は敗退し、残りの参加者が勝ち抜けます。
#このラウンドでは Q回の正解が出て、i 番目に正解したのは参加者 Ai でした。

#N 行出力してください。i 行目には、参加者 i が勝ち抜けたなら Yes を、敗退したなら No を出力してください。
for i in range(N):
    if point_list[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

score = [k - q]*(n+1)

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

for i in range(1, n+1):
  if score[i] > 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):
	j=int(input())
	L[j-1]+=1

for k in range(N):
	if K-(Q-L[k])>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)]
point = []
ans = []

for z in range(n):
  point.append(0)

for j in range(q):
  point[int(a[j])-1] += 1
  
for x in range(n):
  if point[x] > q-k:
    ans.append('Yes')
  else:
    ans.append('No')
  print(ans[x])

Submission status: Accepted

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

a_p = []
for i in range(N):
    a_p.append(Q)

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

result = []
for i in range(N):
    result.append(K - a_p[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())
l = [0]*n
l2 = []
for i in range(q):
    l[int(input())-1] += 1
for i in range(0,n):
    if k + l[i] - q>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
A = []
for q in range(Q):
    a = int(input())
    A.append(a)
points2 = np.zeros(N)
for a in A:
    points2[a-1] += 1
results = []
for p in points2:
    if K - (Q - p) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# Input
s = [input() for i in range(1)]

N = int(s[0].split()[0])
K = int(s[0].split()[1])
Q = int(s[0].split()[2])

# 正解した者の番号の列
A = [int(input()) for i in range(2, Q+2)]

# スタート時のポイント初期値
B = [K-Q for i in range(N)]

# 各参加者の正解数をカウントする
for i in range(Q):
    B[A[i]-1] = B[A[i]-1] + 1

# Output
for i in range(N):
    if B[i] > 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)]
ans = [K - Q] * N


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

Submission status: Accepted

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

for ai in A:
    sanka[ai-1] += 1

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

Submission status: Accepted

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

participant_list = [K-Q] * N
# print(participant_list)

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

Submission status: Accepted

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

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

for key,val in enumerate(data):
  if val + k - q > 0:
    index = int(key)
    res[index] = 1
for i in res:
  print('Yes' if i else 'No')

Submission status: Accepted

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

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