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

    def calc(n):
        return n-1

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

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

ninzu, k, seikaisu = map(int, input().split())

sankasya = np.array([k] * ninzu)

for i in range(seikaisu):
    sankasya = sankasya - 1
    seikaisya = int(input()) - 1 
    sankasya[seikaisya] = sankasya[seikaisya] + 1

for point in sankasya:
    if point > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

for i in initializer_list:
    if 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 a.count(i+1)>=Q-K+1:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

Solution code:
# -*- coding:utf8 -*-

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

Submission status: Time Limit Exceeded

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

for i in range(Q):
    A = int(input())
    p = [n-1 for n in p]
    p[A-1] = p[A-1] + 1
for i in p:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
def main():
    N,K,Q = map(int,input().split())
    A=[int(input()) for i in range(Q)]
    Ns = []
    for _ in range(N):
        Ns.append(0)
    for i in A:
        Ns[i-1] += 1
    for j in range(N):
        if K<=sum(Ns)-Ns[j]:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N, K, Q = (int(x) for x in input().split())
score = np.array([K for i in range(N)])
A = []
for i in range(Q):
    A.append(int(input()))

for a in A:
    idx = a - 1
    score = score -1
    score[idx]+=1
    
for s in score:
    if s > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().split())
member = [K] * N
flag = False


for i in range(0, Q):
    n = int(input())

    for j in range(0, N):
        if not j == n-1:
            member[j] = member[j] - 1

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n,k,q = map(int, input().split())
mem = []
for i in range(q):
    mem.append(int(input()))
for i in range(1,n+1):
  out = k-q  
  for j in range(q):
      if mem[j]==i:
          out +=1

  if out >0:
      print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

pts = [K - Q]*N
for ai in A:
    for i, _ in enumerate(pts):
        if (i+1)==ai:
            pts[i] += 1

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

Submission status: Time Limit Exceeded

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

for i in initializer_list:
    if 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 _ in range(q)]
if k>100000:
  for _ in range(n):
    print("Yes")
else:
  for i in range(1,n+1):
    m=a.count(i)
    b=k-q+m
    if b<=0:
      print("No")
    else:
      print("Yes")

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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


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


for i in range(len(a_i)):
    for j in range(len(score)):
        if(a_i[i] == j):
            pass
        else:
            score[j] -= 1
    

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

Submission status: Time Limit Exceeded

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

A_list = []

#A
for i in range(Q):
    aaa =int(input())
    A_list.append(aaa)

#print(A_list)
point_list = [K]*N
#print(point_list)

for i in A_list:
     aaa=point_list.pop(i-1)
     point_list = list(map(lambda x: x-1, point_list))
     point_list.insert(i-1,aaa)

#print(point_list)

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

Submission status: Time Limit Exceeded

Solution code:
n, k, q = list(map(int, input().split()))
p = [k]*n
for i in range(q):
    a = int(input())
    for j in range(n):
        if j != a-1:
            p[j] -= 1
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())
l=[int(input()) for i in range(q)]
d=dict(zip(range(n),[k]*n))

for i in l:
  for j in d.keys():
    if i==j:
      d[i-1]+=1

for i in d.values():
  if i-q>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(0,Q):
    x = int(input())
    a.append(x)

l = [K] * N

for i in a:
    for n in range(0,N):
        if n == (i-1):
            pass
        else:
            l[n] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
a, b, c = map(int, input().split())
array = []
for i in range(c):
	array.append(int(input()))
 
point = [b] * a
 
for i in range(c):
	for j in range(len(point)):
		if j+1 != int(array[i]):
			point[j] = point[j] -1
            
for i in range(len(point)):
	if point[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 _ in range(Q)]
for i in range(N):
    ans = K - Q + A.count(i+1)
    # print(ans)
    if ans > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

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

for n in range(N):
    ans = 'No'
    total = sum(P) - P[n]
    if  K - total > 0:
        ans = 'Yes'
    print(ans)

Submission status: Time Limit Exceeded

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

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

ans_list = [K] * N
# print(ans_list)

for i in range(Q):
    for j in range(N):
        if j != A[i]-1:
            ans_list[j] -=1
#     print(ans_list)
for i in range(N):
#     print(ans_list[i])
    if ans_list[i] > 0:
          print("Yes")
    else:
          print("No")

Submission status: Time Limit Exceeded

Solution code:
x = map(int,raw_input().split())
n=x[0]
k=x[1]
q=x[2]

a=[]

for i in range(q):
    y=int(raw_input())
    a.append(y-1)

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

Submission status: Time Limit Exceeded

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

adict = {i + 1: k for i in range(n)}

for _ in range(q):
    a = int(input())

    for k, v in adict.items():
        if k != a:
            adict[k] = v - 1

for v in adict.values():
    if v > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
def main():

    N, K, Q = map(int, input().split())
    player = [K] * N
    A = []
    for _ in range(Q):
        a = int(input())
        A.append(a)
    for i in range(Q):
        player[A[i] - 1] += 1
        player = [j - 1 for j in player]
    for k in range(N):
        if player[k] <= 0:
            print("No")
        else:
            print("Yes")

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().split())
A, P = [], []
for q in range(Q):
  A.append(int(input()))
for _ in range(N):
  P.append(K)
for a in A:
  for i, p in enumerate(P):
    if i != (a - 1):
      P[i] -= 1
for p in P:
  if p <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Time Limit Exceeded

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

a = list(map(int, [input() for i in range(q)]))
b = [k]*n

cnt = k-q

for j in range(1,n+1):
    if cnt+a.count(j)>0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int,input().split())
scorelist = []
for i in range(N):
    scorelist.append(K)
collist = []
for i in range(Q):
    collist.append(int(input()))
for i in range(Q):
    scorelist = list(map(lambda x:x - 1, scorelist))
    scorelist[collist[i - 1] - 1] += 1
for i in scorelist:
    if 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

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

Submission status: Time Limit Exceeded

Solution code:
# coding:utf-8
import sys
def main():
    l = list(map(int, input().split()))
    lists= [int(input()) for _ in range(l[2])]

    sanka   = [l[1]] * l[0]

    for num in lists:
        if sanka[num-1] != 'No':
            sanka[num-1] = sanka[num-1] + 1
        for i in range(l[0]):
            if sanka[i] != 'No':
                sanka[i] = sanka[i] -1
                if sanka[i] == 0:
                    sanka[i] = 'No'

    for i in sanka:
        if i == 'No':
            print(i)
        else:
            print('Yes')


if __name__ == '__main__' :
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

res = np.zeros(N) + K
for a in As:
    res -= 1
    res[a-1] += 1

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    N,K,Q = list(map(int,input().split()))
    A =[]
    for i in range(Q):
        A.append(input())
    P = []
    for i in range(N):
        P.append(K)
    def calc(n):
        return n-1

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

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

Submission status: Time Limit Exceeded

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

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

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

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

big_prime = 1000000007

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

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""
n,k,q =  map(int, sys.stdin.readline().split())
l=[0]*n
def penalty(b):
    return b + 1

for i in range(q):
    a =  int(sys.stdin.readline())
    l=list(map(penalty, l))
    l[a-1]-=1

for e in l:
    if e >=k:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

Solution code:
round_data = input().split(" ")
member_count = int(round_data[0])
member = []

for i in range(member_count):
    member.append(int(round_data[1]))

for i in range(1,int(round_data[2])+1):
    correct = int(input())
    for i in range(member_count):
        if correct-1 != i:
            member[i] -= 1
            
for i  in range(len(member)):
    if member[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
#coding:utf-8

n, k, q = map(int, input().split())
a = [input() for i in range(q)]
point = [k] * n
#print(point)

for i in range(0, q):
    point = [j-1 for j in point]
    point[int(a[i])-1] += 1
    #print(point)

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

# print(A)

pts = [K]*N
for ai in A:
    for i, _ in enumerate(pts):
        if (i+1)!=ai:
            pts[i] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

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

points = np.full(N, K)

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

for point in points:
    if point > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
#coding:utf-8
N,K,Q=map(int,input().split())
player={i+1:K for i in range(N)}

for _ in range(Q):
    ansplayer=int(input())
    for i in player.keys():
        if i == ansplayer:
            pass
        else:
            player[i] -= 1

for i in player.keys():
    if player[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

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

p = [K for n in range(N)]

for i in a:
    for n in range(N):
        if n != i-1:
            p[n] = p[n] - 1

for n in range(N):
    if p[n] > 0:
        print('Yes', end='')
    else:
        print('No', end='')
    if n != N-1:
        print()

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
A = [K] * N
B = ["Yes"] *N
if K>Q:
    for i in range(N):
        print(B[i])
else:
    for i in range(Q):
        a=int(input())-1
        for j in range(N):
            if j!=a and A[j]>0:
                A[j]=A[j]-1
    for k in range(N):
        if A[k]>0:
            print("Yes")
        else:
            print("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)]
score = np.array([int(K) for __ in range(N)])
score_1 = np.array([1 for _mi in range(N)])

for i in range(Q):
    score -= score_1
    score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
    if score[k] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

p = [K for n in range(N)]

for i in a:
    for n in range(N):
        if n != i-1:
            p[n] = p[n] - 1

for n in range(N):
    if p[n] > 0:
        print('Yes', end='')
    else:
        print('No', end='')
    if n != N-1:
        print()

Submission status: Time Limit Exceeded

Solution code:
member, start, round = list(map(int, input().split()))
answer = []
counter = []
for i in range(round):
    answer.append(int(input()))

for i in range(1, member+1):
    counter.append(answer.count(i))

for i in range(member):
    if (start - (round - counter[i])) <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

b = [k]*n

for i in range(q):
    a = int(input())
    b[a-1] += 1
    b = list(map(lambda x: x-1, b))

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

Submission status: Time Limit Exceeded

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

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

point = [K]*N
list = [0]*N

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

for i in range(N):
  if point[i] - (Q - list.count(i+1)) > 0:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

for _ in range(Q):
    win = int(input()) -1
    P_list = list(map(lambda x:x-1, P_list))
    P_list[win] += 1


for i in range(N):
    if P_list[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())

a = np.full(n, k)

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

a_tuple = tuple(a)
for sankasha_point in a_tuple:
    if sankasha_point > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin

n,k,q = [int(x) for x in stdin.readline().rstrip().split()]
li = [stdin.readline().rstrip() for i in range(q)]
li = [int(v) for v in li]
lin = [k for _ in range(n)]
for i in range(q):
    lin[li[i]-1] += 1
    for s in range(n):
        lin[s] -= 1
for j in range(n):
    if lin[j] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

points = [K] * N

for a in A :
    for j,p in enumerate(points) :
        if j+1 != a :
            points[j] -= 1

for p in points :
    print('No') if p <= 0 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)]
B = [K-Q]*N

for i in range(N-1):
    B[i] += A.count(i+1)

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

Submission status: Time Limit Exceeded

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

p=[k]*n

for a in range(0,q):
  for x in range(0,n):
    p[x]-=1
  p[d[a]-1]+=1

for l in range(0,n):
  if p[l]>0:
    print('Yes')
  else:
    print('No')

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
N, K, Q = map(int, input().split())
score = []
for i in range(N):
    score.append(K)

for i in range(Q):
    answer = int(input()) - 1
    for idx in range(N):
        if idx == answer:
            continue
        score[idx] -= 1

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
a, b, c = map(int, input().split())
array = []
for i in range(c):
	array.append(int(input()))

point = [b] * a
 
for i in range(c):
	for j in range(len(point)):
		if j+1 != int(array[i]):
			point[j] = point[j] -1
            
for i in range(len(point)):
	if point[i] > 0:
		print('Yes')
	else:
		print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n, k, q = map(int, input().split())
points = np.full(n, k)
minus = np.full(n, -1)
for i in range(q):
    a = int(input())
    points = points + minus
    points[a - 1] += 1
for point in points:
    if point > 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 _ in range(Q)]

dp = [K] * N


def calc_dp(n):
    return n - 1


for i in A:
    dp = list(map(calc_dp, dp))
    dp[i - 1] += 1


for j in dp:
    if j > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
# C - Attack Survival
N, K, Q = map(int, input().split())
a = [int(input()) for i in range(Q)]
A = 1 - (K-Q)
# print(N,K,Q,a,A)
for i in range(N):
    if a.count(i+1) >= A:
        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)]
man = [K] * N
for i in A:
		man = list(map(lambda x: x - 1, man))
		man[i-1] += 1

for out in man:
		if out <= 0:
				print("No")
		else:
				print("Yes")

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    N,K,Q = list(map(int,input().split()))
    A =[]
    for i in range(Q):
        A.append(input())
    P = []
    for i in range(N):
        P.append(K)
    def calc(n):
        return n-1

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

P = [K for _ in range(N)]

for i in range(Q):
    ans = A[i]
    P = list(map(lambda x:x-1,P))
    P[ans-1] += 1

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

    else:
        print('No')

Submission status: Time Limit Exceeded

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

alist = [k for _ in range(n)]

for _ in range(q):
    a = int(input())

    for i, l in enumerate(alist):
        alist.pop(i)
        if a == i + 1:
            alist.insert(i, l)
        else:
            alist.insert(i, l - 1)

for l in alist:
    if l > 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()))
for i in range(1,n+1):
    point = a.count(i)
    if k - q + point > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
A_list = []
i = 0
while i < Q:
  A_list.append(int(input()))
  i += 1

N_list = np.array([K] * N)

for idx, A in enumerate(A_list):
  minus_list = np.array([-1] * N)
  minus_list[A-1] += 1
  N_list = N_list + minus_list

for N in N_list:
  if N <= 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 = [int(input()) for _ in range(q)]
p = np.array([k for i in range(n)])
for i in a:
  p = p - 1 
  p[i-1] += 1
for i in p:
  if 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)]

lst = [K for _ in range(N)]

for i in range(len(A)):
  for k in range(len(lst)):
    if k+1 != A[i]:
      lst[k] = lst[k]-1

for i in range(len(lst)):
  if lst[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()))
for i in range(1,n+1):
  if k + a.count(i) > q:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

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

p = [K for n in range(N)]

for i in a:
    for n in range(N):
        if n != i-1:
            p[n] = p[n] - 1
        if p[n] == 0:
            flag = True

for n in range(N):
    if p[n] > 0:
        print('Yes', end='')
    else:
        print('No', end='')
    if n != N-1:
        print()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n,k,q = list(map(int, input().split()))
win_lst = []
for i in range(q):
  winner = int(input())
  win_lst.append(winner)
#print(win_lst)
    
win_ct_lst = []
for j in range(1, n + 1):
  win_ct_lst.append(win_lst.count(j))
#print(win_ct_lst)

lose_pt_lst = []
for m in range(len(win_ct_lst)):
  lose_pt_lst.append(win_ct_lst[m] - sum(win_ct_lst))

for l in range(len(win_ct_lst)):
  if (k + lose_pt_lst[l] >= 1):
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

for _ in range(n):
    b.append(k)

for i in range(q):
    a = int(input())
    b[a-1] += 1
    b = list(map(lambda x: x-1, b))

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

Submission status: Time Limit Exceeded

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

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:
import collections
n,k,q = map(int,input().split())
alist = [int(input()) for i in range(q)]

"""
atuple = tuple(alist)

acount = collections.Counter(atuple)
print(acount,q,k)
tlist = []
for key,v in acount.items():
    if q - v < k:
        tlist.append(key)
"""

for i in range(1,n+1):
    if q - alist.count(i) < k:
        print("Yes")
    else:
        print("No")