Problem:


Score: 300 points

Problem Statement

Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.

A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.

When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.

At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.

In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.
For Kizahashi, write a program that determines whether each of the N players survived this game.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq K \leq 10^9

1 \leq Q \leq 10^5

1 \leq A_i \leq N\ (1 \leq i \leq Q)

Input

Input is given from Standard Input in the following format:

N K Q
A_1
A_2
.
.
.
A_Q

Output

Print N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.

Sample Input 1

6 3 4
3
1
3
2

Sample Output 1

No
No
Yes
No
No
No

In the beginning, the players' scores are (3, 3, 3, 3, 3, 3).

Player 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).

Player 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).

Player 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).

Player 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).

Players 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.

Sample Input 2

6 5 4
3
1
3
2

Sample Output 2

Yes
Yes
Yes
Yes
Yes
Yes

Sample Input 3

10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

Sample Output 3

No
No
No
No
Yes
No
No
No
Yes
No



Sample input:
6 3 4
3
1
3
2


Sample output:
No
No
Yes
No
No
No

Submission status: Accepted

Solution code:
import copy

def j(n):
    if n:print("Yes")
    else:print("No")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)


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

Submission status: Accepted

Solution code:
n, k , q = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(q):
    ans[int(input())-1] += 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())
A = [int(input()) for i in range(Q)]
ANS = [0]*N
for a in A:
    ANS[a-1]+=1
for d in ANS:
    print("Yes" if K+d>Q else "No")

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

a = [0]*n

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC141 C

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n,k,q = LI()
cnt = [0]*n
for _ in range(q):
    a = I()
    cnt[a-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 = 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):
  ans[i] = k - q + ans[i]
  if ans[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):
  b=int(input())
  a[b-1]+=1
for i in range(n):
  if k-q+a[i]>0:print("Yes")
  else:print("No")

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
ts=time.time()
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
show_flg=False
show_flg=True

n,k,q=MI()
a=[]
p=[k-q]*n
for i in range(q):
    a.append(I())
    
while a:
    x=a.pop()
    p[x-1]+=1

for i in range(n):
    if p[i]>0:
        an=0
    else:
        an=1
        
    print(YN[an])

Submission status: Accepted

Solution code:
N, K, Q, *A = map(int, open(0).read().split())

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

for b in B[1:]:
    if b > 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)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections import Counter
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    c = Counter(A)
    for i in range(1, N+1):
        if K-(Q-c[i]) > 0:
            yes()
        else:
            no()
    return


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:
def main():
    import sys
    input = sys.stdin.readline
    
    N,K,Q = map(int,input().split())
    from collections import defaultdict
    D = defaultdict(int)
    for i in range(Q):
        A = int(input())
        D[A] += 1
    for i in range(1,N+1):
        p = D[i]
        if K+p-Q>0:
            print("Yes")
        else:
            print("No")
    
    
    
main()

Submission status: Accepted

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

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

n, k, q = (int(i) for i in input().split())
point=[0]*n
for i in range(q):
    an=int(input())
    point[an-1]+=1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

for inp in range(q):
    a=int(input())
    AC[a]+=1

for score in AC[1:]:
    if q-score>=k:
        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)]

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

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

Submission status: Accepted

Solution code:
#
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections import Counter
YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    c = Counter(A)
    for i in range(N):
        if K - Q + c[i+1] > 0:
            print(YES)
        else:
            print(NO)


# 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())
A = [int(input()) for i in range(Q)]

pts = [K-Q] * N
for a in A:
    pts[a-1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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

    cntA = Counter(A)

    ans = []
    for i in range(1, N + 1):
        if K - (Q - cntA[i]) > 0:
            ans.append('Yes')
        else:
            ans.append('No')

    print(*ans, sep='\n')


sol()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))

#################

N,K,Q = II()
A = [I() for _ in range(Q)]

count = [K-Q]*N

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

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n,k,q = inpl()
a = inpln(q)
d = defaultdict(int)
for i in range(q):
    d[a[i]] += 1
for i in range(1,n+1):
    # print(d[i])
    if q - d[i] < k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

for ans in ANS:
    if ans>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 = [k-q] * n
for i in range(q):
    P[A[i]-1] += 1
for i in range(n):
    if P[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

    t = [Q] * N

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

l = [k - q for _ in range(n)]
for i in a:
    idx = i - 1
    l[idx] += 1

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

Submission status: Accepted

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

score = [0] * n

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)

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

def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [0] * N
    for j in range(Q):
        p[A[j] - 1] += 1
    for i in range(N):
        if K - Q + p[i] > 0:
            print(YES)
        else:
            print(NO)
    return


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

points = [K-Q] * N

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

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

Submission status: Accepted

Solution code:
from collections import Counter
import sys
def input():
	return sys.stdin.readline()[:-1]


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 q - c[i] >= k:
		print("No")
	else:
		print("Yes")

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    s = input()
    if s == "Sunny":
        print("Cloudy")
    elif s == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")
    return

#B
def B():
    s = S()
    for i in range(len(s)):
        if i%2:
            if s[i] not in ["L","U","D"]:
                print("No")
                return
        else:
            if s[i] not in ["R","U","D"]:
                print("No")
                return
    print("Yes")
    return

#C
def C():
    n,k,q = LI()
    a = IR(q)
    f = [k-q]*(n)
    for i in range(q):
        ai = a[i]-1
        f[ai] += 1
    for i in f:
        if i <= 0:
            print("No")
        else:
            print("Yes")
    return

#D
def D():

    return

#E
def E():

    return

#F
def F():

    return

#Solve
if __name__ == "__main__":
    C()

Submission status: Accepted

Solution code:
from collections import defaultdict

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

d = defaultdict(int)
for a in A:
    d[a] += 1

for i in range(1, N + 1):
    if d[i] > Q - 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)]
x=[k-q for _ in range(n)]
for t in a:
	x[t-1]+=1
for t in x:
	if t>0:
		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):
    point[int(input())-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())
l=[-q for i in range(n)]
for i in range(q):
  m=int(input())
  l[m-1]=l[m-1]+1
for i in range(n):
  l[i]+=k
for i in range(n):
  if l[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from collections import defaultdict
import sys
#input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))

N, K, Q = inpl()
X = [0]*N
for _ in range(Q):
    X[int(input())-1] += 1

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque


def main():
    num, k, q_num = map(int, input().split())
    data = [int(input()) for i in range(q_num)]

    now_num = 0
    dp = [k for i in range(num + 1)]
    seikai = [0 for i in range(num + 1)]
    for i in range(q_num):
        seikai[data[i]] += 1

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import Counter

n, k, q = list(map(int, input().split()))
aaa = list(map(int, sys.stdin))
cnt = Counter(aaa)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().split())
A = tuple([int(input()) for q in range(Q)])
# N人参加、初期状態で全員がKポイント
# 誰かが正解すると、それ以外の全員が1ポイント下がる
# i番目に正解したのはAi
counts = [0 for i in range(Q)]
for a in A:
  counts[a-1] += 1

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

Submission status: Runtime Error

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

if K > Q:
    ans = ["Yes" for i in range(N)]
print(ans)
exit()

T = [0 for i in range(N)]
t = Q - K

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

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

Submission status: Runtime Error

Solution code:
eople,point,quiz = map(int,input().split())
an = [int(input()) for _ in range(quiz)]
each_p = [point-quiz] * people

for x in an:
    each_p[x-1] += 1

for y in each_p:
    if y <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Sep  9 15:18:03 2020

@author: liang
"""
N, K, Q = map(int, input().split())
A = [0]*N
for i in range(Q):
    t = int(input())
    A[t-1] += 1

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

start = [k - q] * n
for i in range(q):
    start[A[i]] += 1

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

Submission status: Runtime Error

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

for i in range(1,n+1):
  ans=k
  for j in range(q):
    que=int(input())
    if que!=i:
      ans-=1
    if ans<=0:
      break
  if ans<=0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

for i in range(1,n+1):
  ans=k
  for que in l:
    if que!=i:
      ans-=1
  if ans<=0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

for i in range(1,n+1):
  ans=k
  for j in range(q):
    que=int(input())
    if que!=i:
      ans-=1
  if ans<=0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

m=[0]*n

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

for j in range(n):
  m[j]=k+m[j]-q

cnt=0
for h in range(n):
  if m[h]>0:
    cnt+=h

ans=['No']*n

ans[cnt]='Yes'

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

Submission status: Runtime Error

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

-----
nさんがc問正解したとき、勝ち抜けるには
q - c > k

-----

a = [0] * n

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

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

Submission status: Runtime Error

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
import numpy

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

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

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

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

Submission status: Runtime Error

Solution code:
# import collections

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

if (K - Q) > 0:
    for _ in range(N):
        print('Yes')
else:
    l = []
    for i,v in dict(c).items():
        if v >(Q - K):
            l.append(i-1)
    l.sort()
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop(0)
            if l == []:
                for _ in range(N-j-1):
                    print('No')
                break
        else:
            print('No')

Submission status: Runtime Error

Solution code:
# import collections

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

if (K - Q) > 0:
    for _ in range(N):
        print('Yes')
else:
    l = []
    for i,v in sorted(dict(c).items(),reverse = True, key=lambda x:x[1]):
        if v >(Q - K):
            l.append(i-1)
        else:
            break
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop() 
        else:
            print('No')

Submission status: Runtime Error

Solution code:
test

Submission status: Runtime Error

Solution code:
N, K, Q = list(map(lambda n: int(n), input().split(" ")))
point = [K - Q] * N
for i in range(N):
  c = int(input())
  point[c - 1] += 1

print("\n".join(["YES" if p > 0 else "NO" for p in point]))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

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

scores = np.array([k] * n)

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

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

Submission status: Runtime Error

Solution code:
inp=list(map(int,input().split()))
n=inp[0]
k=inp[1]
q=inp[2]
if q<k:
  for i in range(n):
    print ('Yes')
else:
  arr=[k-q]*(n)
  z=[]
  for i in range(n):
    x=int(input())
    arr[x-1]+=1
for i in range(len(arr)):
  if arr[i]>0:
    print ('Yes')
  else:
    print ('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys
import numpy as np


def main(stdin):
    N, K, Q = stdin[:3]
    ans = np.full(N + 1, K - Q, dtype=np.int64)
    for i in stdin[3:]:
        ans[i] += 1
    ans = np.where(ans > 0, 'Yes', 'No')
    return ans[1:]


if sys.argv[-1] == 'ONLINE_JUDGE':
    import numba
    from numba.pycc import CC
    cc = CC('my_module')
    cc.export('main', 'i8[:](i8[:],)')(main)
    # b1: bool, i4: int32, i8: int64, double: f8, [:], [:, :]
    cc.compile()
else:
    from my_module import main
    stdin = np.array([int(_) for _ in open(0).read().split()])
    print(*main(stdin), sep='\n')

Submission status: Runtime Error

Solution code:
import sys
import numpy as np


def main(stdin):
    N, K, Q = stdin[:3]
    ans = np.full(N + 1, K - Q, dtype=np.int64)
    for i in stdin[3:]:
        ans[i] += 1
    ans = np.where(ans > 0, 'Yes', 'No')
    return ans[1:]


if sys.argv[-1] == 'ONLINE_JUDGE':
    import numba
    from numba.pycc import CC
    cc = CC('my_module')
    cc.export('main', '(i8[:],)')(main)
    # b1: bool, i4: int32, i8: int64, double: f8, [:], [:, :]
    cc.compile()
else:
    from my_module import main
    stdin = np.array([int(_) for _ in open(0).read().split()])
    print(*main(stdin), sep='\n')

Submission status: Runtime Error

Solution code:
import sys
import numpy as np


def main(stdin):
    N, K, Q = stdin[:3]
    ans = np.full(N + 1, K - Q, dtype=np.int64)
    for i in stdin[3:]:
        ans[i] += 1
    ans = np.where(ans > 0, 'Yes', 'No')
    print(*ans[1:], sep='\n')


if sys.argv[-1] == 'ONLINE_JUDGE':
    import numba
    from numba.pycc import CC
    cc = CC('my_module')
    cc.export('main', '(i8[:],)')(main)
    # b1: bool, i4: int32, i8: int64, double: f8, [:], [:, :]
    cc.compile()
else:
    from my_module import main
    stdin = np.array([int(_) for _ in open(0).read().split()])
    main(stdin)

Submission status: Runtime Error

Solution code:
import heapq as hq
n,m=input().split()
hq.heapify(a:=[-int(x) for x in input().split()])
for i in range(int(m)):hq.heappush(a,-(-hq.heappop(a)//2))
print(-sum(a))

Submission status: Runtime Error

Solution code:
n, k, q = map(int, input().split())
a_list = [0] + [int(input()) for _ in range(q)]
ans_count = [0] * (10**5)
#print(a_list, ans_count)

for i in range(1, q+1):
    ans_count[i] = a_list.count(i)
    #print(ans_count)

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

Submission status: Runtime Error

Solution code:
n, k, q = map(int, input().split())
a_list = [0] + [int(input()) for _ in range(q)]
ans_count = [0] * (q+1)
#print(a_list, ans_count)

for i in range(1, q+1):
    ans_count[i] = a_list.count(i)
    #print(ans_count)

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

Submission status: Runtime Error

Solution code:
n,k,q, *aa = map(int, open(0).read().split())

scores = [k-q]*n

for a in aa:
    scores[a] += 1

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

Submission status: Runtime Error

Solution code:
"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in open(0).input().split())

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

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