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

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

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

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

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

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

Solution (Python):
n,k,q=map(int,input().split())
x=[0]*n
answer=[]
for i in range(q):
  a=int(input())
  x[a-1]+=1
y=sum(x)
for j in range(n):
  if y-x[j]<k:
    answer.append("Yes")
  else:
    answer.append("No")
for s in answer:
  print(s)

Solution (Python):
import collections
N,K,Q=map(int,input().split())
l=[int(input()) for i in range(Q)]
c=collections.Counter(l)
for i in range(N):
	if Q-c[i+1]>=K:
		print('No')
	else:
		print('Yes')

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

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

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

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

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

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

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

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

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

Solution (Python):
N, K, Q = list(map(int, input().split()))
points = [K for x in range(N)]
points = list(map(lambda x: x-Q, points))
for i in range(Q):
    s = int(input())
    points[s-1] += 1

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

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

A = [0]*N

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

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

Solution (Python):

from copy import deepcopy


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

    if k > q or k > 100000:
        for i in range(n):
            print('Yes')
        return

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

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


if __name__ == "__main__":
    main()

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

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

for i in range(len(a)):
    clear_num = a[i]-1
    score[clear_num] += 1


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

Solution (Python):
import collections

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

lst = [input() for i in range(Q)]

c = dict(collections.Counter(lst))
for i in range(N):
  if (str(i+1) not in c):
    if (K - Q <= 0):
      print('No')
    else:
      print('Yes')
  else:
    if (K + c[str(i+1)] - Q <= 0):
      print('No')
    else:
      print('Yes')

Solution (Python):
from itertools import groupby

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



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

ans=[K-Q]*N

A.sort()

for key,value in groupby(A):
    ans[key-1] = K-Q+ len(list(value))

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

Solution (Python):
s = input().split()
n = int(s[0])
k = int(s[1])
q = int(s[2])
ans = [k - q] * n
for i in range(q):
  a_n = int(input())
  ans[a_n - 1] += 1
for j in ans:
  if j > 0:
    print('Yes')
  else:
    print('No')

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

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

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

Solution (Python):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
P = [K - Q]* N

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

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

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

present=[]
for i in range(n):
	present.append(0)

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

for i in range(len(present)):
	present[i]=present[i]-q+k

for i in present:
	if i>0:
		print("Yes")

	else:
		print("No")

Solution (Python):
import sys
input = sys.stdin.readline
N,K,Q =map(int,input().split())
lis = [0 for _ in range(N)]
for _ in range(Q):
    s = int(input())
    lis[s-1] += 1

ans = ["Yes" if i+K-Q>0 else "No" for i in lis]
print("\n".join(ans))

Solution (Python):



def main():


    N, K ,Q = map(int,input().split())
    base = K -Q
    baseList = [base] * N

    ansList = [ int(input()) for _ in range(Q)]
    for i in ansList:
        baseList[i-1] +=1
    
    for i in baseList:
        if i >= 1:
            print('Yes')
        else:
            print('No')









if __name__ == "__main__":
    main()

Solution (Python):

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

l = []
for i in range(n):
    l.append(k)

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

for i in l:
    if (i - q > 0):
        print("Yes")
    else:
        print("No")

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

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

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

if k<=q:
    for ans in anslist:
        if ans > q-k:
            print('Yes')
        else:
            print('No')

else:
    for m in range(n):
        print('Yes')

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


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

Solution (Python):
tmp = list(map(int,(input().split())))
n = tmp[0]
k = tmp[1]
q = tmp[2]

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

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Solution (Python):
from collections import defaultdict

d = defaultdict(int)

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

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

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

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


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

for j in range(n):
    points[j] -= q

    if points[j] > 0:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
from sys import stdin

def main():
    input = lambda: stdin.readline()[:-1]
    N, K, Q = map(int, input().split())
    A = [int(input()) for _ in [0] * Q]

    point = [0] * N
    for a in A:
        point[a-1] += 1
    for i, j in enumerate(point):
        point[i] = K + j - Q
    for i in point:
        print('Yes' if i > 0 else 'No')

main()

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

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

Solution (Python):
import itertools
n, k, q = map(int, input().split())
a = [0 for i in itertools.repeat(None, n)]
for i in itertools.repeat(None, q):
    t = int(input())
    a[t-1] += 1

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

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

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

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

Solution (Python):
import sys

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

if K> Q:
    for i in range(N):
        print('Yes')
    sys.exit()

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

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



for s in scores:
    if(s > Q-K):
        print('Yes')
    else:
        print('No')

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

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

for i in range(N):
    print('YNeos'[score[i] + K <= Q::2])

Solution (Python):

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

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

Solution (Python):
[n, k, q] = list(map(int, input().split()))
a = []
for i in range(q):
    a.append(list(map(int, input().split()))[0])
    
import numpy as np

player = [k] * n
player = np.array(player)

for _a in a:
    player[_a-1] += 1
    
player -= q
           
for _p in player:
    if _p > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import numpy as np

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


if __name__ == "__main__":
    test()

Solution (Python):
import sys
readline = sys.stdin.readline
write = sys.stdout.write
N, K, Q = map(int, readline().split())
base = 0
P = [K]*N
for i in range(Q):
    a = int(readline())
    P[a-1] += 1
    base += 1
for i in range(N):
    if P[i] <= base:
        write("No\n")
    else:
        write("Yes\n")

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

c = [0] * n
for ele in a:
	c[ele-1] += 1

for ele in c:
	point = k - q + ele
	if point > 0:
		print("Yes")
	else:
		print("No")

Solution (Python):
import collections
from sys import stdin


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    A = [int(input()) for _ in range(Q)]

    a = collections.Counter(A)

    for n in range(1, N+1):
        if K-(Q-a[n]) <= 0:
            print("No")
        else:
            print("Yes")


if __name__ == "__main__":
    main()

Solution (Python):
N,K,Q=[int(a) for a in 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("No")
    else:
        print("Yes")

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

ac = [int(0) for _ in range(N)]
for a in range(Q):
  an=int(input())
  ac[an-1]+=1

for a in range(N):

  if K+ac[a]>Q:
    print("Yes")
  else:
    print("No")

Solution (Python):
n, k, q = list(map(lambda x: int(x), input().split()))
kachinuke_point = [q - k + 1] * n

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

Solution (Python):
import numpy as np

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

A = []
answer = np.array([0]*N)
score = np.array([K]*N)

for _ in range(Q):
    A.append(int(input())-1)

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

answer = K - (Q - answer)

ans = np.where(answer>0, True, False)

for x in ans:
    if x:
        print("Yes")

    else:
        print("No")

Solution (Python):
N, K, Q = list(map(int, input().split()))
A = [0] * Q
P = [-Q] * N

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








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



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

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

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

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

Solution (Python):
N, K, Q = [int(num) for num in input().split(' ')]
A = [0 for i in range(N)]




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

Solution (Python):
TMP=input().split()
N=int(TMP[0])
K=int(TMP[1])
Q=int(TMP[2])

sanka=[0] * N

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

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

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

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

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

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

for ANS in ans:
    if ANS <= 0:
        print("No")
    else:
        print("Yes")

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

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

Points = map(lambda x: K - (Q - x), Points)

for point in Points:
    if point > 0:
        print("Yes")
    else:
        print("No")

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

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

life = [K] * N

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

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

for l in life:
    if l > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
'use strict'
N,K,Q  = map(int, input().split())
point_list = [K-Q] * N

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

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

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

score_1 = [K-Q for i in range(N)]
for i in range(Q):
    num1 = int(input())
    score_1[num1-1] = score_1[num1-1]+1

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

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

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

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

Solution (Python):


n, k, q = map(int, input().split())
point_list = [k-q]*n

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


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

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

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

Solution (Python):
N, K, Q = list(map(int, input().split()))
point = {}
for i in range(Q):
    player = int(input())
    point[player] = point.get(player, 0) + 1

for n in range(N):
    point_key = point.keys()
    if Q - K < 0:
        print("Yes")
    elif (n + 1) in point_key and point[n + 1] > Q - K:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys

def read():
	return int(sys.stdin.readline().rstrip())
def reads():
	return list(map(int, sys.stdin.readline().rstrip().split()))
def read_s(n: int):
	return list(map(int, [read() for _ in range(n)]))

N, K, Q = reads()
A = read_s(Q)

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

for a in A:
  S[a-1] += 1
  
for s in S:
  if K - Q + s > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):
n, k, q = [int(i) for i in input().split()]
a = [0] + [int(input()) for _ in range(q)]
score = [0] + [0] * n

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

Solution (Python):
import sys
input=sys.stdin.readline

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

a=[]

for i in range(q):
    a.append(int(input()))
    
b=[k]*n
c=[-q]*n

for j in a:
    c[j-1]+=1

for l in range(n):
    if b[l]+c[l]<=0:
        print("No")
    else:
        print("Yes")

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

a = [k]*n

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

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

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

Solution (Python):
import sys
import numpy as np
N, K, Q = [int(v) for v in input().split()]



A = np.zeros(Q, dtype = 'int64')
for i in range(Q):
    A[i] = int(sys.stdin.readline())

pt = np.zeros(N, dtype = 'int64')

for q in range(Q):
    pt[A[q] - 1] += 1

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

Solution (Python):
import sys
import math
from fractions import gcd





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

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

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

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

N,K,Q = map(int, sys.stdin.readline().split())


list_score = [0]*N

list_A = [list(map(int,list(sys.stdin.readline().split()))) for i in range(Q)]

for i in range(Q):
    list_score[list_A[i][0]-1] += 1

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

Solution (Python):
n, k, q = (int(x) for x in input().split())
A = [int(input()) for _ in range(q)]

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

for score in scores:
    print('Yes' if score > 0 else 'No')

Solution (Python):
import sys
import collections
sys.setrecursionlimit(4100000)

n,k,q = [int(i) for i in input().split()]
a = [int(input()) for _ in range(q)]
d = collections.defaultdict(int)
for b in a:
    d[b] += 1

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

Solution (Python):






import numpy as np





N, K, Q = map(int, input().split())
As = [int(input()) for i in range(Q)]
"""
6 3 4
3
1
3
2
"""






points = np.array([0]*N)
args = np.arange(1, N+1)





for i in range(Q):
    
    points[As[i]-1] += 1





points = points-Q+K





for b in points >= 1:
    if b:
        print('Yes')
    else:
        print('No')

Solution (Python):
from sys import stdin


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(stdin.readline().rstrip()) for _ in range(Q)]
    score = [0] * N
    for A in As:
        score[A - 1] += 1
    for s in score:
        x = K - (Q - s)
        print('Yes' if 0 < x else 'No')


if __name__ == "__main__":
    main()

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

Solution (Python):
nkq = input()
nkq = nkq.split()
n = int(nkq[0])
k = int(nkq[1])
q = int(nkq[2])
a = [0 for i in range(q)]
for i in range(q):
    a[i] = int(input())

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

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

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

Solution (Python):
def func():
    N, K, Q = map(int, input().split())
    Ncorrect = [0] * N

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

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

if __name__ == '__main__':
    func()

Solution (Python):
n, k, q = (int(i) for i in input().split())
a = [int(input()) for i in range(q)]
score = [k] * n
if k > q:
    for i in range(n):
      print("Yes")

else:
    for i in a:
        score[i-1] += 1
    for i in score:
        if i - q > 0:
            print("Yes")
        else:
            print("No")

Solution (Python):
n,k,q=map(int,input().split())
i=0
a=[]
j=0
tm=0
while i!=q:
    a.append(int(input()))
    i+=1
a.sort()
if k>q:
    i=0
    while i!=n:
        print("Yes")
        i+=1
else:
    i=0
    while i!=n:
        while j!=q:
            if a[j]==(i+1):
         
                tm+=1
                j+=1
            else:
                break

        if q-tm<k:
            print ("Yes")
        else:
            print("No")
        tm=0
        i+=1

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

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

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

for i in range(1, n+1):
    damage = q - count[i]
    if damage < k:
        print('Yes')
    elif damage >= k:
        print('No')

Solution (Python):
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('Yes')
    else:
        print('No')

Solution (Python):


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


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


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

Solution (Python):

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

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

X=[]
for i in range(N):
    X.append(int(K-Q))

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

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

Solution (Python):


if __name__ == "__main__":
    n, k, q = map(int, input().split(" "))
    scores = [0 for _ in range(n)]
    for _ in range(q): scores[int(input())-1] += 1
    for i in range(n):
        d = k-q+scores[i]>0
        print("Yes" if d else "No")

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

X = K-Q

atai = [X for _ in range(N)]

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

for i in range(N):
    if atai[i] <= 0:
        print('No')
    else:
        print('Yes')

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

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

for j in range(N):
    if B[j]>=1:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import copy
a, b, n = list(map(int, input().split()))
m = [int(input()) for _ in range(n)]

def dec1(n):
    return n - 1

p = [b-n]*a
p1 = copy.deepcopy(p)
for i, name in enumerate(m):
    p1[name-1] += 1

for i, name in enumerate(p1):
    if name <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
N,K,Q = map(int,input().split())
if K > Q:
    ans1 = ["Yes" for _ in range(N)]
    x = "\n".join(ans1)
    print(x)
else:
    a = Q-K+1
    h = {}
    for i in range(Q):
        res = int(input())
        if h.get(res):
            h[res] += 1
        else:
            h[res] = 1
    ans2 = ["Yes" if h.get(i+1) and h[i+1] >= a else "No" for i in range(N)]
    y = "\n".join(ans2)
    print(y)

Solution (Python):
from collections import Counter

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

Solution (Python):
from collections import Counter

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

for i in range(Q):
    pn[i] = input()

c =  Counter(pn)

for j in range(1, N + 1):
    if Q - c[str(j)] < K:
        ans = "Yes"
    else:
        ans = "No"
    print(ans)

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

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

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

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

for k, v in h.items():
    tmp = Q - v
    h[k] = K - tmp

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

Solution (Python):
N, K, Q = map(int, input().split(" "))
As = [int(input()) for i in range(Q)] 
ex = [0]*N

for q in As:
  ex[q-1] += 1

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

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

A = []
point = []
border = 0
for i in range(N):
    point.append(K)

for i in range(Q):
    A.append(int(input()))


for a in A:
    point[a-1] += 1
    border += 1


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

Solution (Python):
N, K, Q = map(int, input().split())
A = [K-Q]*(N+1)

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

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

Solution (Python):



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

table = [k] * n

for winnner in data:    
    table[winnner - 1] += 1

for j in range(n):
    table[j] -= q

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

Solution (Python):
n,k,q=map(int,input().split())
prev=0

if k>q:
    [print("Yes") for i in range(n)]
else:
    result=[0]*(n+1)
    while True:
        try:
            idx=int(input())
            result[idx]+=1
        except:
            break
    del result[0]
    
    for i in result:
        if i+k-q>0:
            print("Yes")
        else:
            print("No")

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

nP = [ K for i in range(N)]
 
for i in range(Q):
  Tmp = int(input())
  nP[Tmp - 1] += 1


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

Solution (Python):

N , K , Q = map(int , input().split())
point = [K] * N
for _ in range(Q):
    answer = int(input())
    point[answer - 1] += 1
point = list(map(lambda x : x - Q , point))
for i in range(N):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
from collections import Counter


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

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

    count = Counter(winners)

    k_sub_q = K - Q
    for i in range(1, N + 1):
        if k_sub_q + count.get(i, 0) > 0:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

Solution (Python):
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

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

Solution (Python):
import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

for i in range(correct):
  answer_person = int(input())-1
  tmp[answer_person] += 1

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")

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

for A in As:
  if A == 1:
    Points[1] = Points[1]  + 1
  elif A == N:
    Points[0] = Points[0] + 1
    Points[N-1] = Points[N-1] - 1
  else:
    Points[0] = Points[0] + 1
    Points[A-1] = Points[A-1] - 1
    Points[A] = Points[A] + 1

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

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

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

P = []
for i in range(N):
    P.append(K - Q)

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

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