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:
N, K, Q = map(int, input().split())
A = list(int(input()) for i in range(Q))
B = [K-Q]*N 
for i in range(Q):
    B[A[i]-1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import copy
a, b, n = list(map(int, input().split()))
m = [int(input()) for _ in range(n)]

def dec1(n):
    return n - 1

p = [b-n]*a
p1 = copy.deepcopy(p)
for i, name in enumerate(m):
    p1[name-1] += 1

for i, name in enumerate(p1):
    if name <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
if K > Q:
    ans1 = ["Yes" for _ in range(N)]
    x = "\n".join(ans1)
    print(x)
else:
    a = Q-K+1
    h = {}
    for i in range(Q):
        res = int(input())
        if h.get(res):
            h[res] += 1
        else:
            h[res] = 1
    ans2 = ["Yes" if h.get(i+1) and h[i+1] >= a else "No" for i in range(N)]
    y = "\n".join(ans2)
    print(y)

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

Solution code:
from collections import Counter

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

for i in range(Q):
    pn[i] = input()

c =  Counter(pn)
# print(c)
for j in range(1, N + 1):
    if Q - c[str(j)] < K:
        ans = "Yes"
    else:
        ans = "No"
    print(ans)

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
A = [int(input()) for i in range(q)]
motiten = [k-q for i in range(n)]#まず全員の点数をn点減点
for j in A:
    motiten[j-1] += 1
for x in motiten:
    if x<= 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)]

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

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

for k, v in h.items():
    tmp = Q - v
    h[k] = K - tmp

for k, v in h.items():
    if v > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

for q in As:
  ex[q-1] += 1

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

Submission status: Accepted

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

A = []
point = []
border = 0
for i in range(N):
    point.append(K)

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


for a in A:
    point[a-1] += 1
    border += 1

# result
for i in range(N):
    if point[i] > border:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# n: 参加者人数
# k: 初期ポイント
# q: ラウント回数
n, k, q = map(int, input().split())
data = [ int(input()) for _ in range(q) ]

table = [k] * n

for winnner in data:    
    table[winnner - 1] += 1

for j in range(n):
    table[j] -= q

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

Submission status: Accepted

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

if k>q:
    [print("Yes") for i in range(n)]
else:
    result=[0]*(n+1)
    while True:
        try:
            idx=int(input())
            result[idx]+=1
        except:
            break
    del result[0]
    
    for i in result:
        if i+k-q>0:
            print("Yes")
        else:
            print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
from collections import Counter


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

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

    count = Counter(winners)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

N, K, Q = MAP()
A = [0]*Q
for i in range(Q):
    A[i] = INT()
c = Counter(A)
for i in range(N):
    if c[i+1] > Q-K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

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

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

for A in As:
  if A == 1:
    Points[1] = Points[1]  + 1
  elif A == N:
    Points[0] = Points[0] + 1
    Points[N-1] = Points[N-1] - 1
  else:
    Points[0] = Points[0] + 1
    Points[A-1] = Points[A-1] - 1
    Points[A] = Points[A] + 1

for i in range(N):
  Points[i+1] = Points[i+1] + Points[i]

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

Submission status: Accepted

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

P = []
for i in range(N):
    P.append(K - Q)

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:
N, K, Q = map(int, input().split())

A = [0]*Q
for i in range(Q):
    A[i] = int(input())

B = [0]*N

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


for i in range(N):
    if K - (Q - B[i]) > 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):
    ans = int(input())
    point[ans - 1] = point[ans - 1] + 1
for i in range(n):
    if point[i] < 1:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
# 2019/09/15
# AtCoder Beginner Contest 141 - C

# Input
n, k, q = map(int, input().split())
a = [0] * n
for i in range(q):
    wka = int(input())
    a[wka-1] = a[wka-1] + 1

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

Submission status: Accepted

Solution code:
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
c = collections.Counter(A)
for i in range(1, 1+n):
  m = q - c.get(i, 0)
  # print((i, m, k-m))
  print('Yes' if (k-m) > 0 else 'No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N,K,Q=map(int,input().split())
    C=[0]*N
    P=[0]*N
    for j in range(Q):
        idx=int(input())-1
        C[idx]+=1

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

main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
z = list(map(int, input().split()))
n = z[0]#人数
k = z[1]#最初のポイント
q = z[2]#問題の数

a = []#n人のゼッケン番号は引数+1
p = []#ポイント
for i in range(q):
	a.append(int(input()))

	
for i in range(n):
	p.append(k-q)


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

Submission status: Accepted

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

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

Submission status: Accepted

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

point = [K] * N
A = []
for q in range(Q):
    A.append(int(input()) - 1)

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

for ans in point:
    if ans <= Q:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

b = ["No"]*n
    

for i in range(n):
    if k - q + a[i] > 0 :
        b[i] = "Yes"

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

Submission status: Accepted

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

for j in range(n):
    if scores[j] <= q- k:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import numpy as np
n, k, q = map(int, input().split())

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

p = np.array([k - q] * n)
pp = np.array([0] * n)

for i in range(q):
    index = l[i] - 1
    pp[index] += 1

xx = p + pp

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys

#+++++
		
def main():
	n,k,q = map(int, input().split())
	aaa=[0]*n
	for i in range(q):
		a = int(input())
		aaa[a-1] += 1
	
	for p in aaa:
		if k-(q-p) > 0:
			print('Yes')
		else:
			print('No')
	return 
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
from collections import defaultdict

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

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

res = ['Yes'] * n


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

for boo in res:
    print(boo)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections as cl

# 正解して1ポイント得ることと、
# 正解して全員を1ポイント減らすのは相対的に等価では？

# K問中、他人が1問正解したらK+1問正解してないといけない？
# Q問の他者回答と、自分の獲得ポイントの合計が0をこえてるかどうか。


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

c = cl.Counter(A_list)
# print(c)
# print(c[3])

for user in range(1,N+1) :
    atari = c[user]
    # K+atari-(Q-atari) > 0
    # K+atari-Q+atari
    # print(user,K-(Q-atari))
    if (K-(Q-atari) > 0) :
        print("Yes")
    else :
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

n, k, q = map(int, input().split())
Ans = [int(input()) for i in range(q)]
L = np.array([int(k-q) for i in range(n)], dtype=int)

for i in range(q):
  L[Ans[i]-1] += 1
L = L > 0

for i in range(n):
  if L[i] == False:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

Q = [0]*(n+1)

for i in a:
    Q[i] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
N, K, Q = map(int, input().split())
A = list()
for _ in range(Q):
    A.append(int(input()))

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

# output
for i in range(N):
    if ans[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, K, Q = map(int, input().split())
A_list = [K - Q] * N

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

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

Submission status: Accepted

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

score = [0] * n

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
from collections import Counter
n, k, q = list(map(int, input().split()))
A = Counter([int(input()) for i in range(q)])
points = (np.ones(n) * k) - q
for k, v in A.items():
  points[k-1] += v
for p in points:
  if p > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

def ans() :
    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")

if __name__ == '__main__':
    ans()

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 k - (q-c[i]) > 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):
    j = int(input())
    S[j-1] += 1

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

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

max_score = max(scores)
# 正解者以外のポイントが1減る
for s in scores:
    score = K - (Q - s)
    if score <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter

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

cnt = Counter(a)

#print(cnt[3])

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

Submission status: Accepted

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

Submission status: Accepted

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

scores = {}
for i in range(1, n + 1):
    scores[str(i)] = 0

for ok_num in aq:
    scores[ok_num] = scores[ok_num] + 1

for i in range(1, n + 1):
    score = scores[str(i)]
    if score + k - q > 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()))
           
point=[0]*N
for i in A:
  point[i-1]+=1
  
for i in point:
  if K+i-Q>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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


for i in range(Q):
    k = int(input())
    point[k-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())

S = []
for _ in range(Q):
    S.append(input())


A = [0]*N

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

# print(n,k,q, a)

points = {i:0 for i in range(n)}

# print(points)
for ai in a:
    points[ai-1] += 1

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

Submission status: Accepted

Solution code:
def main():
  n, k, q = map(int, input().split(' '))
  al = [int(input()) for _ in range(q)]
  ks = [k - q for _ in range(n)]
  for a in al:
    ks[a-1] += 1
  ans = list(map(convert, ks))
  print('\n'.join(ans))


def convert(k):
  return 'Yes' if k > 0 else 'No'


if __name__ == '__main__':
  main()

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

tmplist = [0 for i in range(n)]
tmp = q-k
for i in a:
  tmplist[i-1] += 1

for i in tmplist:
  if i > tmp:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
p = [k]*n
a = []
ans = ['No'] * n
counts = {}

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

for i in range(len(a)):
    key = a[i]
    if key in counts:
        counts[key] += 1
    else:
        counts[key] = 1

for key, value in counts.items():
    idx = key - 1
    p[idx] += value

#print('p: ' + str(p))
for i in range(len(p)):
    p[i] -= q

for i in range(len(p)):
    if p[i] > 0:
        ans[i] = 'Yes'

# print('counts: ' + str(counts))
# print('p: ' + str(p))
# print(a)
# print(ans)

for i in range(len(ans)):
    print(ans[i])

Submission status: Accepted

Solution code:
NKQ = list(map(int, input().split()))
A = [int(input()) for i in range(NKQ[2])]

# print(NKQ)
# print(A)

apps = [0] * NKQ[0]

senzai = len(A)

for s in range(len(A)):
    apps[A[s]-1] += 1

for b in range(len(apps)):
    point = NKQ[1] - senzai + apps[b]
    if point <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())

def solve(N,K,Q,A):
    score = [K] * N
    tot = 0
    for a in A:
        a -= 1
        score[a] += 1
        tot += 1
    ans = []
    for i, s in enumerate(score):
        if s-tot > 0:
            ans.append('Yes')
        else:
            ans.append('No')
    return ans


N, K, Q = rrm()
A = [ rri() for _ in xrange(Q) ]
ans = solve(N,K,Q,A)
for row in ans:
    print row

Submission status: Accepted

Solution code:
inl = input().split(' ')
num = int(inl[0])
k = int(inl[1])
q = int(inl[2])

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

s = [0]*num

for ans in a:
	s[ans] += 1

for score in s:
	result = k-(q-score)
	if result < 1:
		print('No')
	else:
		print('Yes')

Submission status: Accepted

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

for m in l:
    score[m] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

# それぞれの参加者の正解数を管理するリスト(i番目の参加者の正解数 = ans_num_list[i])
ans_num_list = [0] * n
for i in range(q):
    ans_num_list[int(input()) - 1] += 1

# 必要正解数
required_ans_num = q - k + 1

for i in range(n):
    if ans_num_list[i] >= required_ans_num:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

l = K-Q
points = [l for _ in range(N)]
for a in A:
  points[a-1] += 1
  
for k in ["Yes" if point>0 else "No" for point in points ]:
  print(k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,Q = list(map(int, input().split()))
c_nums = [int(input()) for i in range(Q)]
A_points = [K - Q for i in range(N)]
#print(A_points)
for i in c_nums:
  A_points[i-1] += 1

#print(A_points)
print('\n'.join(['Yes' if i > 0 else 'No' for i in A_points]))

Submission status: Accepted

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

l = [k-q]*n

for i in a:
  l[i-1] += 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())

point =[0]*N

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

NKQ=np.array(input().split(),dtype=np.int32)

N=NKQ[0]
K=NKQ[1]
Q=NKQ[2]

score=[K]*N
score=np.array(score,dtype=np.int32)

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

A=np.sort(A)

score=score-Q

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

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

Submission status: Accepted

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

# N: 参加者数
# K: 初期スコア
# Q: 問題数
N, K, Q = list(map(int, input().split()))

# アイディア (基本的には Q だけ初期スコアからみんな減る)
# ただし、正解した人は正解数だけ Q より減り分が少ない
# なので、誰がどのくらい正解したのかを持つマップを作っておき、
# 出力のタイミングで引けばよい

correct_answer_nums = {}
for i in range(Q):
    who = int(input()) - 1  # 0 オリジンにする
    current = correct_answer_nums.get(who, 0)
    correct_answer_nums[who] = current + 1

for i in range(N):
    if 0 < (K - (Q - correct_answer_nums.get(i, 0))):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# C

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

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

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

Submission status: Accepted

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

joi = [0 for i in range(n+1)]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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