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())
lis = [0] * N

for i in range(Q):

    A = int(input())
    lis[A-1] += 1

for i in range(N):

    if lis[i] > Q-K:
        print ("Yes")
    else:
        print ("No")

Submission status: Accepted

Solution code:
import sys, math
def main():
    def input():
        return sys.stdin.readline()[:-1]
    N, K, Q = map(int,input().split())
    P = [0 for k in range(N)]
    for k in range(Q):
        a = int(input())
        P[a-1] += 1
    for e in P:
        if e > Q-K:
            print("Yes")
        else:
            print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

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

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意

#n = int(input())
n,k,q = [int(i) for i in readline().split()]
a = [int(readline())-1 for i in range(q)]


res = [k-q]*n



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


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

Submission status: Accepted

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


def main():
    n, k, q = (int(z) for z in input().split())
    scores = [k - q for _ in range(n)]
    for _ in range(q):
        a = int(input()) - 1
        scores[a] += 1
    ress = ["Yes" if score > 0 else "No" for score in scores]
    print(*ress, sep="\n")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

points = [0] * N
for a in A:
    points[a-1] += 1
    
border = Q-K
for p in points:
    if p > border:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from collections import defaultdict

def main():
    n,k,q = map(int,input().split())
    a = [int(input()) for _ in range(q)]
    dic = defaultdict(int)
    for i in range(q):
        dic[a[i]] += 1
    
    now = k-q

    for i in range(1,n+1):
        if now+dic[i]>0:
            print("Yes")
        else:
            print("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, random
mod = 1000000007
def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())
def input(): return sys.stdin.readline()
def print_array(a): print(" ".join(map(str, a)))
def main():
        n, k, q = get_ints()
        A = [k for _ in range(n)]
        for _ in range(q):
                A[int(input()) - 1] += 1
        for e in A:
                print("Yes" if e - q > 0 else "No")
if __name__ == "__main__":
        main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    import collections
    input = sys.stdin.readline
    n, k, q = list(map(int, input().rstrip('\n').split()))
    a = [int(input().rstrip('\n')) for _ in range(q)]
    ac = collections.Counter(a)
    l = [q] * n
    ll = [k] * n
    for k, v in ac.items():
        l[k-1] -= v
    for i in range(n):
        if ll[i] - l[i] <= 0:
            print("No")
        else:
            print("Yes")


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

s = [k-q for _ in range(n)]

for _ in range(q):
    a = int(input())-1
    s[a]+=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())
A = [int(input()) for x in range(q)]

C = [0]*n

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

for c in C:
    if 0 < k - q + c:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
def main():

    N, K, Q = map(int, input().split())
    d = dict()
    for _ in range(Q):
        a = int(input())
        d[a] = d.get(a, 0) + 1
    for i in range(1, N+1):
        if i in d:
            v = K-(Q-d[i])
        else:
            v = K - Q
        if v > 0:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

N,K,Q=  list(map(int,input().split(" ")))
mem = [K - Q] * (N + 1)
for _ in range(Q):
    m = int(input())
    mem[m] += 1

for i,p in enumerate(mem[1:]):
    if p <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n, k, q = li()
a = [ni() for _ in range(q)]

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

for pi in point:
    if pi > 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 i in range(n):
	if k-q+a[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())
As = [int(input()) for _ in range(Q)]

pts = [K-Q] * N
for A in As:
    pts[A-1] += 1

anss = []
for pt in pts:
    anss.append('Yes' if pt > 0 else 'No')

print('\n'.join(anss))

Submission status: Accepted

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

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


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

Submission status: Accepted

Solution code:
n,k,q,*a=map(int,open(0).read().split())
l=[k-q]*n
for i in a:
	l[i-1]+=1
for i in l:
	print("YNeos"[i<1::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n,k,q=map(int,input().split())
data=[k-q]*n
a=[int(input()) for i in range(q)]
for i in range(q):
    data[a[i]-1]+=1
for i in data:
    if i>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

cnt = [0 for x in range(n+1)]
for i in a_array:
    cnt[i] += 1

for ans in cnt[1:]:
    if k-(q-ans) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from collections import defaultdict
acs = defaultdict(int)

n, k, q = map(int, input().split())
for qq in range(q):
    a = int(input())
    acs[a] += 1
for a in range(1, n+1):
    score = k - (q - acs[a])
    if score <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
import sys
import collections
import copy
import math
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
N,K,Q =map(int,input().split())
A=[0]* N
for i in range(Q):
    A[int(input())-1] +=1
S = sum(A)
for i in range(N):
    if K-Q+A[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from bisect import bisect

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

A.sort()

for i in range(N):
    if bisect(A, i + 1) - bisect(A, i) > Q - K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

for i in range(q):
    val = int(input()) - 1
    a[val] += 1
for item in a:
    if item + k > q:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, k, q = map(int, input().split())
p = [0] * n
for _ in range(q):
    a = int(input()) - 1
    p[a] += 1
for i in range(n):
    ans = (p[i] + k - q > 0)
    print(['No', 'Yes'][ans])

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n,k,q = mi()
    alist = [0 for i in range(100005)]
    for i in range(q):
        a = ii()
        alist[a]+=1
    
    for i in range(1,n+1):
        if alist[i] > q-k:
            print('Yes')
        else:
            print('No')
    


main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
point = [0 for _ in range(n)]
for i in range(q):
    a = int(input())
    point[a - 1] += 1
# print(point)
for i in range(n):
    point[i] += k - q
    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)]

nes = Q-(K-1)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n1, n2, n3 = [int(i) for i in input().split()]

n4 = [0] * n1

for i1 in range(n3):
    n4[int(input()) - 1] += 1

for i2 in range(n1):
    if n2 - n3 + n4[i2] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque
import heapq
from functools import reduce
sys.setrecursionlimit(200000)
# local only
# if not __debug__:
#     fin = open('in_1.txt', 'r')
#     sys.stdin = fin
# local only
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
def lmfi(): return list(map(float, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()
# template


def main():
    N, K, Q = mi()
    A = [0] * N
    for i in range(Q):
        x = ii()
        A[x - 1] += 1
    # print(A)
    for i in range(N):
        if Q - A[i] < K:
            print('Yes')
        else:
            print('No')
    return


if __name__ == '__main__':
    if not __debug__:
        import doctest
        doctest.testmod()
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

from collections import Counter

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    n, k, q = rli()
    ca = Counter()
    for _ in range(q):
        a = ri()
        ca[a] += 1
    for a in range(1, n+1):
        if k + ca[a] - q > 0:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
n,k,q=map(int,input().split())
win=[0]*n
for i in range(q):
    a=int(input())
    win[a-1]+=1
for i in range(n):
    if k>q-win[i]:
        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 i > Q-K:
        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)]
ans = [0]*N
for i, value in enumerate(A):
    ans[value - 1] += 1

for element in ans:
    if K - (Q - element) > 0 :
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

score = [k-q for _ in range(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=map(int,input().split())
a=[q]*n
for i in range(q):
    x=int(input())
    a[x-1]-=1
for i in range(n):
    if a[i]<k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

win = [True] * N

from collections import defaultdict

cnt = defaultdict(int)

for a in a_list:
    cnt[a] += 1
#print(cnt)
for i in range(N):
    w = K - Q
    if (i + 1) in cnt:
        w += cnt[i + 1]
    # print(i+1, w)
    if w > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import pysnooper
#import os,re,sys,operator,math,heapq,string
#from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from copy import deepcopy

setrecursionlimit(10**6)
input=stdin.readline

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

Submission status: Accepted

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

def solve():
    N, K, Q = list(map(int, sys.stdin.readline().split()))
    ans = [0] * N
    for i in range(Q):
        a = int(sys.stdin.readline())
        ans[a-1] += 1

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import queue

"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)

def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math

n,k,q = getList()
life = [0 for i in range(n)]
aswer = []
for i in range(q):
    a = getN()
    life[a-1] += 1

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

Submission status: Accepted

Solution code:
import math
import heapq
from bisect import bisect_right, bisect_left
from collections import defaultdict, Counter
import itertools
import sys
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7
INF = float("inf")


def main():
    n, k, q = map(int, input().split())
    a = [int(input()) for i in range(q)]
    d = Counter(a)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str

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

    ans = collections.defaultdict(int)
    for a in A:
        ans[a] += 1

    for i in range(1,N+1):
        p = K - Q + ans[i]
        if p > 0:
            print(YES)
        else:
            print(NO)


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(Q) ]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

ans_list = [0]*N

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

S = sum(ans_list)

for i in range(N):
    if S-ans_list[i]>=K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

"""
・共通で1点失う
・1人に1点追加
"""

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

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

L = [0] * N

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

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    B = [0] * N
    for a in A:
        B[a-1] += 1
    for i in range(N):
        if B[i] <= (Q-K):
            print(NO)
        else:
            print(YES)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def getlist():
	return list(map(int, input().split()))

N, K, Q = getlist()

point = [(K - Q) for i in range(N)]
for i in range(Q):
	A = int(input())
	point[A - 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())
ok = [ 0 for i in range(n) ]
init= [ k for i in range(n) ]
for i in range(q):
    x = int(input())
    x -= 1
    ok[x] += 1

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

Submission status: Accepted

Solution code:
n,k,q = map(int,raw_input().split())
score = [k-q]*n
for i in xrange(q):
	j = int(raw_input())
	score[j-1] += 1
for x in score:
	if x>0:
		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)]

ans = [k - q] * n

for x in a:
    ans[x] += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

n,k,q = m()

po = [-1 * q for i in range(n)]

for i in range(q):
    aaa = onem()
    po[aaa-1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    from collections import Counter
    c = Counter(A)

    ans = 0
    for v in c.values():
        if(K-Q+v <= 0):
            ans += 1
    
    for i in range(1,N+1):
        if(not c[i]):
            if(K-Q > 0):
                print(YES)
            else:
                print(NO)
        else:
            if(K-Q+c[i] > 0):
                print(YES)
            else:
                print(NO)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

N, K, Q = list(map(int, sys.stdin.readline().split()))
A = [int(sys.stdin.readline()) for _ in range(Q)]

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

Submission status: Accepted

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


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

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