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 numpy as np
import collections

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

c = collections.Counter(A)
for i in range(1,N+1):
  if K+c[i]-Q>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

point =[0]*n

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


#print(point)

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

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(q):
  ans = int(input())
  point[ans-1] += 1
  
for i in range(n):
  if k + point[i] - q > 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)]
score = [k-q]*n
for i in range(q):
    temp = a[i]-1
    score[temp] =  score[temp] + 1
for i in range(n):
    if score[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:




def calculate(n,k,q,arr):
    result = [k]*n
    for index in range(q):
        result[arr[index] - 1] = result[arr[index] - 1] + 1

    for index in range(len(result)):
        if (result[index] - q) > 0:
            print("Yes")
        else:
            print("No")

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

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

calculate(N,K,Q,arr)

Submission status: Accepted

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

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

for s in range(N):
    if A[s] > Q - K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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 p in Point:
  if p>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

ans = [0] * N

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

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

Submission status: Accepted

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

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

A = [0] * N

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

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

Submission status: Accepted

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] += 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())
a=[k-q]*n
for i in range(q):
  o=int(input())
  a[o-1]+=1
  

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

Submission status: Accepted

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

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

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

ans = ['Yes' if points[i] > 0 else 'No' for i in range(N)]
print(*ans, sep='\n')

Submission status: Accepted

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(input()) for i in range(Q)]
    print_ans(N, K, Q, arr)

Submission status: Accepted

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-1] += j

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

Submission status: Accepted

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

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

#print(xs)  

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(n):
  data[i]  = data[i] - q

for i in range(n):
  if data[i] >= 1:
    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=[k-q]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

cnt = [0] * n

for i in ppl:
    cnt[i-1]+=1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

score = [K - Q] * N

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

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

Submission status: Accepted

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

pts = [k for _ in range(n)]
pts = [p - len(a_s) for p in pts]

for a in a_s:
	pts[a - 1] = pts[a - 1] + 1

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    s = input()
    if s == "Sunny":
        print("Cloudy")
    elif s == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")
    return


# B
def B():
    s = S()
    for i in range(len(s)):
        if i % 2:
            if s[i] not in ["L", "U", "D"]:
                print("No")
                return
        else:
            if s[i] not in ["R", "U", "D"]:
                print("No")
                return
    print("Yes")
    return


# C
def C():
    n, k, q = LI()
    a = IR(q)
    sc = [0] * n
    for i in a:
        sc[i - 1] += 1
    for i in sc:
        print("Yes" if i > q - k else "No")
    return


# D
def D():
    n, m = LI()
    a = LI()
    q = []
    for i in range(n):
        heappush(q, -a[i])
    for i in range(m):
        x = heappop(q)
        x *= -1
        x >>= 1
        heappush(q, -x)
    print(-sum(q))
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    C()
    return


# Solve
if __name__ == "__main__":
    C()

Submission status: Accepted

Solution code:
N,K,Q=input().split()
n=int(N) #参加人数
k=int(K) #初期点数
q=int(Q) #正解数

seikaisha=[]
#今後は人間のナンバーは0~で管理します。

for j in range(q):
  x=int(input())-1
  seikaisha.append(x)


score=[]

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

for j in range(q):
  #正解者に点数を足していく
  score[seikaisha[j]]+=1
  #seikaisha[j]はj番目のクイズの正解者の名前。そのナンバーに該当する人間のscoreに1を足していく

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

Submission status: Accepted

Solution code:
def main():
    N, K, Q = list(map(int, input().split()))
    S =[K-Q]*N
    A=[]
    for i in range(Q):
        A.append(int(input())-1)
    for i in A:
        S[i] = S[i]+1
    for i in range(N):
        if S[i]<1:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = []
p = [k-q]*n
for i in range(q):
    ai = int(input())
    a.append(ai)
    
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: Accepted

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

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


for i in ilst:
    if i > 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)]
b=[0]*n
for i in range(q):
  b[a[i]-1]+=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: Accepted

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

point= [k-q]*n
for aa in a:
    point[aa-1]+=1

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

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
ii0 = lambda: ii() - 1
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
def divs_gen(n):
    for i in range(1, int(m**.5)+1):
        if n%i == 0:
            yield i
            if i != n//i:
                yield n//i


def main():
    N,K,Q = mis()
    A = [0]*N
    for _ in range(Q):
        A[ii()-1] += 1
    S = sum(A)
    for i in range(N):
        if K - S + A[i] <= 0:
            print('No')
        else:
            print('Yes')

main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def judge(x: int):
    if x > 0:
        return True
    else:
        return False


if __name__ == "__main__":
    n, k, q = list(map(int, input().split(" ")))
    a = [int(input()) - 1 for i in range(q)]

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

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

    participant = list(map(judge, participant))

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = []
for i in range(q):
  a.append(int(input()) - 1)
  
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: Accepted

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

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

for i in a:
    nl[i] += 1

for i in range(n): 
    if nl[i] > 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)]
#print(n,A)
p = [k-q]*n
for i in range(q):
  p[A[i]-1] += 1 

for num in p:
  if num <= 0:
    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):
    a_in = int(input())
    a[a_in - 1] += 1

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a,b,c=map(int,input().split())
d=[b]*a
for i in[int(input())-1for _ in range(0,c)]:d[i]+=1
for i in d:print("Yes")if i-c>0 else print("No")

Submission status: Accepted

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 range(int(a[0])):
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

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

reps = [k - q] * n

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

for e in reps:
    if (0 < e):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

 
for i in range(correct):
    points[int(who_correct[i])-1] += 1
    
for i in range(people_num):
  if points[i] <= 0:
  	print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
def judge(x):
    if x < 1:
        print('No')
    else:
        print('Yes')

n,k,q = map(int,input().split())
#human_list = [k]*n
ok_list = [0]*n
for i in range(q):
    a = int(input())
    #human_list = list(map(lambda x: x-1,human_list))
    ok_list[a-1] += 1
    #print(human_list)
ok_list = list(map(lambda x: x+k-q,ok_list))
for i in range(n):
    judge(ok_list[i])

Submission status: Accepted

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

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

P = [-(Q - K)] * N

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

for p in P:
    if p > 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)
A = []
for i in range(Q):
    A.append(int(input()))
    
Ns=[0 for i in range(N)]

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

Submission status: Accepted

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 a:
  if K-Q+i>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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())
score = [K] * N

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

for i in range(N):
    if score[i]-Q > 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 i in range(n):
  if q - score[i] >= k:
    print('No')
  else:
    print('Yes')

Submission status: Accepted

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

score = {}
for i in range(1, N+1):
    score[i] = 0

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

# print(score)

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

Submission status: Accepted

Solution code:
a = input().strip().split(' ')
player = [int(a[1]) - int(a[2])] * int(a[0])
for i in range(int(a[2])):
    t = int(input())
    player[t - 1] += 1
for i in range(int(a[0])):
    if player[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N, K, Q = tuple(int(elem) for elem in input().split())
Ai = []
while True:
  try:
  	Ai.append(int(input()))
  except(EOFError):
    break
cand = [K-Q]*N

for elem in Ai:
  cand[elem-1] += 1

for point in cand:
  if point > 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)
t = 'No'
if k - q > 0:
    t = 'Yes'
res = [t] * n

p = [k - q] * n
for i in range(q):
    r = int(input()) - 1
    p[r] += 1
    if p[r] > 0:
        res[r] = 'Yes'
for i in res:
    print(i)

Submission status: Accepted

Solution code:
import math


def main():
    n,k,q = map(int, input().split())
    A = [int(input()) for _ in range(q)]

    score = [k-q]*n
    for i in range(q):
        score[A[i]-1] += 1
    for i in score:
        if i>0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for point in points:
    if point < 1:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

point =[]
for i in range(Input[0]):
    point.append(0)

for i in range(Input[2]):
    aa = int(input())
    point[aa-1] +=1
gouhi =[]
for i in range(Input[0]):
    bb = 0
    if Input[1]-Input[2]+point[i] > 0 :
        bb = "Yes"
    else:
        bb = "No"
    gouhi.append(bb)
print("\n".join(gouhi))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

member = [k] * n

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

for j in range(n):
    if member[j] - q <= 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)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for sc in score:
    pt = K -Q + sc
    if pt > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

points=[k-q]*n
for i in range(q):
  points[A[i]-1]+=1
for i in range(n):
  if points[i]>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    n, k, q = map(int, args[0].split())
    A = sorted(map(int, args[1:]))
    S = [k-q for _ in range(n)]
    ret = ''

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

    for s in S:
        ret += ('Yes' if 0 < s else 'No') + '\n'

    return ret.rstrip('\n')


if __name__ == "__main__":
    nkq = input()
    _, _, q = map(int, nkq.split())
    print(solve(*([nkq]+[input() for _ in range(q)])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split()) #Nは人の人数、Kはみなが最初に持っているポイント、Qはクイズの回数
L=[K-Q]*N #
for i in range(Q):
    m=int(input())-1
    L[m]+=1
for k in range(N):
    if L[k]>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)]

b = [k - q] * n

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

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

Submission status: Accepted

Solution code:
import numpy as np
n, k, q = map(int, input().split())
correct = []
orig = np.ones(n) * k - q
for i in range(q):
    tmp = int(input())
    orig[tmp-1] += 1
for i in orig:
    if i <=0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

for q in A:
    point[q-1]+=1
for i in list(map(lambda x: x - Q,point)):
    if 0 < i:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

for i in range(Q):
    anspeople = int(input()) -1 # pythonのindex特性
    everyone[anspeople] += 1
    
for i in range(N):
    if everyone[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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


for rounds in range(Q):
  temp = int(input())
  mem_point[temp-1] += 1 
  
for point in mem_point:
  if 0 < point:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

for i in range(n):
    if(point[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(0,q):
    point[int(input())-1] += 1 
for j in range(0,n):
    if point[j] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
list1=[]
n=n+1
ten=[k-q]*(n)

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

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

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

Submission status: Accepted

Solution code:
import numpy as np

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

for i in range(Q):
    success_num[int(input())-1] += 1
    
judge_score = success_num + K - Q
survive_list = []

for j in range(len(judge_score)):
    if judge_score[j] > 0:
        survive_list.append("Yes")
    else:
        survive_list.append("No")

for a in range(len(survive_list)):
    print(survive_list[a])

Submission status: Accepted

Solution code:
import numpy as np
nkq = list(map(int, input().split()))


n = nkq[0]
k = nkq[1]
q = nkq[2]
aes = []
for _ in range(q):
    aes.append(int(input()))
    


points = np.zeros(n)  + (k - q)
for a in aes:
    points[a-1] = points[a-1] + 1

for p in points:
    if 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)]
l = [K-Q] * N
for i in range(Q):
    l[A[i]-1] += 1
for i in range(N):
    if(l[i] >= 1):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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


for count in counts:
    if K > Q - count:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

scores = {}
for i in range(n):
    scores[i+1] = k-q
for elem in [int(input()) for i in range(q)]:
    scores[elem] += 1

for k,v in scores.items():
    if v > 0:
        print('Yes')
    else:
        print('No')