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:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n,k,q = readmi()
t = [0] * n
for i in range(q):
    s = readi()
    t[s - 1] += 1
for i in t:
    p = k - q + i
    if p >= 1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n ninzu
#k HP
#q seikai no kazu

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

for _ in range(q):
  temp=int(input())
  if temp in r:
    r[temp]+=1
  else:
    r[temp]=1

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

Submission status: Accepted

Solution code:
import collections
N,K,Q=map(int,input().split())
P=[K]*N
M=[Q]*N
A=[int(input()) for _ in range(Q)]
for a in A:
  M[a-1]-=1
C=[p-m for (p,m) in zip(P,M)]
for c in C:
  if c>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

#b_list = list(map(int,input().split()))
#print(" ".join(map(str,c_list)))

for i in range(q):
    a = int(input())
    list_a[a-1] += 1
for i in range(n):
    if list_a[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)]
R = [0] * N
for i in A:
  R[i-1] += 1
for j in R:
  if K - Q + j > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

for i in range(Q):
    data[ans_data[i]-1] += 1
    
#print(data)

for i in range(N):
    if data[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):
    i = int(input())
    a[i - 1] += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import *
import sys
inp = raw_input

def err(s):
    sys.stderr.write('{}\n'.format(s))

def ni():
    return int(inp())

def nl():
    return [int(_) for _ in inp().split()]

N, K, Q = nl()
A = [ni() for _ in range(Q)]

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

for a in A:
    a -= 1
    Score[a] += 1
for i, s in enumerate(Score):
    if s > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools

INF = 10 ** 10

# N, Q <= 10^5
N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(stdin.readline().rstrip()) for _ in range(Q)] 

point = [K] * (N+1)

for Ai in A:
    point[Ai] += 1

res = list(map(lambda x: x - Q, point))

for r in res[1:]:
    if r <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

for answer in A:
    point_list[answer - 1] += 1

for point in point_list:
    if point <= 0:
        print('No')
    else:
        print('Yes')

#print(point_list)

Submission status: Accepted

Solution code:
import numpy as np

n, k, q = [int(v) for v in input().split()]
winners = [int(input()) - 1 for _ in range(q)]
points = np.array([k for _ in range(n)]) - q

for winner in winners:
    points[winner] += 1

for res in np.where(points <= 0, 'No', 'Yes'):
    print(res)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:

import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
##############################

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

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

for c in P:
    print('Yes' if c > 0 else 'No')

Submission status: Accepted

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

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

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


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

Submission status: Accepted

Solution code:
N,K,Q = [int(i) for i in input().split()]
A = []
for q in range(Q):
    A.append(int(input()))
from collections import defaultdict as df
cnt = df(int)
for a in A:
    cnt[a] += 1
for n in range(N):
    if K - Q + cnt[n+1] > 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) ]
B = [K-Q]*N
for i in range(Q):
    B[A[i]-1] += 1
for i in range(N):
    if B[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
import numpy as np

N, K, Q = map(int, input().split())
A_list = np.full(N, K)
A_ans = np.zeros(N)
for i in range(Q):
    a = int(input()) - 1
    A_ans[a] += 1
A_list = A_list - Q + A_ans

#print(A_list)

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

Submission status: Accepted

Solution code:
import sys
import heapq
import bisect

mod = 10**9+7
dd = ((-1,0),(1,0),(0,-1),(0,1))

def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def S(): return((list(sys.stdin.readline()))[:-1])
def IR(n): return([I() for _ in range(n)])

def GCD(a,b):
    while b!=0:
        a,b = b,a%b
    return a

def LCM(a,b):
    return a * b // GCD(a,b)

def main():
    N,K,Q = LI()
    A = IR(Q)

    point = [K-Q for _ in range(N)]
    for a in A:
        point[a-1] += 1

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N,K,Q = inputMap()
	A = []

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

	for i in range(Q):
		tmp = inputInt()
		mem[tmp-1] += 1

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

	for i,val in enumerate(mem):
		ans[i] += val
		if ans[i] <= 0:
			print("No")
		else:
			print("Yes")




if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
N,K,Q=map(int,input().split())#K>Q-正解数
A=[int(input())-1 for i in range(Q)]#0-indexed
C=Counter(A)
for i in range(N):
  if K>Q-C[i]:
    print("Yes")
  else:print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# input

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

score = [k-q] * n

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter

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

Submission status: Accepted

Solution code:
from collections import defaultdict

n,k,q = list(map(int,input().split()))
d = defaultdict(int)
for _ in range(q):
    t = int(input())
    d[t-1] += 1

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

Submission status: Accepted

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

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

for i in map(lambda x:['No','Yes'][x>0],score):
    print(i)

Submission status: Accepted

Solution code:
import numpy as np
import math
import sys
sys.setrecursionlimit(10000000)

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

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

    


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
M = {i:K for i in range(N)}
# print(M)
for q in range(Q):
    M[int(input())-1] += 1

for n in range(N):
    M[n] -= Q

for k in M:
    if M[k] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    win_point = [0 for i in range(N)]
    for winner in A:
        win_point[winner - 1] += 1

    result = [K for i in range(N)]
    for i in range(N):
        result[i] = result[i] - Q + win_point[i]
    for i in result:
        if i > 0:
            print('Yes')
        else:
            print('No')
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

for s in score:
    if s - Q <= 0:
        ans = "No"
    else:
        ans = "Yes"
    print(ans)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in p:
    if i > q - k:
        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
    A[a] += 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 i in range(Q):
    tmp = int(input())
    A[tmp-1] += 1

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

Submission status: Accepted

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

kq = K-Q
P = [0]*N
for i in range(Q):
    a = int(input())
    P[a-1] += 1
    
for i in range(N):
    p = P[i]
    if P[i]+kq > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import collections

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

C = collections.Counter(A)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
li=[q]*n
for i in range(q):
    li[a[i]-1]-=1

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

Submission status: Accepted

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

for i in range(n):
    if point[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)]
point=[K]*(N+1)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

for i in s:
    if k - q + i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
def InputToInt():
    A = input().split()
    for i in range(len(A)):
        A[i] = int(A[i])
    return A
    
if __name__ == '__main__':
    N, K, Q = InputToInt()
    S = [K-Q]*N
    for i in range(Q):
        S[int(input())-1] += 1
    for i in range(N):
        if S[i] > 0:
            print('Yes')
        else:
            print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

import sys
def input():
	return sys.stdin.readline().strip()

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:


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

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


score = [k-q]*n

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

ret = ["Yes" if si>0 else "No" for si in score]

for i in range(n):
  print(ret[i])

Submission status: Accepted

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

Submission status: Accepted

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

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

start = k-q
A = [start]*n

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

for a in A:
    if a > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

  

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

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
A=[]
for i in range(Q):
    A.append(int(input()))
B=[0]*100006
#print(A)
#print(B)
for i in range(Q):
    B[A[i]]+=1

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

Submission status: Accepted

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

ans = [K-Q] * N

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for answered in answered_list:
    if K-Q+answered > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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


for a in l:
    if a > 0:
        print('Yes')

    else:
        print('No')

Submission status: Accepted

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

for num in nums:
	ans[num - 1] += 1

print('\n'.join(map(str, ["Yes" if x > 0 else "No" for x in ans])))

Submission status: Accepted

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

point = [k for i in range(n)]

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

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline

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

main()

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

Solution code:
# ABC141
from collections import Counter


def main():
    N, K, Q, *A = map(int, open(0).read().split())
    C = Counter(A)
    ans = []
    for i in range(1, N + 1):
        x = "Yes" if K - Q + C[i] > 0 else "No"
        ans.append(x)
    print("\n".join(ans))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 15 20:38:18 2019

@author: Yamazaki Kenichi
"""

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

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

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

for s in score:
    if Q - s < K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

for j in range(N):
  print(("No","Yes")[res[j]>0])

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
player={i+1:0 for i in range(n)}
for i in list(int(input()) for i in range(q)):
    player[i] +=1

for v,m in player.items():
    if m>q-k:
        print("Yes")
    else:print("No")

Submission status: Accepted

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

sys.setrecursionlimit(10**7)
inf=10**20
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 [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

# Summarize count of factor within list
def summarize_list(l):
  sl=sorted(l,reverse=True)

  a=sl[0]
  c=1
  res=[]

  for x in sl[1:]:
    if x==a:
      c+=1
    else:
      res.append([a,c])
      a=x
      c=1
  res.append([a,c])

  return res

def main():
  n,k,q=LI()
  l=[I() for _ in range(q)]

  l=summarize_list(l)
  # print(l)

  for i in range(n):
    x=i+1

    if len(l)>0 and l[-1][0]==x:
      if l[-1][1]+k-q>0:
        print('Yes')
      else:
        print('No')
      l.pop()
    else:
      if k-q>0:
        print('Yes')
      else:
        print('No')

main()
# print(main())

Submission status: Accepted

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

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

c=collections.Counter(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(stdin.readline().rstrip()) for _ in range(Q)]

score = [0] * N

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

for s in score:
    if s > Q - K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q,*A=map(int,open(0).read().split());L=[K-Q]*N
for a in A:L[a-1]+=1
for l in L:print("YNeos"[l<1::2])

Submission status: Accepted

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

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