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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce



INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


n, k, q = LI()
L = IR(q)
point = [k] * n
limit = q
for i in L:
    point[i-1] += 1


for j in point:
    if j <= limit:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
def acinput():
    return list(map(int, input().split(" ")))


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

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

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

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

Submission status: Accepted

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

B = [int(K) - int(Q)] * int(N)

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

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

for ans in p:
    if ans + k > q:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

an = [0] * n

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

ans = ["No","Yes"]
#print(an)
for j in range(n):
    print(ans[k-q+an[j]>0])

Submission status: Accepted

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

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

for q in range(Q):
    point_list[A[q] - 1] += 1

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

Submission status: Accepted

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

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

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

main()

Submission status: Accepted

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

point =	list([k-q] * n)
for jj in a:
    point[jj-1] += 1

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

Submission status: Accepted

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

p = np.array([0]*n)
for i in range(q):
    p[a[i]-1] += 1

ans = (p-q+k > 0)
for i in ans:
    if i:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

import collections
c = collections.Counter(a_list)

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

Submission status: Accepted

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

point = [Q for i in range(N)]

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

for x in point:
    if x < K:
        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()) for _ in range(Q)]

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

for n in ary:
    if n+K-Q > 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)]
K -= Q
score = [K] * N

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

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

Submission status: Accepted

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

q = [K-Q] * N

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

for _q in q:
    if _q > 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)]

scr = [k - q for _ in range(n)]
for ai in a:
    scr[ai - 1] += 1
ans = list(map(lambda x: "Yes" if 0 < x else "No", scr))
print('\n'.join(ans))

Submission status: Accepted

Solution code:
n, k, q = [int(x) for x in input().split()]
ary = []
for _ in range(q):
    ary.append(int(input()))
winCounts = [0 for _ in range(n)]
for a in ary:
    winCounts[a-1] += 1
for count in winCounts:
    if k - (q-count) > 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 a_ in a:
    p[a_ - 1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

OK = [0 for i in range(N)]
for i in range(Q):
    OK[A[i]-1] += 1
for i in range(N):
    if K>Q:
        print('Yes')
    elif K<=Q and OK[i]>Q-K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split(' '))
point = [0 for _ in range(n)]
a = [0 for _ in range(q)]
for i in range(q):
    a[i] = int(input())
if k > q:
    for i in range(n):
        print('Yes')
else:
    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')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
n, k, q = map(int, stdin.readline().rstrip().split())
ary = [int(stdin.readline().rstrip()) for _ in range(q)]
point = np.array([0] * n)

for i in ary:
    point[i-1] += 1

point = point + (k - q)

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

num_ans = collections.Counter(a)
# print(num_ans)

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

Submission status: Accepted

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

for _ 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:
N,K,Q = (int(i) for i in input().split())
A = []
X = []
for i in range(Q):
    a = int(input())
    A.append(a)

for i in range(N):
    X.append(0)

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

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

Submission status: Accepted

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

plis = [0] * (n + 1)
for a in al:
    plis[a] += 1

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

Submission status: Accepted

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

for i in range(1, N+1):
    score = corrects[i] + K - Q
    if score > 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()))
    
List = [0 for i in range(N)]
for i in range(Q):
    List[A[i]-1] += 1
    
for i in range(N):
    if List[i] > Q-K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n_k_q_str = input()
n_k_q = n_k_q_str.split(" ")
N = int(n_k_q[0])
K = int(n_k_q[1])
Q = int(n_k_q[2])
answers = [0] * N
for i in range(Q):
    answer = int(input()) - 1
    answers[answer] += 1

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

Submission status: Accepted

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

dp = [0]*n

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

for i in range(n):
    if k - (q - dp[i]) > 0:
        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 ans:
    print(["No","Yes"][i>q-k])

Submission status: Accepted

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

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

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

go=q-k+1

for i in range(n):
    if(kai[i]>=go):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
n, k, q = [int(i) for i in input().split()]
points = [0 for i in range(n)]
for i in range(q):
    a = int(input())
    points[a - 1] += 1
points = [k + p - q for p in points]
for p in points:
    print('Yes' if p > 0 else '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 Q - P[i] < K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

for i in range(n):
  if s[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)]

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

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

Submission status: Accepted

Solution code:
def calc(N, K, Q, A):
    d = {}
    for a in A:
        d[a] = 1 + (d[a] if a in d else 0)
    ans = [
        'Yes' if K - Q + (d[i + 1] if i + 1 in d else 0) > 0 else 'No'
        for i in range(N)
        ]
    return '\n'.join(ans)


(N, K, Q) = tuple([int(s) for s in input().split(' ')])
A = [int(input()) for _ in range(Q)]
print(calc(N, K, Q, A))

Submission status: Accepted

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

b = [0] * n

for i in a:
    b[i - 1] += 1

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

Submission status: Accepted

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

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

for i in a_list:
    point_list[i-1] += 1

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

Submission status: Accepted

Solution code:
N, K, Q = [int(x) for x in input().split(" ")]
lis = [K for i in range(N)]
ans = []
for i in range(Q):
    ans.append(int(input()))
for num in ans:
    lis[num - 1] += 1

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

Submission status: Accepted

Solution code:
yes_no = lambda x: 'Yes' if x else 'No'

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

    print('\n'.join([yes_no(p+K-Q > 0) for p in point]))
    
solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

for i in range(N):
    if Q - counts[i] < K:
        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=[]
for x in range(0,N):
    B.append(0)
for x in range(0,Q):
    B[A[x]-1]=B[A[x]-1]+1
for x in range(0,N):
    if B[x]>=Q-K+1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

neg = [0] * n

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

# print(neg)


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

Submission status: Accepted

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

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

P = [0]*N

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

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

Submission status: Accepted

Solution code:
import numpy as np
N,K,Q= map(int,input().split())
human=np.array([K-Q]*N)
ok=[0]*N
for i in range(Q):
    ok[int(input())-1] +=1
ok_np=np.array(ok)
suv= human+ok_np
for i in suv:
    if i>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

ans=[k-q]*n

for i in a:
	ans[i-1]+=1

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

Submission status: Accepted

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

for j in A:
    point[j-1] +=1
# print(point)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

N, K, Q = map(int, sys.stdin.readline().split())

# default = [K - Q] * N
acquire = [0] * N

for _ in range(Q):
    X = int(sys.stdin.readline()) - 1
    acquire[X] += 1

default = K - Q
for a in acquire:
    if default + a > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

a = []

#p = np.zeros((n))
#p += k

p = [0] * n

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

    #p -= 1
    #p[a-1] += 1

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
man = [0] * n
#合計正解数はq
for i in range(q):
    man[int(input()) - 1]+=1

for i in range(n):
    if k - (q - man[i]) >= 1:
        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()))
ansnum = [0] * N

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in range(n):
    temp[i] += k-q
    if temp[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-Q] * N

for i in a:
    point[i-1] += 1

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n, k, q = map(int,input().split())
    a_list = [int(input()) for i in range(q)]

    point = [k-q for i in range(n)]
    for a in a_list:
        point[a-1]+=1

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

Submission status: Accepted

Solution code:
from collections import Counter
N, K, Q = map(int, input().split())
A = [int(input())-1 for _ in range(Q)]
A = Counter(A)
for i in range(N):
    if i in A.keys():
        tmp = A[i]
    else:
        tmp = 0
    if K - (Q - tmp) > 0:
        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())

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

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

Submission status: Accepted

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

for i in range(Q):
  a = int(input()) - 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())
point = [k-q for i in range(n)]
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:
# -*- coding: utf-8 -*-

import sys
from collections import Counter

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N, K, Q = MAP()
scores = [K] * N
A = LIST(Q)

C = Counter(A)
for i in range(N):
    scores[i-1] -= Q - C[i]

for score in scores:
    if score > 0:
        Yes()
    else:
        No()

Submission status: Accepted

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

required_ans = K - Q

Answered = [0] * N

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

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

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


for i in range(N):
    if se[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):
    L[int(input()) - 1] += 1
for i in range(N):
    print('Yes') if L[i] > 0 else print('No')

Submission status: Accepted

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

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

for v in a:
    point[v] += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

point=[0]*n

for _ in range(q):
    point[int(input())-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 = map(int, input().split())
score = [0] * n
for _ in range(q):
    a = int(input())
    score[a - 1] += 1

for si in score:
    if si - (q - k) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
num_player, initial_point, num_quiz = map(int, input().split(' '))
answerer = [int(input()) for _ in range(0, num_quiz)]

points = [initial_point - num_quiz] * num_player

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

survival = [point > 0 for point in points]

for b in survival:
    if b:
        print("Yes")
    else:
        print("No")

exit(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
  readline = stdin.readline
  from builtins import int, print, range
  N, K, Q = map(int, readline().split())
  score = [0] * N
  for _ in range(Q):
    a = int(readline()) - 1
    score[a] += 1
  for i in range(N):
    if score[i] + K > Q:
      print('Yes')
    else:
      print('No')
main()

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_i = int(input())
    a[a_i-1] += 1
for j in a:
    if k - q + j > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N,K,Q=map(int,input().split())
l=[0]*N

for i in range(Q):
    l[int(input())-1]+=1
    
for i in range(N):
    if (l[i]+K-Q)>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 range(N):
    if Q-score[i]<K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

for c in cnt:
    ans = k - q + c
    print("No" if ans <= 0 else "Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n,k,q = MAP()
lst = [0]*n
for i in range(q):
    lst[INT()-1]+=1

x = sum(lst)
for i in lst:
    if x-i>=k:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
from sys import stdin
N, K, Q = [int(_) for _ in stdin.readline().rstrip().split()]
points = [K]*N
A = [int(stdin.readline().rstrip()) for _ in range(Q)]
ansed = [0]*N
for a in A:
    ansed[a-1] += 1
for i, a in enumerate(ansed):
    points[i] -= Q-a
for p in points:
    if p <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

score = [0] * N

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

Submission status: Accepted

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

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

for l in s:
    if l > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# import numpy as np

# A,B = list(map(int, input().split()))

# N = int(input())
N,K,Q = list(map(int, input().split()))
As = []

thres = Q - K

id2point = {}
for i in range(Q):
    a = int(input())-1
    if a in id2point:
        id2point[a] += 1
    else:
        id2point[a] = 1

if thres < 0:
    for i in range(N):
        print("Yes")
    exit()

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

# for i in range(N):