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:
"""
 SpeedForces
 Ah shit here we go again

"""

from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def solve():
    n,k,q = vv()
    lazy = [0]*(n+1)
    for i in range(q):
        a = int(input())
        lazy[a]+=1
    for i in range(1,n+1):
        if(k+lazy[i]-q > 0):
            pr("Yes")
        else:
            pr("No")




    return
















def main():
    # for _ in range(int(input())):
        solve()

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
pr = print
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")
ll = lambda : list(map(int,input().split()))
vv = lambda :map(int,input().split())
# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

n,k,q,*a = map(int,open(0).read().split())

c = Counter(a)
# print(c)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

for i in range(N):
    if Q - L[i] < K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

points = list(map(lambda x:x-Q,points))

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

for i in points:
    if(i > 0):
        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()))
ans = [k-q for x in range(n)]

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

Submission status: Accepted

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

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

arr = [0] * n
for i in range(q):
    arr[a[i]-1] += 1

count = 0
for i in range(n):
    score = k - q + arr[i]
    if score > 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)]
li=[k-q for i in range(n)]
for i in range(q):
    li[A[i]-1]=li[A[i]-1]+1
for i in range(n):
    if li[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import math 
import bisect
from collections import deque
n,k,q = map(int, input().split())
a = [0]*q
for i in range(q):
    a[i] = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

scores = [K - Q for _ in range(N)]

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(n):
    if k -q + tmp[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)]

all_score = [k - q for _ in range(n)]
for ai in a:
    all_score[ai - 1] += 1
for j in all_score:
    if j > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

nn = np.zeros(n)
kk = np.zeros(n) + k
qq = np.zeros(n) + q

for i in a:
    nn[i-1] += 1

_list = (kk-qq+nn).tolist()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

List = [K-Q]*N

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

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

Submission status: Accepted

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

anser = {}
for i in range(q):
    a = int(input())-1
    if not a in anser.keys():
        anser[a] = 1
    else:
        anser[a] += 1
for i in range(n):
    if not i in anser.keys():
        if k-q>0:
            print('Yes')
        else:
            print('No')
    else:
        if k-q+anser[i]>0:
            print('Yes')
        else:
            print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

log = {}

for i in range(q):
    answer = int(input().rstrip()) - 1
    if answer not in log:
        log[answer] = []
    log[answer].append(i)

ans = []
for i in range(n):
    score = k
    if i in log:
        prev = 0
        for j in log[i]:
            score -= (j - prev)
            prev = j + 1
            if score <= 0:
                break
        score -= q - prev
    else:
        score -= q
    if score > 0:
        ans.append("Yes")
    else:
        ans.append("No")

for i in ans:
    print(i)

Submission status: Accepted

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]-1
    p[r]=p[r]+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())
a = [input() for _ in range(q)]
b = [k for i in range(n)]
import numpy as np
np_b = np.array(b)
np_b -= q
np_backed_b = np_b.tolist()
for i in range(q):
  np_backed_b[int(a[i])-1] +=1
for i in range(n):
  if np_backed_b[i]<=0:
    print('No')
  else:
    print('Yes')

Submission status: Accepted

Solution code:
num, point, ques = list(map(int, input().split(" ")))
ans_list = []
point_list = []

for i in range(num):
    point_list.append(point)

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

for i in range(num):
    if(point_list[i]-ques<=0):
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

p=[0]*(n+1)
for i in a:
    p[i]+=1

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

Submission status: Accepted

Solution code:
from sys import stdin

n, k, q = [int(x) for x in stdin.readline().rstrip().split()]

points = [0 for _ in range(n)]

a = [int(x) for x in stdin.readlines()]

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

for i in points:
    if i <= q - k:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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


a = [int(input())-1 for _ in range(q)]
c = collections.Counter(a)

for i in range(n):
   if k - (q - c[i]) > 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 _ in range(Q)]

from collections import Counter
Answer = Counter(A)

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

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(q):
    a = int(input())
    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())
llist = [int(input()) for i in range(q)]

point_list = [k - q]*n

for i in range(0,q):
    point_list[llist[i]-1] += 1

ans_list = ['']*n

for i in range(0,n):
    if point_list[i] >= 1:
        ans_list[i] = 'Yes'
    else:
        ans_list[i] = 'No'

for List in ans_list:
    print(List)

Submission status: Accepted

Solution code:

n, k, q = map(int, input().split())
score = [k] * n
data = [0] * n

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for p in Point:
    if p>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)]
p = [k for i in range(n)]
c = [0 for i in range(n)]

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

Submission status: Accepted

Solution code:
import sys

# S = input()
# N, M = map(int, input().split())
# As = [int(input()) for _ in range(N)]
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]


def main():

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

    As = [int(input())-1 for _ in range(Q)]

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

    for a in As:
        points[a] += 1

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

# 正解数でリストを作る
count_ans = [0 for _ in range(n)]
for i in range(q):
    count_ans[A[i]-1] += 1

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

Submission status: Accepted

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


def main():
    N, K, Q = map(int, input().split())
    result = np.array([K - Q] * N)
    for _ in range(Q):
        a = int(input())
        result[a - 1] += 1

    for r in result:
        print('Yes'if r > 0 else 'No')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

num = list(map(int,input().split()))
num_list = np.ones(num[0])*(num[1] - num[2])
reward = []

for i in range(0,num[2]):
  reward.append(int(input()))

for i in range(0,num[2]):
  num_list[reward[-i-1] - 1] = num_list[reward[-i-1] - 1] + 1
 
    
for i in range(0,num[0]):
  if num_list[i]>0:
    print("Yes")
  elif num_list[i] <=0:
    print("No")

Submission status: Accepted

Solution code:

N, K, Q = map(int, input().split())
A = [int(input()) for q in range(Q)]

acc = [0]*N
for a in A:
    acc[a-1] += 1

for corr_num in acc:
    if K - (Q - corr_num) <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]

if k > q: ans = ["Yes"] * n
else: ans = ["No"] * n

for key,val in Counter(a).items():
    if val + k - q > 0:
        ans[key-1] = "Yes"

[print(i) for i in ans];

Submission status: Accepted

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

Submission status: Accepted

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

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

points =[k- q] * n

for win in wins:
    points[win-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_dict = {}
for i in range(n):
    a_dict[i+1] = 0
for _ in range(q):
    a = int(input())
    a_dict[a] += 1
ls = sorted(a_dict.items(), key=lambda x: x[0])
for item in ls:
    if item[1] > q - k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    n, k, q = list(map(int,input().split()))
    t = q - k + 1
    p = [0] * n

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = map(int,input().split())
a = []
for i in range(q):
    b = int(input())
    a.append(b)
pnt = [0] * n
for x in a:
    pnt[x-1] += 1
for j in range(n):
    if pnt[j] > 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)]

a=[K-Q]*N

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


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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    n, k, q = map(int, input().split())
    a = []
    for i in range(q):
        a.append(int(input()))
    acs = [0 for j in range(n)]
    for j in a:
        acs[j - 1] += 1
    for x in acs:
        print("Yes" if k - q + x > 0 else "No")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

for a in A:
  if a > q-k:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = list(map(int, input().split()))
A = [0]*N
for i in range(Q):
    num = int(input())
    A[num-1] += 1
# n番目の人の正解数がA[n-1]に入る
for i in range(N):
    if K > Q-A[i]:
        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):
    a=int(input())
    l[a-1] += 1

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys
from collections import Counter

n, k, q = map(int, sys.stdin.readline().split())
a = map(int, sys.stdin.read().split())
counter = Counter(a)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

for i in P:
    print("Yes" if i > Q-K else "No")

Submission status: Accepted

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

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

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

for i in scores:
    if i+k > q:
        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):
  a = int(input())
  p[a-1] += 1

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

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

[print("Yes" if a > 0 else "No") for a in A ]

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

import numpy

def main():
  n, k, q = map(int, input().strip().split())
  scores = numpy.zeros(n)
  for A in  [int(input()) for _ in range(q)]:
    scores[A-1] += 1
  for score in scores:
    if k - (q - score) > 0:
      print('Yes')
    else:
      print('No')

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter

N, K, Q = list(map(int, input().split()))
c = Counter([int(input()) for _ in range(Q)])
[print('Yes' if K + c[i+1] - Q > 0 else 'No') for i in range(N)]

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#python3
from collections import Counter
def main():
    n,k,q = map(int, input().split())
    a = Counter([int(input())-1 for _ in range(q)])
    p = [k-q for _ in range(n)]

    for i,j in a.items():
        p[i] += j

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

Submission status: Accepted

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

points = [0]*N

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

Submission status: Accepted

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

ans=0

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())
Participants = np.array([K] * (N + 1)) - Q

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

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