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:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

n,k,q = i2()
ls = [k-q]*n 
for _ in range(q):
	a = i()
	ls[a-1] += 1 

for _ in range(n):
	if ls[j] > 0:
		print("Yes")
	else:
		print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
import numpy as np
n,k,q=map(int,input().split())
a=[]
for i in range(q):
  a_=int(input())
  a.append(a_)


listn_=[]
for i in range(n):
  listn_.append(k)
listn=np.array(listn_)

s=Counter(a)
for i in s.keys():
  lists_=[-1*s[i]]*n
  lists_[i-1]=0
  lists=np.array(lists_)
  listn=listn+lists

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

Submission status: Runtime Error

Solution code:
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b,c=mi()
l=[0]*a
for i in range(c):
  j=ii()
  l[i-1]+=1
for k in l:
  if b+k-c>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

#特典初期設定
Score = [K for _ in range(N)]

for A in As:
    Score -= 1
    Score[A - 1] += 1

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

Submission status: Runtime Error

Solution code:
N,K,Q = map(int,input().split(" "))
ans=np.full(N, K)


ans = [K - Q for i in range(N)]


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

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

Submission status: Runtime Error

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

lis=[0]*n

for i in range(0,q):
  lis[int(input())]+=1
for p in lis:
  if k-q+p>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

def change_score(N ,A, score):
    score = score - np.array([1]*N)
    score[A-1] = score[A-1] + 1
    return score

for i in range(Q):
    A = int(input())
    score = change_score(N, A, score)
    #print(score)
    f_score = score

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

Submission status: Runtime Error

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

def change_score(N ,A, score):
    score = score - np.array([1]*N)
    score[A-1] = score[A-1] + 1
    return score

score = np.array([K]*N)
for i in range(Q):
    A = int(input())
    score = change_score(N, A, score)
    #print(score)
    f_score = score

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

Submission status: Runtime Error

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

def change_score(N ,A, score):
    score = score - np.array([1]*N)
    score[A-1] = score[A-1] + 1
    return score

score = np.array([K]*N)
for i in range(Q):
    A = int(input())
    score = change_score(N, A, score)
    print(score)
    f_score = score

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

Submission status: Runtime Error

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

points = [k] * n
for i in range(q):
    points = map(lambda x: x - 1, points)
    points[l[i] - 1] += 2
for i in points:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections
n,s,m = map(int, raw_input().split(' '))
cc = collections.Counter
cumul = 0
for _ in range(m):
	cc[int(raw_input()) - 1] += 1
	cumul += 1
for u in range(n):
	q = 0
	q += cc[u] - cumul
	if q > 0:
		print 'Yes'	
	else:
		print 'No'

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#ABC 141 C  Attack Survival
N,K,Q= map(int,input().split())
A=[K-Q]*N
for i in range(1,Q+1):
    A[int(input())]+=1
for a in A:
    if a < 1:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

for a in A:
    print('Yes' if (K - Q + a) > 0 else 'No')

Submission status: Runtime Error

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

for a in A:
    print('Yes' if (K - Q + A) > 0 else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

check = []

for _ in [0]*q:
  check[int(input())-1]+=1
  
for i in range(n):
  judge = k-(q-check[i])
  if judge<=0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(q):
    winner = a[i]
    points -= np.array([1]*n)
    points[a[i]] += 1

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

Submission status: Runtime Error

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

ans = np.zeros(N)
ans += K

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

ans -= Q

for a in ans:
    if a>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)]
B = np.array([K]*N)
C = B.count(0)
for i in A:
  B =  B - 1
  B[i-1] += 1
  if B.count(0) > C:
    print('Yes')
    C += 1
  else:
    print('No')

Submission status: Runtime Error

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

N,K,Q = inputIL()
A = inputILs(N)

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

Submission status: Runtime Error

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

for i range(q):
  tmp = A[i] - 1
  point[tmp] += 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 i in range(Q)]
A_point=[K]*N
#全体の試合数Q-
for a in A:
  A_point[a]-=1
for aa in A_point:
  if aa<=0:
    print("NO")
  else:
    print("Yes")

Submission status: Runtime Error

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

res = ["No"] * N
for i in range(Q):
  seikai = A.count(A[i])
  if K - Q + seikai > 0:
    res[i - 1] = "Yes"
  
for r in res:
  print(r)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K, q=map(int, input().split())
score=[0]*N

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import itertools
##print(ord("A"))
#n = int(input())
n,k,q = map(int,input().split())
#h = list(map(int,input().split()))	
ans_list=[input() for i in range(q)]
pnt_list = [k-q]*n
#print(pnt_list)
for i in range(q):

    pnt_list[int(ans_list[i])]+=1
#print(pnt_list)
for i in range(len(pnt_list)):
    if pnt_list[i]>0:
        print("Yes")
    else:
        print("No")
"""
for i in range(q):
    #print(pnt_list)
    for j in range(n):
    
        if ans_list[i]==str(j+1):
            pass
        else:
            pnt_list[j]=pnt_list[j]-1
for i in range(len(pnt_list)):
    if pnt_list[i]>0:
        print("Yes")
    else:
        print("No")
#print(pnt_list)
"""

Submission status: Runtime Error

Solution code:
N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
R = []
for i in range(N):
  p = K - Q + ANS[i]
  if p <= 0:
    R.append('No')
  else:
	R.append('Yes')
    
print('\n'.join(R))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

base = K - Q

u, counts = np.unique(A, return_counts=True)

for i in range(N): 
    if base > 0:
        print('Yes')
    else:
        n = i + 1
        if n in u:
            if base + counts[u == n] > 0:
                print('Yes')
            else:
                print('No')
        else:
            print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def ma():return map(int,input().split())
def nli(x):return [int(input()) for _ in range(x)]
def hukusuu():
  listA=[] #appendのために宣言が必要
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break #または、quit(),os.exit()をして止める。
  return listA

def ifif(s):
  if s:print("Yes")
  else:print("No")

n,k,q=ma()

b=[0]*q
for i in range(q):
  ai=int(input())-1
  b[ai]+=1 

for i in range(q):
  ifif(k-b[i]>0)

Submission status: Runtime Error

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

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N,K,Q=nm()
Al=[0]*N
for i in range(Q):
    Al[i]=ni()



for i in range(N):
    print('No' if (K-Q+Al.count(i+1)<1) else 'Yes')

Submission status: Runtime Error

Solution code:
n = int(input())
x = list(map(int, input().split()))
a = []
for i in range(min(x), max(x)+1):
    ans = 0
    for p in x:
        ans += (p - i) ** 2
    a.append(ans)
print(min(a))

Submission status: Runtime Error

Solution code:
def resolve():
    from collections import deque
    n, m = map(int, input().split())
    a = deque(map(int, input().split()))

    for i in range(m):
        a = deque(sorted(a))
        maxa = a.pop()
        maxa //= 2
        a.appendleft(maxa)
    print(sum(a))
resolve()

Submission status: Runtime Error

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

all_score = np.array([k for _ in range(n)])
for i in a:
    all_score -= 1
    all_score[i - 1] += 1

print(np.where(all_score > 0)[0].tolist()[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import deque
n,k,q = map(int, input().split())
start = [k-q]*n
points = deque(start)
for i in range(q):
    point = int(input())
    points[i-1] += 1
for _ in range(len(points)):
  x = points.popleft()
  if x <= 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)]
p=[k-q]*n
for i in range(q):
   #q回の正解が出る
    r=a[i]
    p[r]=p[r]+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(q)]
p=[k-q]*n
print(p)
for i in range(q):
   #q回の正解が出る
   r=a[i]
   print(a[i])
   p[r]=p[r]+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=[k-q]*n
for i in range(q):
    point=int(input())
    a[point-1] += 1
for i in range(len(l)):
    if l[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K,Q = map(int,input().split())
S=[int(input()) for i in range(Q)]
Point=[int(K-Q) for i in range(N)]
for x in range(Q):
    Point[S[x]]+=1

for x in range(N):
    if Point[x]<1:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import numpy as np
input=sys.stdin.readline
N,K,Q=map(int,input().split())
J=[int(input()) for _ in range(Q)]
for i in range(1,N+1):
    print("Yes" if K-Q+J.count(i)>0 else "No")

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
a=[]
while True:
  try:
    a.append(int(input()))
  except:
    break;
print(a)
t=[]*n
for i in a:
  t[i-1]+=1
for i in t:
  if i>=q-k+1:
    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[i]] += 1

      
for n in p:
  if n>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)]

if k - q > 0:
  res = ['Yes'] * n
else:
  res = ['No'] * n
  ans = [0] * n
  for i in range(len(a)):
    ans[a[i]-1] += 1
  for i in range(len(n)):
    if k - q + ans[i] > 0:
      res[i] = 'Yes'
print('\n'.join(map(str, res)))

Submission status: Runtime Error

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

if k - q > 0:
  res = ['Yes'] * n
else:
  res = ['No'] * n
  ans = [0] * n
  for i in range(len(a)):
    ans[a[i]-1] += 1
  for i in range(len(n)):
    if k - q + a[i] > 0:
      res[i] = 'Yes'
print('\n'.join(map(str, res)))

Submission status: Runtime Error

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

if k > q:
  res = ['Yes'] * n
else:
  res = ['No'] * n
  ans = set(a)
  for i in range(len(ans)):
    if k - q + a.count(ans[i]) > 0:
      res[ans[i]-1] = 'Yes'
print('\n'.join(map(str, res)))

Submission status: Runtime Error

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
A = np.array([int(input()) for i in range(Q)])
  
points = K - Q
for i in range(1, N+1):
  correct_num = len(np.where(A==i)[0])
  fin_point = points[i-1] + correct_num
  
  if fin_point > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

ans = '\n'.join('No'if x <=0 else 'Yes' for x in P[1:])
print(ans)

Submission status: Runtime Error

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

for i in a:
    print(point_list)
    point_list -= 1
    point_list[i-1] += 1

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

Submission status: Runtime Error

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

p_n = [k-q for i in range(n)]

for a_i in a_n:
    p_n[a_i] += 1

[print("Yes") if p_i > 0 else print("No") for p_i in p_n]

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# inp1 = input()
# n = int(inp1.split(" ")[0])
# k = int(inp1.split(" ")[1])
# q = int(inp1.split(" ")[2])

n,k,p = map(int, input().split())
each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

each_point = []
for i in range(n):
  each_point.append(k)


for j in range(q):
  ans = int(input())
  for m in range(n):
    int_point[m] -= 1
  int_point[ans-1] += 1

for x in range(n):
  if (int_point[x] < 1):
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for a_i in a:
    score[a_i] += 1

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

Submission status: Runtime Error

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

for a_i in a:
    score[a_i] += 1

for i in range(n):
    result = k - q + score[i]
    print("YES" if result > 0 else "NO")

Submission status: Runtime Error

Solution code:
import sys	

num1 = list(map(int, input().split()))
N = num1[0] #参加者数
K = num1[1] #初期ポイント
Q = num1[2] #出た正解の数
ans_list = []
for index1 in range(Q):
	ans_list.append(int(input()))
for index1 in range(1,N+1):
	point = 0
	for index2 in ans_list:
		if index1==ans_list[index2]:
			point +=1

	fin=K+point-Q
	
	if fin <=0:
		print("No")
	else:
		print("Yes")

Submission status: Runtime Error

Solution code:
import sys

def cal(x):
	point = 0
	for index2 in ans_list:
		if x==ans_list[index2]:
			point +=1
	score=K+point-Q
	return score	

num1 = list(map(int, input().split()))
N = num1[0] #参加者数
K = num1[1] #初期ポイント
Q = num1[2] #出た正解の数
ans_list = []
for index1 in range(Q):
	ans_list.append(int(input()))
for index1 in range(N):
	fin = cal(index1)
	if fin <=0:
		print("No")
	else:
		print("Yes")

Submission status: Runtime Error

Solution code:
import numpy as np

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

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

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
d=[]
e=[]
for i in range(c):
  d.append(int(input()))
for i in range(a):
  e.append(b-c)
for i in d:
  e[i+1]+-1
for i in e:
  if e<=0:
    print('No')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
import sys 

N, K, Q = map(int, sys.stdin.readline().split())
A = (int(i) for i in sys.stdin.read().split())

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for _ in range(Q):
    A = int(input())
    list_winner.append(A)
    list_point.append(K)
    
def add(n):
    return n-Q
    
list_point_new = []

for i in list_point:
    list_point_new.append(add(i))
    
for i in range(Q):
    a = list_winner[i]-1
    list_point_new[a] = list_point_new[a] + 1
    
for i in range(Q):
    if list_point_new[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

for i in s:
    if i[1] < 1:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#ABC141_C
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')

for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
#ABC141_C
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')
print(ans)
for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

#define REP(i,n) for (int i=0;i<(n);++i)

using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, K, Q;
    cin >> N >> K >> Q;
    vector<int> points(N, K - Q);
    REP(_, Q) {
        int A;
        cin >> A;
        --A;
        ++points[A];
    }
    REP(i, N) {
        cout << (points[i] > 0 ? "Yes" : "No") << '\n';
    }
    cout << flush;

    return 0;
}

Submission status: Runtime Error

Solution code:
N,K,Q=map(int, input().split())
A=[int(input()) for i in range(Q)]
from collections import Counter
A=Counter(A)
B=list(A.most_common())
B.sort(key=lambda x:x[0])
for i in range(N):
  if (Q - B[i][1])< K:
    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]*n
for i in range(q):
  point[a[i]]+=1
for i in range(n):
  if point[i]>-2*k+q:
    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]*n
for i in range(q):
  point[a[i]]+=1
for i in range(n):
  if point[i]>-2k+q:
    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]>-q:
    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')