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 numpy as np

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

nn = np.array(n)
ans = K - Q + nn
for an in ans:
    if an > 0:
        print('Yes')
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

l_c=Counter(l)

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

Submission status: Accepted

Solution code:
def resolve():
    n, k, q = map(int, input().split())
    points = [k] * n
    for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
    points = map(lambda x: x - q, points)
    for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes')
resolve()

Submission status: Accepted

Solution code:
import sys
from collections import Counter


def main():
    input = sys.stdin.buffer.readline
    n, k, q = map(int, input().split())
    a = [int(input()) for _ in range(q)]
    cnt = Counter(a)
    for i in range(1, n + 1):
        print("Yes" if q - cnt[i] < k else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# 問題：https://atcoder.jp/contests/abc141/tasks/abc141_c


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

points = [0 for _ in range(n)]
for i in range(q):
    a = int(input())
    points[a-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 = [int(input()) for i in range(q)]
p = [k-q]*n

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict

def main():
    n, k, q = map(int, input().split(" "))
    a = (int(input()) for i in range(q))
    d = defaultdict(lambda:k-q)
    for i in range(n):
        d[i]

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

    for value in d.values():
        print("Yes" if value > 0 else "No")


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
A = []
B=[]
C=[]
for _ in range(X[2]):
    A.append(int(input()))
for _ in range(X[0]):
    B.append(X[1]-X[2])
for i in range(0,X[2]):
    B[A[i]-1]=B[A[i]-1]+1
for j in range(0,X[0]):
    if B[j]>0:
        C.append("Yes")
    else:
        C.append("No")
[print(i) for i in C]

# 難しかった

Submission status: Accepted

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

m=[0]*n

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

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

ans=['No']*n

for h in range(n):
  if m[h]>0:
    ans[h]='Yes'

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

Submission status: Accepted

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


a = [0] * n

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

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

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
Answer_List = {}
for i in range(Q):
    CA = int(input())
    if CA in Answer_List:
        Answer_List[CA] += 1 
    else:
        Answer_List[CA] = 1
 
Lose_Status = K - Q
if Lose_Status > 0:
    for j in range(N):
        print("Yes")
else:
    Standard = abs(Lose_Status) + 1
    for j in range(N):
        if j + 1 in Answer_List:
            if Answer_List[j + 1] >= Standard:
                print("Yes")
            else:
                print("No")
        else:
                print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

for i in range(q):
  di[int(input())]+=1
  
giri_ans = q-k
  
for i in range(1,n+1):
  if di[i]>giri_ans:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''
    N, M, Q = [int(item) for item in input().split()]
    As = [int(input()) for _ in range(Q)]

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

    for item in As:
        memo[item-1] += 1

    for item in range(N):
        if M - Q + memo[item] > 0:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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: Accepted

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

Submission status: Accepted

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

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

for x in lst[1:]:
    if x > q-k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

for i in range(1, q + 1):
    p[a[i]] += 1
    
for j in range(1, n + 1):
    if p[j] > 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 _ in range(Q)]

count = np.zeros(N)

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

ans = K - (Q - count)

for answer in ans:
    if answer <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n, k , q = inpm()
al = inplm(q)
l = []
for i in range(0, n):
    l.append(k)
for i in range(0, q):
    l[al[i] - 1] += 1
for i in range(0, n):
    print('Yes' if l[i] - q > 0 else 'No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

score = [K-Q]*N

for i in A:
    score[i-1]+=1
            
for i in score:
    if i<=0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

# 回答者毎の正解数を0で初期化
ns_corrects = [0] * n

for i in range(q):
    # 回答者毎の正解数をカウント
    ns_corrects[int(input())-1] += 1


for j in range(n):
    # 回答者毎に「問題数―正解数=減点数」をカウントし持ち点が無くなれば'No'
    if k - (q - ns_corrects[j]) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

ns_points = [k] * n
ns_corrects = [0] * n
for i in range(q):
    ns_corrects[int(input())-1] += 1


for j in range(len(ns_points)):
    if ns_points[j] - (q - ns_corrects[j]) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

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)

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

Submission status: Accepted

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

Submission status: Accepted

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

if Q-K>=0:
    lis=[0]*N
    lis_yn=['No']*N
    for _ in range(Q):
        q=int(input())
        lis[q-1]+=1
        if lis[q-1]>Q-K:
            lis_yn[q-1]='Yes'
    #print(lis)
else:
    lis_yn=['Yes']*N
print('\n'.join(lis_yn))

Submission status: Accepted

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

scores = [K] * N

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

for s in scores:
  print(("No","Yes")[s - Q > 0])

Submission status: Accepted

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

scores = [K - Q] * N

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

for s in scores:
  print(("No","Yes")[s > 0])

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def resolve():
    import sys
    import string
    input = sys.stdin.readline
    # row = [int(x) for x in input().rstrip().split(" ")]
    # n = int(input().rstrip())
    n, k, q = [int(x) for x in input().rstrip().split(" ")]

    scores = [k - q for _ in range(n)]

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


    for score in scores:
        if score <= 0:
            print("No")
        else:
            print("Yes")

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

for ans in p:
    if ans <= Q-K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt=Counter(a)

ans=['No' if k-q<=0 else 'Yes']*(n+1)

for key,value in cnt.items():
    if k-q+value>0:
        ans[key]='Yes'

for i in range(1,n+1):
    print(ans[i])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#C - Attack Survival
N,K,Q = map(int,input().split())
A = list(int(input()) for i in range(Q))
score = [0]*(N)
for i in range(Q):
    score[A[i]-1] += 1
score = [(K-Q+j) for j in score]
for k in score:
    if k > 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 = [K-Q]*N
for i in range(Q):
    points[A[i]-1] += 1
for i in range(N):
    if points[i]<=0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
# n:参加人数
# k:初期ポイント
# q:正解の回数

# 最初のポイント初期化
menber_point = [k for _ in range(n)]

# 正解者リスト
correct_answer = [int(input()) for _ in range(q)]

# 正解したらポイント加算してあげる
for value in correct_answer:
    menber_point[value-1] += 1

# 正解の回数以下なら敗退判定
for mem in menber_point:
    if mem > q:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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


for i in range(n):
    t = start[i] - (q - a[i])
    if t <= 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)]

if K > Q:
    for i in range(N):
        print("Yes")

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in a:
    b[i - 1] += 1
for i in b:
    if i > Q - K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
A = np.zeros(N, dtype=int)

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

for ai in A:
    print(['No', 'Yes'][int(ai) + K - Q > 0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

seikai = [0]*n

for i in lst:
    seikai[i-1] += 1

for j in seikai:
    if k - (q-j) <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter

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

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

Submission status: Accepted

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

for _ in range(Q):
  A = int(input())-1
  res[A] += 1
  
for i in range(N):
  if res[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

point = [0] * N

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

for point in point:
    if Q - point < 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)]
b=[k-q]*n
for x in a:
  b[x-1]+=1
for x in b:
  if x<=0:
    print('No')
  else:
    print('Yes')

Submission status: Accepted

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

collect = [0] * (n+1)
for i in range(q):
    p = int(input())
    collect[p] += 1

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math
###############################################################################\
n,k,q=INPUT()
A=[0]*(n+1)
for i in range(q):
    x=int(input())
    A[x]+=1
for i in range(1,n+1):
    if k-q+A[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, K, Q, *A = map(int, read().split())

    B = [0] * N
    for a in A:
        B[a - 1] += 1

    ans = [0] * N
    for i, b in enumerate(B):
        if Q >= K + b:
            ans[i] = 'No'
        else:
            ans[i] = 'Yes'

    print('\n'.join(map(str, ans)))
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

for e in t:
    if e > q-k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import math
from math import gcd
INF = float("inf")

import sys
input=sys.stdin.readline
import itertools
from collections import Counter

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


if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from collections import defaultdict,deque
#from itertools import permutations
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()

"""========main code==============="""

a,b,c=ml()
lol=[b]*a
for i in range(c):
    n=ii()
    lol[n-1]+=1
    
for i in lol:
    if(i-c>0): print("Yes")
    else: print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np


input = sys.stdin.readline
n, k, q = map(int, input().split())
l = np.zeros(n + 1)
d = {}

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

for key, v in d.items():
    l[key] = v

l += k - q

for i in l[1:]:
    if i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys
N, K, Q = map(int, input().split())
points = [0] * N
for _ in range(Q):
    a = int(sys.stdin.readline())
    points[a-1] += 1
for point in points:
    if point > (Q - K):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

for a,b in zip(A,p):
    print('Yes' if 0<a+b else 'No')

Submission status: Accepted

Solution code:
N,K,Q = map(int, input().split())
D = {c:0 for c in range(1, N+1)}
for _ in range(Q):
  a = int(input())
  D[a] += 1
r = Q-K
for v in D.values():
  if v>r:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instr = lambda: sys.stdin.readline()
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

n,k,q = inintm()
A = []
con = [0]*n

border = q-k

for _ in range(q):
    A.append(inint())

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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