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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in input().split()] 
out = 0

out = a[0] + a[n - 2]
for i in range(n - 2):
	out += min(a[i], a[i+1])  
    
print(out)

Submission status: Runtime Error

Solution code:
import numpy as np
n, k, q = map(int, input().split())
a = [0] * q
for i in range(q):
    a[i] = int(input())

p = [k] * n
for i in range(q):
    for j in range(n):
        p[j] -= 1
    p[i] += 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
def print_ans(N, K, Q, arr):
    """Test Case
    >>> print_ans(6, 3, 4, [3, 1, 3, 2])
    No
    No
    Yes
    No
    No
    No
    >>> print_ans(6, 5, 4, [3, 1, 3, 2])
    Yes
    Yes
    Yes
    Yes
    Yes
    Yes
    >>> print_ans(10, 13, 15,[3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9])
    No
    No
    No
    No
    Yes
    No
    No
    No
    Yes
    No
    """
    point = [K - Q] * N
    for a in arr:
        point[a - 1] += 1
    ans_arr = ["Yes" if p > 0 else "No" for p in point]
    for ans in ans_arr:
        print(ans)

if __name__ == '__main__':
    N, K, Q = map(int,input().rstrip().split())
    arr = [ int(line) for line in input()]
    print_ans(N, K, Q, arr)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
import collections

n, k, q = map(int, input().split(' '))
t = [int(input()) for i in range(q)] 
 
ans = [k - q] * n

t_cnt = collections.Counter(t)
for i, j in t_cnt.items():
  ans[i] += j
    
for i in ans:
  if i > 0:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input().split(" ")
mem = [0] * int(a[0])
for i in range(int(a[2])):
  mem[int(input())-1] += 1
for i in mem:
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
people_num, first_point, correct = map(int,input().split())
people = [input() for i in range(people_num)]
points = [correct for i in range(people_num)]
 
for i in range(correct):
  for j in range(people_num):
    if j != i:
      points[j] -= 1
      if points[j] == 0:
        prints[j] = - 100000000
        
for i in range(people_num):
  if points[i] < 0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
people_num, first_point, correct = map(int,input().split())
people = [input() for i in range(people_num)]
points = [correct for i in range(people_num)]
 
for i in range(correct):
  for j in range(people_num):
    if j != i:
      points[j] -= 1
      if points[j] == 0:
        prints[j] = - 100000000
        
for i in range(people_num):
  if points[i] < 0:
  	print("No")
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
people_num, first_point, correct = map(int,input().split())
people = [input() for i in range(people_num)]
points = [correct for i in range(people_num)]

for i in range(correct):
  for j in range(people_num):
    if j != i:
      points[j] -= 1
      if points[j] == 0:
        prints[j] = - 100000000

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

Submission status: Runtime Error

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

points = [0]*n
for i in range(q):
    points[a_r[i]] += 1

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

Submission status: Runtime Error

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

points = [0]*n
for i in range(q):
    points[a[i]] += 1
ans = 0
for i in range(n):
    if points[i] >= k:
        ans += 1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())
a=[int(input()) for i in range(Q)]
li=np.array([0]*n)
d=np.array([k-q]*n)
for j in range(0,len(a)):
  li[a[j]-1]+=1

  
ans=np.array(li+d)


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

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())
a=[int(input()) for i in range(Q)]
li=np.array([0]*n)
d=np.array([k-q]*n)
for j in range(0,len(a)):
    li[a[j]-1]+=1

    
ans=np.array(li+d)
print(ans)
for m in range(0,n):
    if ans[m]>0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
a=[int(input()) for i in range(Q)]
li=[0]*n
d=[k-q]*n
for j in range(0,len(a)):
  li[a[j]-1]+=1
  
ans=li+d

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

Submission status: Runtime Error

Solution code:
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math

from scipy.sparse.csgraph import floyd_warshall
N,K,Q = map(int,input().split())
A=[]*N
score = [K] * N

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

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

Submission status: Runtime Error

Solution code:
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math

from scipy.sparse.csgraph import floyd_warshall
N,K,Q = map(int,input().split())
A=[]*Q
score = [K] * N

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

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

Submission status: Runtime Error

Solution code:
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math

from scipy.sparse.csgraph import floyd_warshall
N,K,Q = map(int,input().split())
A=[]*Q
score = [K] * N

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

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

Submission status: Runtime Error

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

a=[]
for q in range(Q):
    a.append(int(input()))

cnt=[0]*N
for q in range(Q):
    cnt[int(a[q])-1]+=1

'print(cnt)

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

Submission status: Runtime Error

Solution code:
N,K,Q=map(int,input().split()) #Nは人の人数、Kはみなが最初に持っているポイント、Qはクイズの回数
L=[K]*N
for i in range(Q):
  m=int(input())-1
  for j in range(N):
    if j!=m:
      L[i]-=1
for k in range(N):
  if L[k]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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(q):
    b[a[i - 1]] += 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = input().split()
y = [int(input()) in i in range(int(x[2]))]
member = [int(x[1])] * int(x[0])

for l in y:
  for i,point in enumerate(member):
    if (l-1) != i:
      member[i] = (point -1)
      
for z in member:
  if z > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
p = np.array([K] * N)
m = np.array([1] * N)
for i in range(Q):
  A = int(input())
  #p = [p[i] - m[i] for i in range(len(p))]
  p = p - m
  p[A-1] = p[A-1] + 1
  if sum(p) == 0:
    break
for s in p:
  if s > 0:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = [K-Q] * N

    for answer_id in A:
        answer_id -= 1
        point[answer_id] += 1

    return '\n'.join(list(map(winner_or_loss, point)))


print(solve())

Submission status: Runtime Error

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

#print(a_list)
for j in a_list:
    if int(j) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
from collections import defaultdict


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

num_ans = defaultdict(int)
for i in a:
    num_ans[i-1] += 1

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().strip().split())
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
sumansl = sum(countl.values())
for i in range(N):
    print('Yes') if sumansl-countl[i+1] < K else print('No')

Submission status: Runtime Error

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

score = []
for _ in range(N):
    score.append(0)

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(k, n)
for i in range(q):
  point-=1
  point[int(input())-1]+=1

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

Submission status: Runtime Error

Solution code:
import numpy as np

N, K, Q = [int(x) for x in input().split()]

A = list()
while True:
    line = input()
    if line:
        A.append(int(line))
    else:
        break

scores = np.zeros((N), dtype=np.int32)

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

scores = scores + K

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
ans=[-q]*n
for i in range(q):
  a=int(input())
  ans[a]+=1
print(sum(x > -k for x in ans))

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
ans=[-q]*n
for i in ragne(q):
  a=int(input())
  ans[a]+=1
print(count(x > -k for x in ans))

Submission status: Runtime Error

Solution code:
#include <stdio.h>
#include <string.h>

int main(int argc, char const *argv[]) {
    int N, K, Q, i, j;
    scanf("%d%d%d", &N, &K, &Q);
    int A[N];
    memset(A, 0, N * sizeof(int));
    for (int i = 0; i < Q; i++) {
        scanf("%d", &j);
        A[j - 1]++;
    }
    for (int i = 0; i < N; i++) {
        if (Q - A[i] < K)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
#include <stdio.h>
#include <string.h>

int main(int argc, char const *argv[]) {
    int N, K, Q, i, j;
    scanf("%d%d%d", &N, &K, &Q);
    int A[N];
    memset(A, 0, N * sizeof(int));
    for (int i = 0; i < Q; i++) {
        scanf("%d", &j);
        A[j - 1]++;
    }
    for (int i = 0; i < N; i++)
        if (Q - A[i] < K)
            printf("YES\n");
        else
            printf("NO\n");
    return 0;
}

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [k]*n
j = 0
while(j<len(L)):
    for i in range(len(N)):
        if i+1 != L[j]:
            N[i] -= 1
    j +=1

for i in range(N):
    if i>0:
        print('YES')
    else:
        print('NO')

Submission status: Runtime Error

Solution code:
import sys

N, K, Q = [int(n) for n in sys.stdin.readline().strip().split()]
ans_idx = [int(sys.stdin.readline().strip()) for _ in range(Q)]
scores = [0]*N

for ai in ans_idx:
  scores[ai] += 1
scores = [K-(s-Q) for s in scores]

for s in scores:
  print('No' if s<=0 else 'Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

dic = {}

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

Submission status: Runtime Error

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

point_list = [K-Q]*N

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

Submission status: Runtime Error

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

point_list = [K-Q]*N

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q = map(int, input().split(" "))
point_list = np.array([K]*N)

change = np.array([0]*N)
cnt = 1

ans_num_list = [int(input()) for _ in range(Q)]
#print(ans_num_list)

for i in ans_num_list:
  change[i] += 1
  change = change - 1

output = point_list + change
# print(output)

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q = map(int, input().split(" "))
point_list = np.array([K]*N)

change = np.array([0]*N)
cnt = 1

ans_num_list = [int(input()) for _ in range(Q)]
#print(ans_num_list)

for i in ans_num_list:
  change[i] += 1
  change = change - 1

output = point_list + change
# print(output)

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

Submission status: Runtime Error

Solution code:
i = list(map(int, input().split))
list = [-i[1]]*i[0]
for j in range(i[2]):
    list[int(input())-1] += 1

for ans in list:
    if ans > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for x in a:
  if k - q + x > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

for x in a:
  if k - q + x > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

lis = []
point = []

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

for x in range(int(input())):
    lis.append(input())

for i in lis:
    for j in range(N+1):
        if i == j :
            point[j] += 1
        else:
            point[i] -= 1

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

Submission status: Runtime Error

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

for i in range(q):
      P[A[i]-1] +=1

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

Submission status: Runtime Error

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

P=[k-q for i in rage(n)]

for i in range(q):
      P[A[i]-1] +=1

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

import sys
from IPython import embed

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

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

wins = [0] * N
for i in A:
  wins[i - 1] = wins[i - 1] + 1

# sys.stdin = open('/dev/tty')
# embed()

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n, k, q = list(input())
alist = [int(input()) for i in range(n)]

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

Submission status: Runtime Error

Solution code:
N, K, Q = input().strip().split()
N, K, Q = [int(N), int(K), int(Q)]
A = [0] * (Q+1)  # index調整のため、長さQ+1のリストとする
for i in range(1, Q+1):
    A[i] = int(input())

# まず、全員が毎回負けた場合の点数は
points = [K - Q] * (N+1)

for i in range(1, Q+1) # 各ラウンドについて勝者に+1ポイント与える
    points[A[i]] += 1

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

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())

x = np.array(list(map(int,input().split())))

for i in range(N):
    print (np.argsort(x)[i]+1,"",end="")

Submission status: Runtime Error

Solution code:
# 入力
data = input().split()
 
# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])
 
# はじめの各プレイヤのポイント
playerPoint = []
 
for i in range(player):
  playerPoint.append(initPoint)
 
# 問題解答
for i in range(question):
  # 全員のポイントを-1
  playerPoint = [i-1 for i in playerPoint]
  # 正解者
  corrPlayer = int(input())
  # 正解者のポイントを+1(減らさない)
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  
# 解答
for i in range(player):
  if playerPoint(i) <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
# 入力
data = input().split()

# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])

# はじめの各プレイヤのポイント
playerPoint = []

for i in range(player):
  playerPoint.append(initPoint)

# 問題解答
for i in range(question):
  # 全員のポイントを-1
  playerPoint = [i-1 for i in playerPoint]
  # 正解者
  corrPlayer = int(input())
  # 正解者のポイントを+1(減らさない)
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  
# 解答
for i in range(player):
  if playerPoint(i) <= 0:
    print('No)
  else:
    print('Yes')

Submission status: Runtime Error

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

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

cntA = Counter(A)

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

Submission status: Runtime Error

Solution code:
N, K, Q = [int(e) for e in input().split()]
A = [0] * N

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

for index in range(N):
    if A[index] > Q - K:
        print("Yes")
    else:

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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


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

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

Submission status: Runtime Error

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

a=[]
nScore=[]
for x in range(Q):
    a.append(input())

for x in range(N):
    nScore.append(K)

for x in range(Q):
    ＃print("----Scores-----")
    
    for y in range(N)#
        if(y+1 !=int(a[x])):
            nScore[y]-=1
            #print("{}: {}".format(y,str(nScore[y])))
        else:
            #print("{}: {} Scored".format(y,str(nScore[y])))

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

Submission status: Runtime Error

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

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

for x in v:
  if x + k - q > 0:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
 
n, k, q =map(int, input().split())
a = [(int(input())-1) for i in range(q)]

p = [0]*n

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

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
 
n, k, q =map(int, input().split())
a = [int(input())-1 for i in range(q)]

p = [0]*n

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

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
 
n, k, q =map(int, input().split())
a = []
m = [k]*n
for i in range(q):
  a[i] = int(input())

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

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

Submission status: Runtime Error

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

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

m = list([k]*n)

for i in range(len(a)):
  for j in range(n):
    m[j]-=1
    m[i-1]+=1
  
for i in range(n):
  if m[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

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

m = list([k]*n)

for i in range(a):
  for j in range(n):
    m[j]-=1
    m[i-1]+=1
  
for i in range(n):
  if m[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

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

m = list([k]*n)

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a-1]=m[a-1]+1
  
for i in range(n):
  if m[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

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

m = list([k]*n)

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a-1]=m[a-1]+1
  
for i in range(n):
  if m[n]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

a =[]

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

m = [k]*n

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a-1]=m[a-1]+1
  
for i in range(n):
  if m[n]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

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

m = [k]*n

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a-1]=m[a-1]+1
  
for i in range(n):
  if m[n]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

m = [k]*n

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a-1]=m[a-1]+1
  
for i in range(n):
  if m[n]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

m = [k]*n

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a-1]=m[a-1]+1
  
for i in range(n):
  if m[n]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

m = [k]*n

for i in range(a):
  for j in range(n):
    m[j]=m[j]-1
    m[a]=m[a]+1
  
for i in range(n):
  if m[n]>0:
    print(Yes)
  else:
    print(No)

Submission status: Runtime Error

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

A = [0] * Q

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

point = [0] * N

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

for i in range(N):
	if point[i] > k:
		print("yes")
	else:
		print("no")

Submission status: Runtime Error

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

A = [0]*Q

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

point = [0]*N

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

for i in range(Q):
	if point[i] > 0:
		print("yes")
	else:
		print("no")

Submission status: Runtime Error

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

A = [0]*Q

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

point = [0]*N

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

for i in range(Q):
	if point[i] > 0:
		print("yes")
	else:
		print("no")