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: Time Limit Exceeded

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
pnts = np.array([K] * N)
reduc = np.ones(N, int)

# main
for i in A:
    pnts -= reduc
    pnts[i - 1] += 1
    
# output
for i in pnts:
    print("{}".format("Yes" if i > 0 else "No"))

Submission status: Time Limit Exceeded

Solution code:
str=input()
N, K, Q=[int(v) for v in str.split()]
li=[K for n in range(N)]
for i in range(Q):
    A=int(input())-1
    li=[k if j==A else k-1 for j, k in enumerate(li)]
for i in range(N):
    if li[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
from numpy import *

n, k, q = map(int, input().split())
a = np.array([])

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

points = [k for i in range(n)]
points = np.array(points)
minus_ones = [-1 for i in range(n)]
minus_ones = np.array(minus_ones)

for i in range(len(a)):
    points += minus_ones
    points[a[i]-1] += 1

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

Submission status: Time Limit Exceeded

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

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

points = [k for i in range(n)]

for i in range(len(a)):
  for j in range(n):
    if j != a[i]-1:
      points[j] -= 1

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
sankaNum, scoreMax, ansCnt = map(int, input().split())

score = []

for i in range(sankaNum):
    score.append(scoreMax)

for n in range(ansCnt):
    ansSanka = input()

    for k in range(sankaNum):
        if int(ansSanka) - 1 != k:
            score[k] -=  1
    
for m in range(sankaNum):

    if score[m]  > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
sankaNum, scoreMax, ansCnt = map(int, input().split())

score = []

for i in range(sankaNum):
    score.append(scoreMax)

for n in range(ansCnt):
    ansSanka = input()

    for k in range(sankaNum):
        if int(ansSanka) - 1 != k:
            score[k] -=  1
    
for n in range(sankaNum):

    if score[n]  > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

list_A = []

for _ in range(q):
    i = int(input())
    list_A.append(i)

list_per = [k]*n

for i in list_A:
    i = i -1
    list_per = [x-1 for x in list_per]
    list_per[i] = list_per[i] + 1

for i in list_per:
    if i <=0:
        print("No")

    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

for x in range(n):
    if lists.count(x+1)+k-q>0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
lists=[]
emptylists=[]

for i in range(Q):
    s=int(input())
    lists.append(s)

for i ,j in enumerate(lists):
    emptylists.append([i,j])


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

for nums in range(Q):
    for numbers in range(N):
        if numbers==emptylists[nums][1]-1:
            
            Uselist[numbers]=Uselist[numbers]
            
        else:
            Uselist[numbers]=Uselist[numbers]-1

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n, k, q = map(int,input().split())
p = np.array([k]).repeat(n)

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

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

Submission status: Time Limit Exceeded

Solution code:
#C問題
N,K,Q=map(int,input().split())
lists=[]
emptylists=[]

for i in range(Q):
    s=int(input())
    lists.append(s)

for i ,j in enumerate(lists):
    emptylists.append([i,j])


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

for nums in range(Q):
    for numbers in range(N):
        if numbers==emptylists[nums][1]-1:
            Uselist[numbers]=Uselist[numbers]
        else:
            Uselist[numbers]=Uselist[numbers]-1

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

Submission status: Time Limit Exceeded

Solution code:
import sys
import numpy as np

N,K,Q=map(int,sys.stdin.readline().split())
points=np.array([K]*N)
for i in range (Q):
  points=points-1
  points[int(sys.stdin.readline().rstrip())-1]+=1
for b in points>0:
  if b:
    print('Yes')
  else:
    print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for i in range(q):
  score_list = list(map(lambda x: x-1, score_list))
  score_list[a[i]-1] += 1
#  print(score_list)

 # print(a[i])

#for i in range(n):
#  print(score_list[i])

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

Submission status: Time Limit Exceeded

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

for i in range(q*n):
	point[i%n]-=1
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
n, k, q = list(map(int, input().split()))
score_list = [0] * n
a = list(map(int, [input() for i in range(q)]))
 
 
for answer_num in range(q):
  for person_num in range(n):
    if a[answer_num] is not (person_num + 1):
      score_list[person_num] += 1
    
for i in range(n):
  if score_list[i] >= k:
    print("No")
  else:
    print("Yes")

Submission status: Time Limit Exceeded

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


for i in range(q):
	for j in range(n):
		point[j]-=1
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

for j in range(n):
  a = l.count(j+1)
  b = k - q + a
  
  if b <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
A = np.array([0]*Q)
N = np.array([K]*N)


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

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

for i in range (N.size):
  if N[i] <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Time Limit Exceeded

Solution code:
N,K,Q = map(int,input().split())
a = []
b = 1-(K-Q)

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

for i in range(N):
    if b <= a.count(i+1):
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
import sys
pos=input()
pos=pos.split()
N=int(pos[0])
P=int(pos[1])
T=int(pos[2])
point=[P]*N

for i in range(0,T):
    c=input()
    point=[p-1 for p in point]
    point[int(c)-1]+=1

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N,K,Q = map(int,input().split())
participants_points = np.full(N,K)
for i in range(Q):
	A = int(input())
	tmp = np.full(N,1)
	tmp[A-1] -= 1
	participants_points -= tmp

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
 
n, k, q = map(int, input().split())
a = list(int(input()) for i in range(q))
 
for i in range(n):
  cnt = a.count(i+1)
  if k - q + cnt > 0:
    print('Yes')
  else:
    print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
a=list(map(int,input().split()))
b=[int(input()) for i in range(a[2])]
n=[]
[n.append(a[1]-a[2]) for j in range(a[0])]
for h in range(a[2]):
    d=b.pop(0)
    n[d-1]=n[d-1]+1
ans=[]
#[ans.append("Yes") if n[0] > 0 else ans.append("No") or del n[0] for g in range(a[0])]
for g in range(a[0]):
    if n[0] > 0:
        ans.append("Yes")
    else:
        ans.append("No")
    del n[0]
[print(f) for f in ans]

Submission status: Time Limit Exceeded

Solution code:
a=list(map(int,input().split()))
b=[int(input()) for i in range(a[2])]
n=[]
[n.append(a[1]-a[2]) for j in range(a[0])]
for h in range(a[2]):
    d=b.pop(0)
    n[d-1]=n[d-1]+1
    d=0
ans=[]
#[ans.append("Yes") if n[0] > 0 else ans.append("No") or del n[0] for g in range(a[0])]
for g in range(a[0]):
    if n[0] > 0:
        ans.append("Yes")
    else:
        ans.append("No")
    del n[0]
[print(f) for f in ans]

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

tmp = []
for i in range(N):
    tmp.append(A.count(i+1)) #正解数
# 得点は, 最初の点数 - 他人の正解数
# 他人の正解数は, 問題数 - 自分の正解数
# 得点は, 最初の点数 - 問題数 + 自分の正解数
# 得点 > 0 であれば, "Yes"
for i in range(N):
    if K - Q + tmp[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

answer = []
for _ in range(q):
    answer.append(int(input()))

k = k - q

for i, _ in enumerate(range(n), 1):
    if k + answer.count(i) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

k = k - q

for i, _ in enumerate(range(n), 1):
    if k + answer.count(i) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

A = []

for a in range(0, Q):
    A.append(input())

box = []

ii = 0
while True:
    box.append(K)
    ii += 1
    if ii == N:
        break

for i in range(0, Q):
    for k in range(1, N + 1):
        if A[i] == str(k):
            continue
        else:
            box[k - 1] = box[k - 1] - 1

for t in box:
    if t > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

point = [0] * N

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

for i in range(Q):
  A = int(input()) - 1
  for r in range(N):
    if A != r: point[r] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
import sys
RAW = sys.stdin.readlines()
N, K, Q = RAW[0].split()
for i in range(1, int(N)+1):
  if int(K) - int(Q) + RAW.count(str(i)+"\n") + RAW.count(str(i)) > 0:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

participant_list = [K] * N
# for i in range(N):
#     participant_list.append(K)
# print(participant_list)

def calc_decre(n):
    return n - 1

for i in range(Q):
#     print('num=', i)
    participant_list = list(map(calc_decre, participant_list))
#     print(participant_list)

#     for i in range(N):
#         participant_list[i] -= 1 
    answer = int(input()) - 1
    participant_list[answer] += 1
#     print(participant_list)

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def quiz(n, a, p):
	for i in range(n):
		p[i] -= 1
	p[a-1] += 1

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

Submission status: Time Limit Exceeded

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

for i, _ in enumerate(range(n), 1):
    if k - (q - answer.count(i)) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

Solution code:
n, k, q = input().split()
n, k, q = [int(n), int(k), int(q)]
scores = [k for i in range(0,n)]
for i in range(0,q):
  A = int(input())
  for j in range(0, n):
    if not (j+1)==A:
      scores[j] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
a=list(map(int,input().split()))
b=[int(input()) for i in range(a[2])]
n=[]
[n.append(a[1]) for j in range(a[0])]
for h in range(a[2]):
    n=[z-1 for z in n]
    d=b.pop(0)
    n[d-1]=n[d-1]+1
    d=0
ans=[]
for g in range(a[0]):
    v=n[0]
    if v > 0:
        ans.append("Yes")
    else:
        ans.append("No")
    v=0
    del n[0]
[print(f) for f in ans]

Submission status: Time Limit Exceeded

Solution code:

N,K,Q = map(int,input().split())
a = []
c = K-Q

for i in range(Q):
    a.append(int(input()))
    
b = 1-c

for i in range(N):
    if b <= a.count(i+1):
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
a=list(map(int,input().split()))
b=[int(input()) for i in range(a[2])]
n=[]
for j in range(a[0]):
    n.append(a[1])
for h in range(a[2]):
    n=[z-1 for z in n]
    d=b.pop(0)
    n[d-1]=n[d-1]+1
    d=0
ans=[]
for g in range(a[0]):
    v=n[0]
    if v > 0:
        ans.append("Yes")
    else:
        ans.append("No")
    v=0
    del n[0]
for f in ans:
    print(f)

Submission status: Time Limit Exceeded

Solution code:
test = input().split(" ")
box = []
if (int(test[2]) - int(test[1])) < 0:
    for i in range(int(test[0])):
        print("Yes")
elif (int(test[2]) - int(test[1])) >= 0:
    for i in range(int(test[2])):
        box.append(input())
    for l in range(int(test[0])):
        win = (box.count(str(int(l) + 1)))
        if int(win) > (int(test[2]) - int(test[1])):
            print("Yes")
        else:
            print("No")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
Point = list(map(int,input().split()))
A = np.array([int(input()) for i in range(Point[2])])
A -= 1
P = np.array([Point[1]]*Point[0])
a = 0
for i in A:
  P -= 1
  P[A[a]] += 1
  a += 1
for i in P:
  if i <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
N,K,Q =map(int,input().split())
A = []
for l in sys.stdin:
    A.append(int(l))
for i in range(N):
    cnt = A.count(i+1)
    Point = K - (Q - cnt)
    if Point >= 1 :
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
n,k,q=map(int,input().split())
A=[int(input()) for _ in range(q)]

minus=[]
for i in range(1,n+1):
  minus.append(A.count(i))
for i in range(n):
  if k-(q-minus[i])<=0:
    print('No')
  else:
    print('Yes')

Submission status: Time Limit Exceeded

Solution code:

N,K,Q = map(int,input().split())
a = []
b = []
c = K-Q
for i in range(Q):
    a.append(int(input()))
    
#for i in range(N):
#    b.append(a.count(i+1))
    
for i in range(N):
  #  result = c+int(b[i])
    result = c+a.count(i+1)
    if result <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8

test = input().split(" ")
chance = (int(test[2]) - int(test[1]))
#print(test)
box = []
if chance < 0:
    for i in range(int(test[0])):
        print("Yes")
elif chance >= 0:
    for i in range(int(test[2])):
        box.append(input())
    for l in range(int(test[0])):
        win = (box.count(str(int(l) + 1)))
        if int(win) > chance:
            print("Yes")
        else:
            print("No")

Submission status: Time Limit Exceeded

Solution code:

import numpy as np
N , K ,Q = map(int, input().split())
initializer_list = np.full(N,K,dtype='float32')
for _ in range(Q):
    i = int(input())-1
    tmp = initializer_list[i]
    initializer_list -=1
    initializer_list[i] = tmp

[print('Yes') if i > 0 else print('No')  for i in initializer_list]

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().split())
winner = [int(input()) for i in range(Q)]
PointBord = []
for i in range(N):
    PointBord.append(K)
for i in range(Q):
    winManIndex = winner[i]-1
    for j in range(len(PointBord)):
        if j != winManIndex:
            PointBord[j] = PointBord[j]-1
for i in range(N):
    point = PointBord[i]
    if point < 1:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
    x = a.count(i)
    if k-q+x > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
import sys
N,K,Q =map(int,input().split())
F = {}
A = []
for l in sys.stdin:
    A.append(int(l))
for i in range(N):
    cnt = A.count(i+1)
    Point = F[str('A'+ str(i+1))] = K - (Q - cnt)
    if Point >= 1 :
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

P = [K] * N

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

Submission status: Time Limit Exceeded

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

Answers = [int(input()) for i in range(Q)]
Points = [K] * N

for i in Answers:
    for j in range(1, N+1):
        if i != j:
            Points[j-1] -= 1

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

Submission status: Time Limit Exceeded

Solution code:

N,K,Q = map(int,input().split())
a = []
b = []
c = K-Q
for i in range(Q):
    a.append(int(input()))
    
for i in range(N):
    b.append(a.count(i+1))
    #print(b[i])
    
for i in range(N):
    result = c+int(b[i])
    if result <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Time Limit Exceeded

Solution code:
from collections import Counter
import numpy as np

N, K, Q = input().split()
A = np.array([int(input()) for i in range(int(Q))])
T = np.full(int(N), int(K))
#unique, counts = np.unique(A, return_counts=True)
#s =  dict(zip(unique, counts))
s = Counter(A)
for key, value in s.items():
    T[0:(key-1)] -= value
    T[key:len(T)] -= value
for i in T:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

Solution code:
import sys
N,K,Q =map(int,input().split())
F = {}
A = []
for l in sys.stdin:
    A.append(int(l))
for i in range(N):
    cnt = A.count(i+1)
    F[str('A'+ str(i+1))] = K - (Q - cnt)
    if F[str('A'+ str(i+1))] >= 1 :
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
L = list(map(int, input().split()))
 
N = L[0]
K = L[1]
Q = L[2]
 
A = []
 
for _ in range(Q):
    A.append(int(input()))
	
P = [K] * N
 
 
r = 0
 
for i in range(0,len(A)):
	r = A[i] - 1
	P[r] += 1
	P = list(map(lambda x: x-1,P))
	
for i in range(0,len(P)):
	if P[i] > 0:
		print("Yes")
	else:print("No")

Submission status: Time Limit Exceeded

Solution code:
import sys
N,K,Q =map(int,input().split())
F = {}
A = []
for l in sys.stdin:
    A.append(int(l))
for i in range(N):
    cnt = A.count(i+1)
    F[str('A'+ str(i+1))] = K - (Q - cnt)
for i in range(N) :
    if F[str('A'+ str(i+1))] >= 1 :
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

A = list(map(int,[input() for i in range(Q)]))
for y in range(1, N+1):
    if K - Q + A.count(y) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

for i in range (1,n+1,1):
    if  K+int(x.count(i))>0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

point_array = np.array(K).repeat(N) -Q

for a in range(N):
    point_array[a] += A.count(a+1)
    if point_array[a] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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


point = [k] * n


for win in a:         # 勝った人(a[win-1])以外を下げる
    point[win-1] += 1
    for i in range(n):
        point[i] -= 1
#        print(point)

#print(point)


for i in point:
    if i <= 0:
        print("No")
    elif i >= 1:
        print("Yes")

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

A = []

for a in range(0, Q):
    A.append(input())

box = []

ii = 0
while True:
    box.append(K)
    ii += 1
    if ii == N:
        break

for i in range(0, Q):
    for k in range(1, N + 1):
        if A[i] == str(k):
            continue
        else:
            box[k - 1] = box[k - 1] - 1

for t in box:
    if t > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
L = list(map(int, input().split()))

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

A = []

for _ in range(Q):
    A.append(int(input()))
	
P = [K] * N


r = 0

for i in range(0,len(A)):
	r = A[i] - 1
	P[r] += 1
	P = list(map(lambda x: x-1,P))
	
for i in range(0,len(P)):
	if P[i] > 0:
		print("Yes")
	else:print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

def one(n):
    return n - 1

for i in range(Q):
    P = list(map(one,P))
    P[int(A[i]-1)] = P[int(A[i]-1)] + 1

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

Submission status: Time Limit Exceeded

Solution code:
S = str(input())
N, K, Q = S.split(' ')

N = int(N)
K = int(K)
Q = int(Q)

persons = []
for i in range(N):
    persons.append(K)

for i in range(Q):
    ans = int(input())
    for j in range(N):
        if j + 1 != ans:
            persons[j] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
import sys
N,K,Q =map(int,input().split())
F = {}
a = []
for l in sys.stdin:
    a.append(int(l))

for i in range(N):
    F[str('A'+ str(i+1))] = K
for i in range(N):
    cnt = a.count(i+1)
    F[str('A'+ str(i+1))] = F[str('A'+str(i+1))] - (Q - cnt)
for i in range(N) :
    if F[str('A'+ str(i+1))] >= 1 :
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
a = list(map(int, input().split()))
inp = []
for i in range(a[2]):
    inp.append(int(input()))
n_dict = {}
for i in range(a[0]):
    n_dict[i+1] = a[1]
for i in range(a[2]):
    for k , v in n_dict.items():
        n_dict[k] -= 1
for i in range(a[2]):
    n_dict[inp[i]] += 1
for kk , vv in n_dict.items():
    if int(vv) <= 0:
        print('No')
    else:
        print('Yes')