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 = list(map(int, [input() for _ in range(q)]))

sc = [k]*n
for a in A:
    sc[a-1] += 1

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

Solution (Python):
class ScoreBoard:
    def __init__(self, n, k):
        self.answerd = [0 for i in range(n)]
        self.init_score = k
        self.num_questions = 0

    def answer(self, i):
        ai = i - 1
        self.answerd[ai] += 1
        self.num_questions += 1

    def calc_score(self, i):
        answerd = self.answerd[i]
        return self.init_score - self.num_questions + answerd

    def isWon(self, i):
        return self.calc_score(i) > 0


def main():
    n, k, q = (int(i) for i in input().split(' '))

    score_board = ScoreBoard(n, k)

    for i in range(q):
        ai = int(input())
        score_board.answer(ai)

    for i in range(n):
        if score_board.isWon(i):
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys

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

status = [0]*N

input = sys.stdin.readline

need_win = Q-K+1


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


if need_win<=0:
    for _ in range(N):
        print('Yes')
    exit(0)

for i in range(N):
    print('Yes' if status[i]>=need_win else 'No')

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

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

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

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

Solution (Python):
import sys
import collections

def input():
    return sys.stdin.readline().strip()

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

N,K,Q=LIST()
A = [int(input())-1 for _ in range(Q)]

arr = [K] * N

c = collections.Counter(A)
for i in range(N):
    if i in c.keys():
        arr[i] -= Q - c[i]
    else:
        arr[i] -= Q

for val in arr:
    if 0 < val:
        print('Yes')
    else:
        print('No')

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

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

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

Solution (Python):
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

def main():
    """ main """
    N,K,Q = map(int, input().split())
    res = [0]*N
    for _ in range(Q):
        a = int(input())
        a -= 1
        res[a] += 1
    for x in res:
        if 0 < (K-Q+x): print('Yes')
        else: print('No')

if __name__ == '__main__':
    main()

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

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

Solution (Python):
N, K, Q = list(map(int, input().split(' ')))
yes = 'Yes'
no = 'No'


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


for a in A:
  if K + a - Q > 0:
    print(yes)
  else:
    print(no)

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

A = [int(input()) for _ in range(Q)]
W = [0] * N

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

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

Solution (Python):
def main():
    YES="Yes"
    NO="No"
    N,K,Q=map(int, input().split())
    point = [K-Q] * N
    for i in range(Q):
        point[int(input())-1] += 1
    for p in point:
        if p > 0:
            print(YES)
        else:
            print(NO)

if __name__ == '__main__':
    main()

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

n, k, q = map(int, input().split())
point = [0 for _ in range(n)]
for l in sys.stdin:
    point[int(l)-1] += 1




for p in point:
    if p >= (q - k) + 1:
        print('Yes')
    else:
        print('No')

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

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

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

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

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

scores = []
for j in range(n):
    scores.append(q)

for p in points:
    scores[p-1] = scores[p-1] - 1
    
for s in scores:
    if s <k:
        print("Yes")
    else:
        print("No")

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

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

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

for _ in range(q):
    a_ = int(input())
    a.append(a_)

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

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

Solution (Python):
participants,p,quiz=map(int,input().split())
answer_lst = [0 for _ in range(participants+1)]

for _ in range(quiz):
    answer = int(input())
    answer_lst[answer] = answer_lst[answer]+1

for i in range(1,len(answer_lst)):
    if p-(quiz-answer_lst[i]) > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):

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

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

sanka = [0]*n

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


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

Solution (Python):
a=list(map(int,input().split()))
A=[0]*a[0]
for i in range(a[2]):
    tmp=int(input())
    A[tmp-1]+=1
ans=['No','Yes']
for i in range(a[0]):
    print(ans[(a[1]+A[i]-a[2])>0])

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




pointA = [k] * (n+1)


for i in lisA:
	pointA[i] += 1

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

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

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

Solution (Python):
import sys
import collections

input = sys.stdin.readline

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

cnt=[0]*N

countA = collections.Counter(A)

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

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

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


ans = []
s = []
for i in range(n):
    
    s.append(k - q)

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

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

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


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

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

Solution (Python):
import sys


def input(): return sys.stdin.readline().strip()


def main():
    N, K, Q = map(int, input().split())
    win = [0] * N

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

    for w in win:
        is_win = K - (Q - w) > 0
        if is_win:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    main()

Solution (Python):
import numpy as np

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

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

Solution (Python):


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

Solution (Python):
from collections import Counter

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

cnt = Q-K

res = Counter(A)

for i in range(N):
    if cnt < res[i]:
        print('Yes')
    else:
        print('No')

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

Solution (Python):

import sys
import collections

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    result = {n:0 for n in range(N)}
    for a in A:
        result[a-1] += 1
    for k, v in result.items():
        if K - Q + result[k] <= 0:
            print('No')
        else:
            print('Yes')
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
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):
  if points[i] > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):
def main():
    N, K, Q = 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('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np
N,K,Q = map(int,input().split())
ans = [K-Q]*N
for i in range(Q):
  seikai = int(input())-1 
  ans[seikai] += 1
for i in range(N):
  if ans[i] > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):



N,K,Q=map(int,input().split())
Ans=[]
for _ in range(Q):
    hoge=int(input())
    Ans.append(hoge-1)

person=N*[K-Q]



for i in range(Q):
    person[Ans[i]]+=1
    
    
    
    
    
    
    


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

Solution (Python):
N,K,Q = [int(x) for x in input().split(" ")]
answer_count = [0 for k in range(N)]
for _ in range(Q):
    answer_count[int(input()) - 1] += 1
must_answer = Q - K + 1
for i in answer_count:
    if must_answer <= i:
        print("Yes")
    else:
        print("No")

Solution (Python):
import collections

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

c=collections.Counter(a)

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

Solution (Python):
from collections import Counter

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

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

Solution (Python):
n,k,q = map(int,input().split())
h = [k]*n

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

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

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

point_lim = Q - K
A = [0] * N

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

for i in range(N):
  print('Yes' if point_lim < A[i] else 'No')

Solution (Python):
import collections
N,K,Q = map(int,input().split())
A = []

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

for i in range(N):
  A.append(i+1)

counter = collections.Counter(A)
counter = [list(e) for e in counter.items()]
for i in range(N):
  counter[i][1] = counter[i][1]-1
  counter[i][1] = Q-counter[i][1]

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

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

Solution (Python):
import numpy as np

def main():
    N, K, Q = [int(x) for x in input().split()]
    X = np.array([K - Q] * N)
    for _ in range(Q):
        X[int(input())-1] += 1
    
    for x in X:
        if x > 0:
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    main()

Solution (Python):
import sys

def main():
	input = sys.stdin.readline

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

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

if __name__ == "__main__":
    main()

Solution (Python):
from collections import defaultdict


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

    l = defaultdict(int)

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

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


if __name__ == '__main__':
    p_c()

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

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

Solution (Python):


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

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

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

for n_win in n_win_list:
    if n_win >= Q-K+1:
        print("Yes")
    else:
        print("No")

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

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

ans=[False]*n
for key,v in a.items():
    if k-(q-v)>0:
        ans[key-1]=True

ss=set(a.keys())

for i in range(n):
    if i+1 in ss:continue
    if k-q>0:
        ans[i]=True
    


for e in ans:
    if e:
        print('Yes')
    else:
        print('No')

Solution (Python):
A,B,C=map(int,input().split())
count=[0]*A
for i in range(C):
    Ans=int(input())
    count[Ans-1]+=1
for i in range(A):
    if C-count[i]>=B:
        print("No")
    else:
        print("Yes")

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

arr = [0]*num


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

arr = [i-(q-k) for i in arr]

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

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

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

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

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

points = [0] * N

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

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

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

anslist=[0]*(n+1)
for i in range(q):
  a=int(input())
  anslist[a]=anslist[a]+1

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

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

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

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

for n_point in n_points:
    if n_point + k > q:
        print('Yes')
    else:
        print('No')

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

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

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

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

from collections import Counter
poi = Counter(A).most_common()

ans = [k-q]*(n+1)

for (i, cnt) in poi:
    ans[i] += cnt

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

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

mypoint = [0 for i in range(N)]




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






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

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

dic={}
for i in range(n):
  dic[i]=0

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

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

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

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

for i in A:
    if i>=1:
        print('Yes')
    else:
        print('No')

Solution (Python):
from collections import defaultdict

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

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



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

array = []
sum_d = sum(d)
for i in range(N):
    array.append(K-sum_d+d[i])

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

Solution (Python):
inps = list(map(int,input().split(" ")))
N = inps[0]
K = inps[1]
Q = inps[2]

Ap = [0] * N
for i in range(Q):
    a = int(input())

    Ap[a-1] += 1

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

Solution (Python):
import numpy as np
N,K,Q = map(int, input().split())

points = np.array([K-Q] * N)
getpoints = np.array([0] * N)

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

points += getpoints

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

Solution (Python):
a=input().split(" ")
N=int(a[0])
K=int(a[1])
Q=int(a[2])
list1=[]
list2=[]
for i in range(Q):
    list1.append(int(input()))
for i in range(N):
    list2.append(-Q+K)
for i in range(Q):
    list2[list1[i]-1]+=1
for i in range(N):
    if list2[i]>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K, Q = map(int,input().split())
scores = [K for _ in range(N)]
for _ in range(Q):
    answerer = int(input()) - 1
    scores[answerer] += 1
for final_score in scores:
    if final_score - Q <= 0:
        print("No")
    else:
        print("Yes")

Solution (Python):
if __name__ == "__main__":
  n, k, q = list(map(int, input().split()))
  A = [k-q]*n
  for _ in range(q):
    a = int(input())
    A[a-1] += 1

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

Solution (Python):
from collections import Counter

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

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

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

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

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


for i in m:
    ans = k-q+i
    if ans > 0:
        print('Yes')
    else:
        print('No')

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



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


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


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

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

for m in mp:
  if k - q + m > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):
class Solution(object):
    def __init__(self):
        pass
        
    def Sol(self, n, k, r):
        fq = dict([(i, 0) for i in range(0, n + 1)]) 
        t = 0
        for _r in r:
            fq[_r] += 1
            t += 1
        
        player = [k for i in range(0, n)]
        for i in range(0, n):
            player[i] = k - t + fq[i + 1]
        return player


def main():
    info = [int(e) for e in input().split()]
    r = []
    for _ in range(0, info[2]):
        r.append(int(input()))
    pl = Solution().Sol(info[0], info[1], r)
    for sc in pl:
        if sc <= 0:
            print('No')
        else:
            print('Yes')
    return 0

if __name__ == "__main__":
    main()

Solution (Python):
n, k, q = map(int, input().split())
l = ["No"]*n
l1 = [0]*n
s = 0
lol=0
for i in range(q):
    ip=int(input())
    s+=1
    l1[ip-1]+=1
for i in range(n):
    if l1[i]+k>s:
        l[i]="Yes"
for i in l:
    print(i)

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

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

Solution (Python):
N, K, Q = map(int, input().split())
points = [K] * N
for q in range(Q):
    i = int(input()) - 1
    points[i] += 1
for point in points:
    if (point - 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()))

sc = [0] * N

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

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

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

Solution (Python):
n, k, q = [int(v) for v in input().split()]
a_s = [int(input()) for _ in range(q)]
points = [0] * n

for a1 in a_s:
  a = a1 - 1
  points[a] += 1

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

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

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

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

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

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

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

score = [0] * N

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

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

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

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

score = [0] * n

for _ in range(q):
    a = int(input())
    score[a-1] +=1
    
s = sum(score)
for i in range(n):
    if k - (s-score[i]) <= 0:
        print("No")
    else :
        print("Yes")

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

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

Solution (Python):
import collections

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

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

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

Solution (Python):
import numpy as np
N, K, Q = map(int, input().split())
A = np.zeros(N, dtype=np.int32)
for idx in range(Q):
    A[int(input())-1] += 1

A = A + K - Q
for i in A:
    if i <= 0:
        print("No")
    else:
        print("Yes")

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

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


tmp = [0 for i in range(n)]
for i in range(q):
    answer = int(input())
    tmp[answer-1] += 1

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

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

A = [K-Q] * (N+1)

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

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

Solution (Python):
import sys
from pprint import pprint

def solve(n, k, q, a):
    ans = 0

    col = [0] * n
    for a_i in a:
        col[a_i - 1] += 1

    for col_i in col:
        if k - q + col_i > 0:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    n, k, q = map(int, sys.stdin.readline().strip().split(" "))
    a = []
    for _ in range(q):
        a.append(int(sys.stdin.readline().strip()))
    solve(n, k, q, a)