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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,Q=map(int, input().split())
Ns=[0]*N
def yes_or_no(value):
  if K-(Q-value) <= 0:
    return "No"
  else:
    return "Yes"

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

for i in Ns:
  print(yes_or_no(i))

Submission status: Accepted

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

a = list(int(input()) for i in range(q))
s = list([k] * n)
n_list = []

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

for i in s:
  if(i - q > 0):
    n_list.append('Yes')
  else:
    n_list.append('No')


for i in n_list:
  print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

# print(a)

score=[0]*n
for i in a:
    score[i-1]+=1
# print(score)

for j in range(len(score)):
    if int(score[j])>=q-k+1:
        score[j]='Yes'
    else:
        score[j]='No'

L=[str(a) for a in score]
L="\n".join(L)
print(L)

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit

getarr = lambda _f: list(map(_f, input().split()))

n, k, q = getarr(int)
r = [k - q for _ in range(n)]
for _ in range(q):
    p = int(input()) - 1
    r[p] += 1
print(*[('Yes' if s > 0 else 'No') for s in r], sep="\n")

Submission status: Accepted

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

check = [0]*n

for _ in [0]*q:
  check[int(input())-1]+=1
  
for i in range(n):
  judge = k-(q-check[i])
  if judge<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(q):
    correct_ans[aq[i] - 1] += 1
    
point = ['Yes'  if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]
print(*point, sep='\n')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


n, k, q = Is()
A = [I()-1 for _ in range(q)]
score = [k-q]*n

for a in A:
    score[a] += 1

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

Submission status: Accepted

Solution code:
from collections import defaultdict


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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


def solve(n, k, q, a):
    score = [k - q for _ in range(n)]
    for i in range(q):
        score[a[i] - 1] += 1
    return score


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = np.zeros(N)
ans += K

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

ans -= Q

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

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

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

Submission status: Accepted

Solution code:
# C - Attack Survival

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

for p in P:
    if 0 < K - Q + p:
        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 _ in range(Q)]
c = dict(Counter(A))
for i in range(1,N+1):
    if i in c:
        t = Q - c[i]
        print('Yes' if t < K else 'No')
    else:
        print('Yes' if Q < K else 'No')

Submission status: Accepted

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

cin =[0]*n
ans=[0]*n
cnt =0

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

cnt = max(cin)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
def LILI(n): return [LI() for _ in range(n)]
INF = 10 ** 18
MOD = 10 ** 9 + 7

def main_1(): 
    text = (['Sunny', 'Cloudy'], ['Cloudy', 'Rainy'],['Rainy','Sunny'])
    s = SI()
    for i in text:
        if s == i[0]:
            print(i[1])

def main_2(): 
    s = SI()
    for num, i in enumerate(s):
        if num % 2 == 1: # even
            if not (i in 'LUD'):
                print('No')
                return
        else:
            if not (i in 'RUD'):
                print('No')
                return
    print('Yes')

def main():
    N, K, Q = LI()
    A = [0] * (N+1)
    for _ in range(Q):
        n = II()
        A[n] += 1

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

main()

Submission status: Accepted

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

d = {}

for _ in range(q):
  a = int(input())
  d[a-1] = d.get(a-1, 0) + 1

scores = [k-q for _ in range(n)]
for key in d:
  scores[key] += d[key]

for s in scores:
  if s > 0:
    print("Yes")
  else:
    print("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 j in range(0,n):
  if k-q+lis[j]>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

s = sum(A)

for a in A:
    if K - (s - a) > 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):
  k = int(input())
  A[k - 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())

import numpy as np

points=np.array([K]*N)
dis = np.array([0]*N)
for i in range(Q):
    a = int(input())
    a=a-1
    dis[a]+=1

points-=Q
points += dis

for j in points:
    if j>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import numpy as np

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

for i in range(n):
    if point[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 = [0]*n
for i in range(q):
    A[int(input())-1] +=1

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

Submission status: Accepted

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

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

score = [k]*n
score = list(map(lambda x:x-q,score) )
for i in A:
     
    score[i-1]+=1

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

for i in range(N):

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

N,K,Q = inputIL()
A = inputILs(Q)

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

Submission status: Accepted

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

la = list()
for i in range(Q):
    la.append(int(input()))

lcount = [0] * N
for i in range(Q):
    lcount[la[i]-1] += 1

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

Submission status: Accepted

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

for i in range(q):
  tmp = A[i] - 1
  point[tmp] += 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())
# ans_list = [list(map(int,input().split())) for i in range(Q)]

ans_list = []
for i in range(Q):
    a = int(input())
    ans_list.append(a)
point_list = [K -Q]*N  #[i*0  for i in range(N)]

for i in range(Q):
    tem = ans_list[i] - 1
    point_list[tem] += 1

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
from collections import Counter as counter

ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
iix = lambda x:list(int(input()) for _ in range(x))
mix = lambda x:list(li() for _ in range(x))
##########
def main(n,k,q,a):
    c = counter(a)
    for i in range(1,n+1):
        print("Yes" if k-q+c[i] > 0 else "No")

n,k,q = mi()
a = iix(q)
main(n,k,q,a)

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
import itertools
import fractions
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################
 
N,K,Q=MI()
A=[K-Q]*N
q=[0]*Q
for i in range(Q):
    q[i]=II()

for x in q:
    A[x-1] +=1
for a in A:
    if a >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)]
A = sorted(A)
Acount = 0
j = 0

Point = []

for i in range(N):

    while j != len(A):
        if A[j] == i + 1:
            Acount += 1
            j +=1
        else:
            break

    Point.append(K - Q + Acount)

    Acount = 0

    if Point[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

for j in sc:
    print('Yes' if j > 0 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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


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

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

Submission status: Accepted

Solution code:
import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
n, k, q = map(int, input().split())
a = []
for _ in range(q):
    a.append(int(input()))
point = [k-q]*(n+1)
for i in range(q):
    point[a[i]] += 1
for i in range(1, n+1):
    if point[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = (int(x) for x in input().split())
P = [K]*N
for i in range (Q):
  get = int(input())
  P[get-1] += 1
for i in range (N):
  P[i] -= Q
  if P[i] > 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)
ans=["No"]*n
for i in range(n):
    if c[i+1]>q-k:
        ans[i]="Yes"
for i in range(n):
    print(ans[i])

Submission status: Accepted

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

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

y = Q - K
for x in l:
    if  x > y:
        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):
    a=int(input())
    A[a-1]+=1
    
for j in range(N):
    if A[j]>Q-K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from collections import Counter
n,k,q,*a=map(int,open(0).read().split())
a=Counter(a)
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())
A = [int(input()) for _ in range(Q)]

score = [K-Q] * (N+1)
for i in A:
    score[i] += 1
ans = '\n'.join('Yes' if p > 0 else 'No' for p in score[1:])
print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = [0]*n

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

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

Submission status: Accepted

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

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

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import collections

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

A_list = []

for _ in range(Q):
    A_list.append(int(input()))

A_list_collections = collections.Counter(A_list)
    
for n in range(1, N + 1):
    n_lost_point = Q - A_list_collections[n]
    if n_lost_point < K:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)

Submission status: Accepted

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

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

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

for n in p:
    if n+k>q:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

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


if __name__ == '__main__':
    q3()

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
from collections import Counter

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

A = Counter(A)

for i in range(N):
    if K > (Q - A[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 a in A:
	print("Yes") if a>0 else print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
#参加者のライフをPでリストに
P = [k-q]*n

for _ in range(q):
  A = int(input())
  P[A-1] += 1
  
for i in range(n):
  if P[i]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

for i in range(N):
  if P[i] <= 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)]
ans = [k]*n
for i in range(len(a)):
    ans[a[i]-1] += 1
for i in range(len(ans)):
    ans[i] -= q
    if ans[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)]

score = [0]*n
for i in a:
    score[i-1] += 1

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

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
point=list(k-q for _ in range(n))
ans=''
for i in range(q):
    x=int(input())
    point[x-1]+=1

for i in range(n):    
    if point[i]>0:
        ans+='Yes\n'
    else:
        ans+='No\n'
print(ans)

Submission status: Accepted

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

scores = [0] * N
for i in range(Q):
    scores[A[i]-1] += 1

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