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

Submission status: Accepted

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

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

for a in a_list:
    if q-a < k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

d = {}
for i in range(N):
    d[i+1] = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
input = sys.stdin.readline
sys.setrecursionlimit(10**7)

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

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

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


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

Submission status: Accepted

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

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

if __name__ == '__main__': main()

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [0 for i in range(Q)]
for i in range(Q):
    A[i] = int(input())
    
map_rights = {}
for i in range(Q):
    if A[i] not in map_rights:
        map_rights[A[i]] = 1
    else:
        map_rights[A[i]] += 1
        
for i in range(1, N + 1):
    rights = 0
    if i in map_rights:
        rights = map_rights[i]
    if K - Q + rights > 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)]

ans = [Q for _ in range(N)]

for i in range(Q):
    p = A[i]
    ans[p-1] -= 1

for i in range(N):
    if ans[i] < K:
        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)]

b = [0] * (10**5 + 1)
for x in a:
  b[x] += 1

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

Submission status: Accepted

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

c = collections.Counter(A)
for i in range(N):
    if c[i] > Q - K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# coding=utf-8

if __name__ == "__main__":
    N, K, Q = map(int, input().split())

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

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

    score = [elm - Q for elm in score]

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

Submission status: Accepted

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

cnt = [0] * N
for _ in range(Q):
    Ai = int(input()) - 1
    cnt[Ai] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict

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

# 耐えた回数
G = defaultdict(int)
for i in range(Q):
    G[int(input())] += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():
    N, K, Q = map(int, input().split())
    S = [0]*N

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

    T = Q - K + 1

    for s in S:
        print('Yes' if s >= T else 'No')




if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N,K,Q = map(int,input().split())
    A = [int(input()) for _ in range(Q)]
    Ans = ["Yes"]*N
    scores = [K]*N
    for a in A:
        scores[a-1] += 1 
    for i in range(N):
        if scores[i] <= Q:
            Ans[i] = "No"
    print(*Ans,sep = "\n")
    return
main()

Submission status: Accepted

Solution code:
from collections import Counter

N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
count = Counter(A)
win = ["Yes" if K >= Q + 1 else "No"] * N
for a, n in count.items():
    win[a - 1] = "Yes" if n >= Q - K + 1 else "No"
print("\n".join(win))

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
point = []
for i in range(N+1):
    point.append(K- Q)
    
for i in range(Q):
    num = int(input())
    point[num] += 1
    
for i in range(1, N+1):
    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 _ in range(Q)]

points = [K-Q] * N
for a in A:
    points[a-1] += 1
for p in points:
    print('Yes' if p > 0 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

seikai = [0] * N

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

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

Submission status: Accepted

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

from collections import Counter
need = q - k
c = Counter(arr)

for i in range(n):
    if need < c[i+1]:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

k_list = [K-Q]*N
for i in A_list:
    k_list[i-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())
Scores = [K - Q] * N
for i in range(Q):
    Scores[int(input()) - 1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

        dic = {}
        for a in A:
            dic[a] = dic.get(a, 0) + 1

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


# Run main
if __name__ == '__main__':
    AtCoder().main()

Submission status: Accepted

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

lose_point = Q - K

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

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

for i in range(N):
    if ls[i] <= lose_point:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():
    N, K, Q = map(int, input().split())
    P = [0] * N

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

    for Pi in P:
        Pt = K - Q + Pi
        if Pt > 0:
            print( "Yes" )
        else:
            print( "No" )

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000)
from math import factorial, ceil, floor
from bisect import bisect_right as bsr
from operator import itemgetter as ig
from collections import defaultdict as dd
from collections import deque, Counter as cnt

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)
def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]
def nlist(n, v):
    if not n: return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]

# エントリーポイント
def main():
    N, K, Q = input([int, 3])
    A = input([int, Q])

    ps = [0] * (N + 1)
    max_p = 0
    for a in A:
        ps[a] += 1
        max_p = max(max_p, ps[a])
    
    for p in ps[1:]:
        if p <= (Q - K):
            print("No")
        else:
            print("Yes")
    return

if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
cnt = [0] * n
for i in range(q):
    num = int(input())
    cnt[num - 1] += 1
for i in range(n):
    if k - (q - cnt[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)]
p = [0] * N
for i in A:
    p[i - 1] += 1

ans = [x + K - Q for x in p]

for i in ans:
    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)]

num=[0]*n
for a in A:
    num[a-1]+=1

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

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
al = [k-q]*n
for _ in [0]*q:
  a = int(input())
  al[a-1] += 1
for i in al:
  if 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()))
  
po = [0]*n

for i in A:
  po[i-1] += 1
  
for i in po:
  if i > q-k:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
import sys; from collections import deque; readline = sys.stdin.readline;

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

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

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

totalWins = sum(wins)

for n in range(N):
    if K - (totalWins - wins[n]) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

vN = [0,] * N

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


for n in vN:
    res = K > Q - n
    print(("No", "Yes")[res])

Submission status: Accepted

Solution code:
def solve():
  import sys
  import math

  sys.setrecursionlimit(10**7)
  readline=sys.stdin.readline

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

    
if __name__ == '__main__':
  solve()

Submission status: Accepted

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

seikai = [0] * N

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

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n,k,q = na()

a = [0]*n

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

b = [k-q+i for i in a]

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

Submission status: Accepted

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

#人数文
a=[k for i in range(n)]

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

#問題数だけ引く
for i in range(n):
    a[i] -= q
    
#出力
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())

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

map_ = [0]*n

for ai in aq:
    map_[ai-1] += 1


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc141/abc141_c
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N, K, Q = i2nn()
    player = [0] * N
    for _ in range(Q):
        a = i2n() - 1
        player[a] += 1
    for p in player:
        print('Yes' if p + K > Q else 'No')
    return

main()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

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

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

main()

Submission status: Accepted

Solution code:
# ここから
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(1000000)
from collections import Counter

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

    counter = Counter(a)

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


resolve()

Submission status: Accepted

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

from collections import Counter

c = Counter(A)

thre = Q - K
for n in range(1, N + 1):
    if c[n] > thre:
        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())
	p[a-1] += 1

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

Submission status: Accepted

Solution code:
import sys
import bisect
MAX_INT = int(10e12)
MIN_NUM = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N,K,Q = IL()
a = [I() for i in range(Q)]

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

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

Submission status: Accepted

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

for i in range(1, N+1):
  if Q - p[i] < K:
    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)]

B = [0]*N
for a in A:
    B[a] += 1
for b in B:
    if K-(Q-b)>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

point_list = [0]*n

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,Q = [int(x) for x in input().split()]
# 最終的に減点されるポイント
hiku = [Q for _ in range(N)]
for i in range(Q):
    Ai = int(input())
    hiku[Ai-1] -= 1
for x in hiku:
    x = K-x 
    if x > 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)]
lst = [k-q]*(n+1)
for i in a:
  lst[i] += 1
for i in range(1,n+1):
  if lst[i] > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)

def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():
    N, K, Q = [int(n) for n in input().split()]
    A = [0 for _ in range(N)]
    for _ in range(Q):
        A[int(input())-1] += 1
    for i in range(N):
        if Q - A[i] < K:
            print("Yes")
        else:
            print("No")



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())  # N人の参加者, Kポイント, Q回数の正解

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

count = {}
for i in range(1, N+1):
    count.setdefault(i, 0)

for i in range(len(A)):
    count[A[i]] += 1

for sanksya, score in count.items():
    if K - Q + score > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections

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

#print(A)

p=[(K-Q)]*N
for a in A:
    p[a-1]+=1

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

Submission status: Accepted

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

res = [0]*n

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for a in A:
  a -= 1
  points[a] += 1
  
for point in points:
  if point > 0: print('Yes')
  else: print('No')

Submission status: Accepted

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

if __name__ == "__main__":
    f_c()

Submission status: Accepted

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

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

for each in points:
    if each  > q - k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = [int(x) for x in input().split()]
xs      = [0] * (n + 1)

for _ in range(0, q):
	xs[int(input())] += 1

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

Submission status: Accepted

Solution code:
input = raw_input

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections as c
ip = lambda : map(int, input().split())
# ##############
N,K,Q = ip()
am = {}
for i in range(Q):
    a = int(input())
    am[a] = am.get(a,0) + 1
for i in range(1,1+N):
    if K - Q + am.get(i,0) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

    for a in A:
        if a > 0:
            print("Yes")
        else:
            print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K,Q = [int(x) for x in input().split()]
quiz = []
for i in range(Q):
  quiz.append(int(input()))
score = [K-Q]*N
for i in range(len(quiz)):
  score[quiz[i]-1] += 1
for i in range(len(score)):
  if score[i]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

point = [k] * n

for i in range(q):
    s = int(input())
    s = s-1
    point[s] += 1
    
for i in range(n):
    if point[i] <= q:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
 
n,k,q = [int(x) for x in stdin.readline().rstrip().split()]
p_lst = [k] * n
p_t_lst = [0] * n

for i in range(q):
  a = int(stdin.readline().rstrip())
  p_t_lst[a-1] += 1

p_lst = np.array(p_lst) + np.array(p_t_lst) - q

for p in p_lst:
  if p <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N, K, Q = map(int, input().split())
    P = [0] * N
    for _ in range(Q):
        a = int(input())
        P[a-1] += 1

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

d = collections.defaultdict(int)
for ai in a:
    d[ai - 1] += 1

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

Submission status: Accepted

Solution code:
def main():    
    n,k,q = map(int,input().split())
    a = [int(input())-1 for i in range(q)]
    current_point = [k]*n
    minus_point = [q]*n
    for i in a:
        minus_point[i] -= 1
    for i in range(n):
        if current_point[i] <= minus_point[i]:
            print("No")
        else:
            print("Yes")
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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

for _ in range(q):
  a = int(input())-1
  ls[a] += 1
for z in ls:
  if z<=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)]
Point = [0 for i in range(n)]
for i in range(q):
    Point[A[i]-1] += 1
for i in range(n):
    if k-q+Point[i]>0:
        print('Yes')
    else:
        print('No')