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: Accepted

Solution code:
import sys
from collections import defaultdict
from heapq import *
sys.setrecursionlimit(200000)
input = sys.stdin.readline

N, M, Q, = map(int, input().split())
# L = [int(v) * -1 for v in input().split()]
L = [int(input()) for _ in range(Q)]

c = [0] * (N + 1)
for v in L:
    c[0] -= 1
    c[v - 1] += 1
    c[v] -= 1
    c[N] -= 1

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

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

Submission status: Accepted

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

ans = [0 for xi in range(N)]
l = []
for yi in range(Q):
    Ain = input()
    Ain = int(Ain)
    ans[Ain-1] = ans[Ain-1]+1

for yi in range(N):
    if Q-K<ans[yi]:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

scores = [0 for i in range(n)]

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

for s in scores:
    if q - s >= k:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
a=[]
p=[0]*(N+1)
for i in range(Q):
    a.append(int(input()))

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


for j in range(1,N+1):
    if K-(Q-p[j])>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

score = [scoreMax-ansCnt]*sankaNum

for _ in range(ansCnt):
    score[int(input()) - 1] +=  1

for m in range(sankaNum):

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

sn = lambda : stdin.readline().rstrip()
an = lambda : map(int, stdin.readline().split())
ni = lambda : int(sn())
def main():
  n, k, q = an()
  a = [ni() for _ in range(q)]

  point = [k] * n

  for aa in a:
    point[aa-1] += 1

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

Submission status: Accepted

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

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

for i in range(n):
    if q-ans[i]<k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

scores = [k-q]*n
for a in A:
    scores[a-1] += 1

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

Submission status: Accepted

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

ans = []
for i in l:
    if k- q + i > 0:
        ans += list("Yes\n")
    else:
        ans += list("No\n")
print("".join(ans))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

list_A = []

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

list_per = [0]*n

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

for i in list_per:
    if k - q + i > 0:
        print("Yes")

    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
t=[int(input()) for i in range(s[2])]
a=s[1]-s[2]
list=[]
for i in range(s[0]):
  list.append(a)
for j in range(s[2]):
  list[t[j]-1]=list[t[j]-1]+1
for l in range(s[0]):
  if list[l]>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

for score in scores:

    if (K-Q+score)>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
ans = ['No'] * N
s_array = [K] * N
c_array = [0] * N

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

sum_array = sum(c_array)

for i in range(N):
    calc = s_array[i] + c_array[i] - sum_array
    if calc > 0:
        ans[i] = 'Yes'

print(*ans, sep='\n')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

a=np.zeros(n)

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

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

Submission status: Accepted

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

ans = []
for i in l:
    if k- q + i > 0:
        ans.append("Yes")
    else:
        ans.append("No")
print("\n".join(ans))

Submission status: Accepted

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

point = [K]*N
A = [0]*Q

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

for p in point:
    p -= Q
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

for ans in p:
  print('Yes' if ans>=1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in answer:
  value = K - Q + i
  if value > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(q):
  score[int(input())-1] += 1
  
for i in score:
  if i <= q - k:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

hist = [0]*N
for _ in range(Q):
  A = int(input())
  hist[A-1] += 1

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

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

N, K, Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
P = [K for _ in range(N)]
W = [0 for _ in range(N)]

for num1 in A:
    W[num1 - 1] += 1

for i, num2 in enumerate(W):
    P[i] += num2 - Q

for fin in P:
    if fin > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

for i in range(0, Q):
    P[A[i]] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for j in score:
  print('Yes' if Q-j < K else 'No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
p=[k-q]*n
for _ in range(q):
  p[int(input())-1]+=1
a=["YNeos"[x<1::2] for x in p]
for i in a:
  print(i)

Submission status: Accepted

Solution code:
N,K,Q= [int(s) for s in input().split()]

temp=[0]*N

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


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

Submission status: Accepted

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

temp=[0]*N

for i in A:
  temp[i-1]=temp[i-1]+1
ans=[K - (Q- d) for d in temp]

#ans = list(map(lambda x: K-(Q-x), temp))

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

Submission status: Accepted

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

temp=[0]*N

for i in A:
  temp[i-1]=temp[i-1]+1

ans = list(map(lambda x: K-(Q-x), temp))

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

Submission status: Accepted

Solution code:
n,k,q=map(int, input().split())
a=[int(input()) for i in range(q)]
start_score=[k for i in range(n)]
def cal_score(n):
    return n-q
end_score=list(map(cal_score, start_score))
for i in a:
    end_score[i-1]+=1
#print(end_score)
for j in end_score:
    if j<=0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(0,T):
    c=input()
    point[int(c)-1]+=1
point=[P-T+d for d in point]
for i in range(0,N):
    if(point[i]>0):
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
while True:
	try:
		N, K, Q = map(int, input().split())
		P = [K for i in range(N)]
		dic = {i: K for i in range(1, N+1)}
		for i in range(Q):
			q = int(input())
			dic[q] += 1
			#print(dic)
		for k, v in dic.items():
			if (v-Q > 0):
				print("Yes")
			else:
				print("No")
	except:
		break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(q):
    temp = int(input())
    subarray[temp-1] -= 1

for i in range(n):
    if k - subarray[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

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

for j in point:
    if j <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
list_1 = []
for i in range(c):
    i = int(input())
    list_1.append(i)
list_2 = [b for i in range(a)]
list_3 = list(map(lambda x:x-c, list_2))
for i in range(c):
    list_3[list_1[i]-1] += 1
for i in list_3:
    if i >0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

def attackSurvival(n, k, q, a):
    ans = []
    import collections
    c = collections.Counter(a)
    for i in range(n):
        if c[i+1] > q - k: ans.append('Yes')
        else: ans.append('No')
    return ans

def main():
    n, k, q = map(int, input().split())
    a = []
    for _ in range(q):
        a.append(int(input()))
    for ans in attackSurvival(n, k, q, a): print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ptsList = [K-Q]*N

if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > 0:
            print("Yes")
        else:
            print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

L = [K-Q] * N

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

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

Submission status: Accepted

Solution code:
inp = list(map(int,input().split()))
question = [int(input()) for i in range(inp[2])]
point = []
sinshutu = []
for i in range(inp[0]):
    point.append(inp[1])
    sinshutu.append('No')

for i in range(inp[2]):
    point[question[i]-1] = point[question[i]-1]+1

point = list(map(lambda x:x-inp[2], point))

for i in range(inp[0]):
    if point[i] > 0:
        sinshutu[i] = 'Yes'
    print(sinshutu[i])

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#abc141c

n,k,q=map(int,raw_input().split())
a=[k-q]*n
for i in xrange(q):
 a[int(raw_input())-1]+=1
for i in xrange(n):
 if a[i]>0:
  print 'Yes'
 else:
  print 'No'

Submission status: Accepted

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

import sys
import copy
import math

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~

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

a = [K - Q] * N

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


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

Submission status: Accepted

Solution code:
import numpy as np

n,k,q = map(int,input().split())
d = [int(input()) for i in range(q)]
 
p=np.full(n,k)
z=np.full(n,-1*q)

p=p+z

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 2019/09/16
# 解説のやつ
import sys
input=sys.stdin.readline

n,k,q=map(int,input().split())
res=[k-q]*n

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

for e in res:
    print('Yes' if e>0 else 'No')

Submission status: Accepted

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

def main():
    N,K,Q = map(int,input().split())
    A = [int(input()) for _ in range(Q)]
    num_a = [K-Q for _ in range(N)]
    for i in range(Q):
        num_a[A[i]-1] += 1

    for i in num_a:
        if i >= 1 :
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,k,q=[int(i) for i in input().split()]
ini = [k]*(n)
pre=[0]*(n+2)
for i in range(q):
    a=int(input())
    pre[1]+=1
    pre[a]-=1
    pre[a+1]+=1
    pre[n+1]-=1
    #print(*pre)
for i in range(1,n+2):
    pre[i]+=pre[i-1]
for i in range(len(ini)):
    ini[i]-=pre[i+1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split(" "))    # N:人数, K:初期スコア, Q:問題数
A = [int(input()) for i in range(Q)]    # 正解者のリスト
B = [0 for i in range(N)]    # 正解数

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

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

Submission status: Accepted

Solution code:
# ABC141C - Attack Survival  (w/o Counter)
def main():
    N, K, Q, *A = map(int, open(0).read().split())
    ans, C = [], [0] * (N + 1)
    for i in A:
        C[i] += 1
    for i in C[1:]:
        x = "Yes" if K - Q + i > 0 else "No"
        ans.append(x)
    print("\n".join(ans))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

answer = [0] * n

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

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

Submission status: Accepted

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


def solve(N: int, K: int, Q: int, A: "List[int]"):

    arr = [K - Q] * N

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

    for go_or_not in arr:
        if go_or_not > 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: Accepted

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

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

Submission status: Accepted

Solution code:
# C - Attack Survival
N, K, Q = map(int, input().split())
A = [0] * N
for _ in range(Q):
    tmp = int(input())
    A[tmp - 1] += 1

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

Submission status: Accepted

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

from collections import Counter

counter = Counter(a_list)

if K>Q:
    # これで終えても良い
    base = 1
else:
    base = 0
winners = [base for _ in range(N+1)]
for i,cnt in counter.items():
    if K-Q+cnt > 0:
        winners[i] = 1

for win in winners[1:]:
    if win==1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np


N, K, Q = [int(i) for i in input().split()]
l = np.zeros(N)

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

s = ''
for i in range(N):
    if l[i] > x:
        s += 'Yes\n'
    else:
        s += 'No\n'

print(s.strip())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
from collections import defaultdict
N,K,Q = [int(x) for x in stdin.readline().rstrip().split()]
cntdic = defaultdict()
for i in range(1,N+1):
    cntdic[i] = 0
for _ in range(Q):
    q = int(input())
    cntdic[q] += 1

for j in cntdic.values():
    if (K - Q + j) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

cnt = [0 for _ in range(N)]

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

for c in cnt:
    if Q - c < K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

point_list = [0 for i in range(N)]

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

for i in point_list:
  if 0 < K - Q + i:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)

Submission status: Accepted

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

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

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

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