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:
N, K, Q = map(int, input().split())
Ai = list(map(int, [input() for i in range(Q)]))
 
scores = [K-Q for i in range(N)]
 
for i in range(Q):
    scores[Ai[i] - 1] += 1
    scores = scores
 
for k in range(len(scores)):
    if scores[k] > 0 :
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

for i in range(Q):
    scores[Ai[i] - 1] += 1
    scores = scores


for k in range(len(scores)):
    if scores[k] > 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):
  score[A[i] - 1] += 1

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

Submission status: Accepted

Solution code:
N,K,Q = (int(x) for x in input().split())
#参加者全員分の残りポイントが入ったリスト[3,3,3,3,3,3]を作る
point = []
for i in range(N):
    point.append(K)
#N人のポイントをはじめに全員分-Qしておく
for i in range(N):
    point[i] -= Q
#正解者ごとに+1する
for i in range(Q):
    point[int(input())-1] += 1
#結果を出力
for i in range(N):
    if point[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
num, poi, ans = [int(x) for x in input().split()]

list01 = [poi for x in range(num)]
list02 = [0 for x in range(num)]

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

for i in range(num):
  list02[i] = list02[i] + list01[i] - ans

for k in list02:
  if k <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

b = [k for _ in range(n)]
list = [0 for _ in range(n)]

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

for i in list:
    if q -k < i:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

for Ai in alist:
    ans[Ai - 1] += 1

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

Submission status: Accepted

Solution code:
from collections import Counter

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

count = Counter(aa)

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

Submission status: Accepted

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

import sys
# from IPython import embed

args = sys.argv
if len(args) == 2:
  import IPython

def embed():
  if len(args) == 2:
    sys.stdin = open('/dev/tty')
    IPython.embed()


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

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

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

embed()

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

Submission status: Accepted

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

import sys
# from IPython import embed

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

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

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

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

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

Submission status: Accepted

Solution code:
def main():
    N, K, Q, *A = map(int, open(0).read().split())
    ans = [0] * N
    for a in A:
        ans[a - 1] += 1
    print("\n".join("Yes" if Q < K + a else "No" for a in ans))
    return


main()

Submission status: Accepted

Solution code:
def main():
    N, K, Q, *A = map(int, open(0).read().split())
    ans = [0] * N
    for a in A:
        ans[a - 1] += 1
    print("\n".join(["Yes" if Q < K + a
                     else "No" for a in ans]))
    return


main()

Submission status: Accepted

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

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

for i in range(N):
    if point[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)]
p = [0] * n

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

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

Submission status: Accepted

Solution code:
def count_num(num,dic):
    if num in dic.keys():
        dic[num] += 1
    else:
        dic[num] = 1
    return dic


# input
NKQ = input().split()
A = [int(input()) for i in range(int(NKQ[2]))]
dic = {}
for i in A:
    dic = count_num(i,dic)

X = int(NKQ[1])-int(NKQ[2])
for j in range(1,int(NKQ[0])+1):
    if j in dic.keys():
        a = dic[j]
    else:
        a = 0
    if X+a > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys
from functools import reduce
import copy
import math
from pprint import pprint


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(N, K, answers):
    min_point = K - len(answers)
    points = [min_point for i in range(N)]
    for a in answers:
        points[a-1] += 1
    return ['Yes' if p > 0 else 'No' for p in points]


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    [N, K, Q] = string_to_int(input())
    ret = solve(N, K, int_inputs(Q))
    for r in ret:
        print(r)

Submission status: Accepted

Solution code:
from collections import Counter


def main():
    N, K, Q, *A = map(int, open(0).read().split())
    A = Counter(A)
    print("\n".join(["Yes" if Q < K + A[i]
                     else "No" for i in range(1, N + 1)]))
    return


main()

Submission status: Accepted

Solution code:
from collections import Counter
from sys import stdin


def main():
    lines = stdin.readlines()
    N, K, Q = map(int, lines[0].split())
    A = Counter([int(i) - 1 for i in lines[1:]])
    print("\n".join(["Yes" if Q < K + A[i] else "No" for i in range(0, N)]))
    return


main()

Submission status: Accepted

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

Submission status: Accepted

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

wins = [0 for i in range(N)]
for q in range(Q):
  winner = int(input()) - 1
  wins[winner] += 1

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

Submission status: Accepted

Solution code:
def main():
    N, K, Q = map(int, input().split())
    lst_A = [int(input()) for _ in range(Q)]
    lst_miss = [K - Q] * N


    for A in lst_A:
        lst_miss[A - 1] += 1
    
    for miss in lst_miss:
        ans = "Yes" if miss > 0 else "No"
        print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
def main():
    N, K, Q = map(int, input().split())
    
    lst_miss = [Q] * N
    for _ in range(Q):
        A = int(input())
        lst_miss[A - 1] -= 1
    
    for miss in lst_miss:
        ans = "Yes" if miss < K else "No"
        print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
from collections import Counter

lines = stdin.readlines()

N, K, Q = map(int, lines[0].split())
ans = [0] * N
A = Counter([int(i) - 1 for i in lines[1:]])
for k in A.keys():
    ans[k] += A[k]
print("\n".join(["Yes" if Q < K + a
                 else "No" for a in ans]))

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
A = list(int(input()) for _ in range(q))
M = list(k-q for _ in range(n))

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

for m in M:
  if m > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
from sys import stdin
from collections import Counter

lines = stdin.readlines()

N, K, Q = map(int, lines[0].split())
ans = [0] * N
A = Counter((int(i) - 1 for i in lines[1:]))
for k in A.keys():
    ans[k] += A[k]
print("\n".join(("Yes" if Q < K + a
                 else "No" for a in ans)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = tuple(map(int, input().split()))
A = [int(input()) for _ in range(Q)]
points = [0] * N
for a in A:
    points[a-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 = n*[k]
for i in range(q):
    num = int(input())
    a[num-1] += 1
a = [k-q for k in a]
for i in range(n):
    if a[i] > 0:
        print ("Yes")
    else:
        print ("No")

Submission status: Accepted

Solution code:
# coding: utf-8

def reader(N):
    for n in range(N):
        yield input()

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

#print(pl)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import numpy as np
def receive_round_setting():
    round_settings = input()
    N, K, Q = round_settings.split(' ')
    N, K, Q = int(N), int(K), int(Q)
    participants = np.full(N, K, dtype='i')
    round_settings = {'N':N, 'K':K, 'Q':Q,
                    'participants':participants}
    return round_settings

def answer_question(round_settings):
    round_settings['participants'] -= 1*round_settings['Q']
    answerers = np.zeros(shape=round_settings['N'], dtype='i')
    for _ in range(round_settings['Q']):
        answerer = int(input()) - 1
        answerers[answerer] += 1
    round_settings['participants'] += answerers
    return round_settings
        
def announce_resutl(round_setting):

    [print('Yes') if participant > 0 else print('No')
    for participant in round_settings['participants']]

if __name__ == '__main__':
    round_settings = receive_round_setting()
    if round_settings['Q'] < round_settings['K']:
        announce_resutl(round_settings)
    else:
        round_settings = answer_question(round_settings)
        announce_resutl(round_settings)
    # round_settings = receive_round_setting()
    # round_settings = answer_question(round_settings)
    # announce_resutl(round_settings)

Submission status: Accepted

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

for i in range(n):
    pts[i] = pts[i] + ans[i] - q

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
INPUT = [int(i) for i in input().split(" ")]

N = INPUT[0]
K = INPUT[1]
Q = INPUT[2]
#print(INPUT)
A = []
for i in range(Q):
        A.append(int(input()))
#print(A)

P = [K]*N
#print(P)
for i in range(len(P)):
    P[i] = P[i] - Q

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

#print(P)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from __future__ import print_function
# import numpy as np
# import numpypy as np
import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq

def reduce(p, q):
    common = fractions.gcd(p, q)
    return (p//common , q//common )
# from itertools import accumulate
# from collections import deque

import random


def main():
    n, k, q = map(int, input().split())
    a = [0 for i in range(q)]
    
    for i in range(q):
        a[i] = int(input())
        a[i] = a[i] - 1         # participant number (index)

    # eprint("########")
    # eprint("num of participant %d men, first points all participants have %d points, collect answers %d quiz," % (n,k,q))
    # eprint("list of participants:")
    # for i in range(n):
    #     eprint("\tparticipant No.%d : p%d" % (i,i))
        
    # for i in range(q):
    #     eprint("the %d who answered collectly is participant No.%d (p%d) " % (i, a[i] ,a[i]) )
    # eprint("########")

    # output if the player _ i won or not.
    # each player wins if he has one point or above when every round ends.
    # there are q collect answers.
    # in the turn i, a_i won.
    # 

    index_p = 0 # the index of each player. # index_p is from 0 to n (0_n)

    b = [0 for index_participant in range(n)]
    for index_q in range(q):          # Q is the num of the quiz
       b[ a[index_q] ]+= 1
    for index_participant in range(n):          # N is the num of the participants
        b[index_participant] += -q + k
        if b[index_participant] > 0:
            print("Yes")
        else:
            print("No")
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力の取得(1行目。数値)
i = list(map(int, input().split()))

# 変数セット
# 1.配列[値=初期の点数-★正解数(解説より)★、個数=人数]
points = [i[1]- i[2]] * (i[0] )
# 2.正解数(引数の数)
correntCount = i[2]

# 正解数ループ
for i in range(correntCount):
    correcter = int(input()) - 1    
    #正解者に1加算
    points[correcter] += 1

# 値が0以下の参加者は敗退(No)、1以上なら勝ち抜け(Yes)
for point in points:
    if point <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

win = [0 for i in range(n)]
for ai in a:
    win[ai-1] += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from collections import deque, defaultdict, Counter

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

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

cntA = Counter(A)

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

Submission status: Accepted

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

points = [K-Q] * N

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

Submission status: Accepted

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

Submission status: Accepted

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

score = [0] * N

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

for x in range(N):
	if score[x] > Q - K:
		print("Yes")
	else:
		print("No")

Submission status: Accepted

Solution code:
import collections

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

if K > Q:
    for n in range(N):
        print("Yes")
else:
    A = [K] * N
    answer_list = []

    for q in range(Q):
        answer_list.append(int(input()))

    answer_list_counts = collections.Counter(answer_list)

    is_clear = [False] * N
    for key in answer_list_counts:
        if K > Q - answer_list_counts[key]:
            is_clear[key - 1] = True


    for n in range(N):
        if is_clear[n]:
            print("Yes")
        else:
            print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

players = dict()

for i in range(N):
    players[i + 1] = 0

for _ in range(Q):
    winner = int(input())
    players[winner] += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq

# decimal.getcontext().prec = 50
# sys.setrecursionlimit(10000)
# MOD = 10**9 + 7

def solve(f):
    n, k, q = f.read_int_list()
    a = [f.read_int() for _ in xrange(q)]
    p = [k] * n

    for i in xrange(q):
        p[a[i]-1] += 1

    ans = []
    for i in xrange(n):
        ans.append("Yes") if p[i] > q else ans.append("No")

    return "\n".join(ans)


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case #%d\n"%f.case, solve(f)
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict
n, k, q = map(int, input().split())
d = defaultdict(int)
for i in range(q):
    tmp = int(input())
    d[tmp] += 1

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

Submission status: Accepted

Solution code:
N, K, Q = [int(x) for x in input().split(' ')]
points = [0 for x in range(N)]
 
for q in range(Q):
  index = int(input())-1
  points[index] += 1
 
for n in range(N):
  print('Yes' if (Q-points[n]) < K else 'No')

Submission status: Accepted

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

import numpy as np

Nwin = np.zeros(N)

#print(Nwin)

A = []

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

#print(Nwin)

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

Submission status: Accepted

Solution code:
#atcoder beginner contest 141

participant, point, correct = map(int, input("").split(" "))
indi_point = []

for i in range(participant):
    indi_point.append(0)

for i in range(correct):
    s_per = int(input(""))
    indi_point[s_per - 1] += 1

for i in range(participant):
    if point > correct - indi_point[i]:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = [int(x) for x in input().split(' ')]
points = [0 for x in range(N)]

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

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

Submission status: Accepted

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

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

for a in answer_count:
    if K - (Q - a) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    d = {"Sunny":1 , "Cloudy":2, "Rainy":0}
    a = ["Sunny", "Cloudy", "Rainy"]
    print(a[d[input()]])
    return

#B
def B():
    s = S()
    for i, si in enumerate(s):
        if i % 2:
            if si == "R":
                print("No")
                return
        else:
            if si == "L":
                print("No")
                return
    print("Yes")
    return

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

#D
def D():
    n, = LI()
    a = LI()
    q = []
    for ai in a:
        heappush(q, ai)
    for _ in range(m):
        heappush(q, heappop(q) / 2)
    ans = 0
    while q:
        ans += int(heappop(q))
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

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

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
#p_3,p_4=map(int,input().split())
#n=int(input())
#a=int(input())
#b=int(input())
#s=list(input())
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
#b=list(map(int,input().split()))
#b=list(map(int,input().split()))
#c=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
a=[int(input()) for _ in range(q)]
score=[-q for _ in range(n)]
for i in range(q):
    score[a[i]-1]+=1
for i in range(n):
    tmp=score[i]+k
    if tmp<=0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

for i in range(N):
    if human_win[i] > win:
        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)]
Point_list = [K-Q for i in range(N)]

for j in range(Q):
    Point_list[A_list[j]-1] += 1

for j in range(N):
    if Point_list[j] <= 0:
        print("No")

    else:
        print("Yes")

Submission status: Accepted

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


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

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
dp=[0]*a
l =[]
def Y(a,t = 0):
    if a==t : print('YES')
    else : print('NO')
def y(a, t =0):
    if a>t : print('Yes')
    else : print('No')
for i in range(c):
    d = int(input())
    dp[d-1]+=1
for i in dp:
    l.append(i+b-c)
    y(i+b-c)
# print(l)

Submission status: Accepted

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



a=[]
nScore=[]

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

for x in range(Q):
    nScore[int(input())-1]+=1

# if(K>Q):
#     for x in range(N):
#         print("Yes")

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

Submission status: Accepted

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