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:
n,k,q = list(map(int,input().split()))
a = [int(input()) for i in range(q)]
t = ["No"]*(n-max(a))
if k - q > 0:
        print(*["Yes"]*n,sep="\n")
        exit()
for i in range(1,max(a)+1):
    if k + a.count(i) - q > 0 :
        print("Yes")
    else:
        print("No")
print(*t,sep="\n")

Submission status: Time Limit Exceeded

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

for i in range(q):
    a_i = int(input())-1
    for j in range(len(score)):
        if(j == a_i):
            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:
import numpy as np
N, K, Q = list(map(int, input().split()))

vec = np.ones(N)*K

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

ret = '\n'.join(['Yes' if x > 0 else 'No' for x in vec])
print(ret)

Submission status: Time Limit Exceeded

Solution code:
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        #または、quit(),os.exit()をして止める。
#print(listA)
n,k,q=listA[0]
#print(n,k,q)

point=[k]*n
for i in range(len(listA)-1):
  for j in range(n):
    if((j+1)!=listA[i+1][0]):
   	  point[j]=point[j]-1
for i in range(n):
  if(point[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()))

res = [K]*N

for i in range(Q):
    res = list(map(lambda x: x-1,res))
    temp = A[i]-1
    res[temp] = res[temp] + 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())
anss = []
for i in range(q):
  anss.append(int(input()))
#N人、持ち点K、問題Q

for i in range(n):
  tmp = anss.count(i+1)
  if tmp > q-k:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

sanka = [K] * N

for i in range(Q):
  a = int(input())	
  A.append(a-1)
  
  for j in range(N):
    sanka[j] -= 1
  sanka[A[i]] += 1

for i in range(N):
  if sanka[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())
points = np.full(n, k)
minus = np.full(n, -1)
for i in range(q):
    a = int(input())
    points = np.array(points) + np.array(minus)
    points[a - 1] += 1
for point in points:
    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())
 
points = np.array([K for _ in range(N)])
 
for q in range(Q):
    A = int(input()) - 1
    points -= 1
    points[A] += 1
 
[print('Yes') if p > 0 else print('No') for p in points]

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

# print(N)
# print(K)
# print(Q)

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

for i in range(Q):
    # print(i)
    A = int(input())
    # print(A)
    
    for j in range(N):
        if j + 1 != A:
            scores[j] -= 1
            
# print(scores)

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())
point = {}
tmp = 0

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

    else:
        point[tmp] = 1

for b in range(1, n + 1):
    tmp = 0

    if b in point:
        tmp = sum(point.values()) - point[b]

    else:
        tmp = sum(point.values())

    if tmp >= k:
        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)]

m = [k] * n

for c in a :
    for e in range(n) :
        if(not(c-1 == e)) :
            m[e] -= 1

for j in range(n) :
    if(m[j] > 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)]
scores = [K] * N
for n in range(N):
    scores[n] = scores[n] + A.count(n+1)
    if scores[n] > Q:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N , K ,Q = map(int, input().split())
s = []
s = [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:
import numpy as np

inputData = input().split()
N, K, Q = [int(x) for x in inputData]
points = np.array([K]*N)

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

n = list(map(int, input().split()))

a = []

for i in range(n[2]):
    a.append(int(input()))

if n[1] > n[2]:
    for c in range(n[0]):
            print('Yes')

else:
    m = [n[1]]*n[0]

    x = np.array(m)
    for j in range(n[2]):
        x -= 1
        x[a[j]-1] += 1

    for num in range(n[0]):
        if x[num] <= 0:
            print('No')
        else:
            print('Yes')

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python
# -*- coding:utf-8 -*-


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

winner_list = []
for _ in range(Q):
    A_i = int(input().strip())
    winner_list.append(A_i)

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

for A_i in winner_list:
    point_list = [k if i+1 == A_i else k - 1 for i, k in enumerate(point_list)]

is_win = [True if point_list[i] > 0 else False for i in range(N) ]

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

Submission status: Time Limit Exceeded

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

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

p = list()
for n in range(N):
    p.append(K)

for i in a:
    for n in range(N):
        p[n] = p[n] - 1
    p[i-1] = p[i-1] + 1
    flag = False
    for n in range(N):
        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:
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
for j in range(n):
    if k+a.count(j+1)-q>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):
    for i2 in range(len(scorelist)):
        scorelist[i2 - 1] -= 1
    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())
As = [int(input()) for i in range(q)]
points = {i: k for i in range(n)}
for i in range(q):
    solver = As[i] - 1
    for j in range(n):
        if j == solver:
            continue
        else:
            points[j] -= 1
for i in range(n):
    if points[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    human = np.full(N, K)

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

    for j in range(N):
        if human[j] > 0:
            print(YES)
        else:
            print(NO)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
point = np.zeros(N, dtype='int') + K
for i in range(Q):
    x = int(input())
    point[x - 1] = point[x - 1] + 1
    point = point - 1
    
for i in range(N):
    if point[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

cur_k = [k] * n

for i in range(q):
  for j in range(n):
    if (a[i] - 1) != j:
      cur_k[j] -= 1
#  print(a[i], cur_k)
    

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

Submission status: Time Limit Exceeded

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

b = [k] * n
for i in range(q):
  b = list(map(lambda x: x - 1, b))
  b[a[i] - 1] += 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())
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:
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:
    for k in range(len(score)):
        score[k] = score[k] - 1
    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:
N, K, Q = [int(s) for s in input().split(' ')]
# A = [int(input()) for s in range(Q)]

# syoki_tokuten = [K for s in range(N)]
syoki_tokuten = [0] * N

# for i in A:
for ii in range(Q):
  i = int(input())
  syoki_tokuten[i-1] += 1
  
for i in range(N):
  genten = sum(syoki_tokuten) - syoki_tokuten[i]

  if genten < K:
    print('Yes')
  else:
    print('No')

Submission status: Time Limit Exceeded

Solution code:

import numpy as np
N , K ,Q = map(int, input().split())
s = []
s = [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 range(len(initializer_list)):
    if initializer_list[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

sankasya = [k] * ninzu

for i in range(seikaisu):
    sankasya = list(map(lambda x: x-1, sankasya))
    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:
N, K, Q = list(map(int, input().split()))
A = [int(input()) for i in range(Q)]
scores = [K] * N
for n in range(N):
    scores[n] = scores[n] + A.count(n+1)
for n in range(N):
    if scores[n] > Q:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:

# coding: utf-8

# In[3]:


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


# In[6]:


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


# In[10]:


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

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
score=[K]*N
A=[]
for _ in range(Q):
    A.append(int(input()))
for i in A:
    for j in range(i-1):
        score[j]-=1
    for k in range(i,N):
        score[k]-=1
for s in score:
    if s>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 q - a.count(i+1) < k:
                print('Yes')
        else:
                print('No')

Submission status: Time Limit Exceeded

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

for a in A:
    idx = a - 1
    for i in range(len(score)):
        score[i]-=1
    score[idx]+=1
    
for s in score:
    if s > 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)]
l1=[]
for i in range(q):
    l1.append(int(input()))
for i in l1:
    for j in range(n):
        if j!=i-1:
            l[j]-=1
for i in l:
    if(i<=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 = list(int(input()) for i in range(q))

p = np.zeros(n, dtype=int)

for i in range(q):
  ind = np.ones(n, dtype=bool)
  ind[a[i]-1] = False
  p[ind] -=1

for i in range(n):
  if k + p[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())
points = []
minus = []
for i in range(n):
    points.append(k)
    minus.append(-1)
for i in range(q):
    a = int(input())
    points = np.array(points) + np.array(minus)
    points[a - 1] += 1
for point in points:
    if point > 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 = list(map(int, input().split()))

ans = [K] * N

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

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

Submission status: Time Limit Exceeded

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

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

    for i in A:
        points = list(map(lambda x: x - 1, points))
        points[i - 1] += 1

    for i in points:
        if i <= 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 = [int(input()) for i in range(Q)]
point_list = [K]*N
for answer in A:
    point_list = list(map(lambda x: x-1, point_list))
    point_list[answer-1] += 1
    
for ans in point_list:
    if ans > 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)]
score = [int(K) for __ in range(N)]

for i in range(Q):
    for m in range(N):
        score[m] = score[m]-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())
a=[input() for i in range(q)]
for j in range(n):
    if k+a.count(str(j+1))-q>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)]


arr = []
for i in range(1, n+1):
    arr.append(a.count(i))


for x in arr:
    if k - q + x > 0:
        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))

while len(b) > 0:
    if b[0] > 0:
        print('Yes')
    else:
        print('No')
    del b[0]

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import sys


def main():
    N, K, Q = map(int, input().split())
    score = []
    for i in range(Q):
        score.append(int(input())-1)
    score = np.array(score)
    for i in range(N):
        if K - Q +len(score[score==i]) > 0:
            print("Yes")
        else:
            print("No")




if __name__ =='__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n, k, q = map(int, input().split())
As = [int(input()) for i in range(q)]
points = [k for i in range(n)]
for i in range(q):
    solver = As[i] - 1
    for j in range(len(points)):
        if j == solver:
            continue
        else:
            points[j] -= 1
for i in range(len(points)):
    if points[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 i in range(q)]
t = ["No"]*n
for i in range(1,max(a)+1):
    if k - q > 0:
        print(*["Yes"]*n,sep="\n")
        exit()
    elif k + a.count(i) - q > 0 :
        t[i-1] = "Yes"
print(*t,sep="\n")

Submission status: Time Limit Exceeded

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

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

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

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

for i in range(N):
  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 i in range(Q)]
score = [a.count(x) for x in range(1, N+1)]
yn = ['No', 'Yes']

ans = [yn[min(1,max(K+x-Q,0))] for x in score]

for y in ans:
    print(y)

Submission status: Time Limit Exceeded

Solution code:
n,k,q=map(int,input().split())
x=list(int(input()) for _ in range(q))

import numpy as np

p=np.array([k]*n)

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

Submission status: Time Limit Exceeded

Solution code:
n,k,q=map(int,input().split())
a=list([k for i in range(n)])
for m in range(q):
  c=int(input()) - 1
  a=[a[i]-1 if i!=c else a[i] for i in range(n)]
print("\n".join(["No" if i<1 else "Yes" for i in a]))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(q):
  tmp = a[i]
  for j in range(len(K)):
    K[j] -= 1
  K[int(tmp)-1] = K[int(tmp)-1]+1
  
for k in range(len(K)):
  if K[k] > 0:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

Solution code:
import collections

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

for i in range(n):
    if collections.Counter(a)[str(i+1)] > q-l:
        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): # round
    for j in range(1, N+1):
        if A[i-1] != j:
            ans[j-1] -= 1
for k in ans:
    if k <= 0:
        print('No')
    else:
         print('Yes')

Submission status: Time Limit Exceeded

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

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

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

for index in A:
    for i, p in enumerate(people):
        if i != index - 1:
            people[i] -= 1

for i in people:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

for a in alist:
    for j in range(n):
        if not j == (a-1):
        	pts[j] -= 1

for b in range(n):
    if pts[b] < 1:
        print('No')
    else:
        print('Yes')

Submission status: Time Limit Exceeded

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

for _ in range(q):
    i = int(input()) - 1
    for j in range(n):
        if j != i:
            li[j] -= 1

for j in li:
    if j > 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 = []
s = [int(input())-1 for _ in range(Q)]
initializer_list = np.full(N,K)
for i in range(len(s)):
    for j in range(len(initializer_list)):
        if j == s[i]:
            pass
        else:
            initializer_list[j] -= 1
for i in range(len(initializer_list)):
    if initializer_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())
person = np.asarray([K] * N)

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

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

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):
  if a.count(i+1) > q-k :
    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] * N



for A_ch in A:
    for i in range(N):
        if A_ch - 1 != i:
            P[i] -= 1 
        
for P_ch in P:
    if P_ch > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

points = np.array([K for _ in range(N)])
yes_no = ['Yes' for _ in range(N)]

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

[print('Yes') if p > 0 else print('No') for p in points]

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

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

Submission status: Time Limit Exceeded

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

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

for i in range(n):
    score.append(k)

for i in range(len(li)):
    for j in range(len(score)):
        if j != li[i]-1:
            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 = []
for i in range(Q):
    A.append(int(input()))

#print(N,K,Q)
#print(A)

P = [K for _ in range(N)]
#print(P)
for a in A:
    for n in range(N):
        if (n==(a-1)):
            P[n] += 1

#print(P)

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

Submission status: Time Limit Exceeded

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

out = []
for i in range(len(lst)):
  if lst[i] > 0:
    out.append('Yes')
  else:
    out.append('No')
      
[print(i) for i in out]

Submission status: Time Limit Exceeded

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

P=[K]*N
P1=np.array(P)
for i in A:
    P1=P1-1
    P1[i-1]=P1[i-1]+1
for i in range(len(P1)):
    if P1[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)) >0:
    print('Yes')
  else:
    print('No')

Submission status: Time Limit Exceeded

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

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

for i in range(n) :
    S.append(int(k))
    if S[i] - len(A) + A.count(i+1) > 0 :
        print('Yes')
    else :
        print('No')

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys

input = sys.stdin.readline
n, k, q = map(int, input().split())
a = []

for i in range(n):
    a.append(k)

for i in range(q):
    b = int(input())
    for j in range(n):
        if j != (b - 1):
            a[j] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = [int(i) for i in input().split()]
l = [K for i in range(N)]
for i in range(Q):
    n = int(input())-1
    for j in range(N):
        if j != n:
            l[j] -= 1
for i in range(N):
    if l[i] >= 1:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for i in range(q):
    for j in range(n):
        if j + 1 != ans[i]:
            pts[j] -= 1

for it in pts:
    print("Yes" if it > 0 else "No")

Submission status: Time Limit Exceeded

Solution code:
inputData = input().split()
N, K, Q = [int(x) for x in inputData]
points = [K]*N

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

Submission status: Time Limit Exceeded

Solution code:
n,k,q = map(int,input().split())
a = [0]*q
score = [k]*n
for i in range(q):
    a[i] = int(input())
    for j in range(n):
        if j != a[i]-1:
            score[j] -= 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 = map(int,input().split())
a = list (int(input()) for hogehoge in range(q))
for i in range(1,n+1):
         if a.count(i) >= (q-k+1):
                  print("Yes")
         else:
                  print("No")

Submission status: Time Limit Exceeded

Solution code:
import sys
input=sys.stdin.readline
z=list(map(int,input().split()))
a,b,c=[],[],z[2]-z[1]
for i in range(z[2]):
    a.append(int(input()))
for i in range(z[0]):
    if c-a.count(i+1)>=0:
        print('No')
    else:
        print('Yes')

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import numpy as np

N, K, Q = map(int, input().split())
a = np.full(N, K, dtype=int)

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

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