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

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

AC = Counter(A)

for key, value in AC.items():
    Ans[key-1] = K - Q + value

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

Solution (Python):
def attack_survival(n, k, q, ali):

    count = [0]*n
    ans = []

    for i in ali:
        count[i-1] += 1

    for i in range(n):
        if k+count[i]-q > 0:
            ans.append("Yes")
        else:
            ans.append("No")

    return ans

def main():
    n, k, q = map(int, input().split())
    ali = [int(input())for i in range(q)]
    ans = attack_survival(n, k, q, ali)
    for i in ans:
        print(i)

if __name__ == '__main__':
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue



ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


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


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

    N, K, Q = il()
    P = [K]*N
    ret = [0]*N
    A = iln(Q)
    
    for a in A:
        ret[a-1] += 1

    for n in range(N):
        point = P[n] - Q + ret[n]
        if point <= 0:
            print('No')
        else:
            print('Yes')


if __name__ == '__main__':
    main()

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 i in range(n):
    print("Yes" if P[i] > 0 else "No")

Solution (Python):
import sys
n,k,q = map(int,input().split())
if k > q:
    for _ in range(n):
        print("Yes")
    sys.exit()
p = [0 for i in range(n)]

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

for x in range(n):
    if k - q + p[x] >= 1:
        print("Yes")
    else:
        print("No")

Solution (Python):

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes) if b else print(no)
from collections import Counter,deque,defaultdict




n,k,q=n1()
a=n2(q)

b=defaultdict(int)
for i in a:
    b[i]+=1
for i in range(1,n+1):
    p0(k-q+b[i]>0)

Solution (Python):
import sys
n,k,q = map(int,input().split())
if k > q:
    for _ in range(n):
        print("Yes")
    sys.exit()
p = [0 for i in range(n)]

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

for x in range(n):
    if k - q + p[x] >= 1:
        print("Yes")
    else:
        print("No")

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

a = [0]*n

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

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

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

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

Solution (Python):
n,k,q=map(int,input().split())
l=[0]*n
for i 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")

Solution (Python):
from collections import Counter

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

counter = Counter()

for i in range(Q):
    counter[A_i[i]] += 1

for j in range(N):
    print('Yes' if Q - counter[j+1] < K else 'No')

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

p = [k]*n
a = [0]*q

for i in range(0,q):
  a[i] = int(input())

for i in range(0,n):
  p[i] = p[i] - q
for i in range(0,q):
  p[a[i]-1] += 1



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

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

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

for l in ll[1:]:
    if l+k-q <= 0:
        print("No")
    else:
        print("Yes")

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

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

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

Solution (Python):

def inp():
    return(int(input()))



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



def instr():
    s = input()
    return(list(s[:len(s)]))



def invr():
    return(map(int, input().split()))


N, K, Q = invr()
S = [K] * (N+1)
t = 0
for i in range(1, Q+1):
    a = inp()
    S[a] += 1
    t += 1

for i in range(1, N+1):
    if S[i] - t > 0:
        print("Yes")
    else:
        print("No")

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

scores = [0] * N

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

for i in range(N):
    if scores[i] > Q - K:
        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)]
scores = [K for _ in range(N)]
c = Counter(A)
for i in range(1, N + 1):
    scores[i - 1] -= Q - c[i]

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

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

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

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

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

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

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

import numpy as np

n = np.full(N, K)


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

n -= Q


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

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

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

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

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

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

Solution (Python):
import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

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

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

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

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

anss = ['Yes' if pt > 0 else 'No' for pt in pts]

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

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

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

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

Solution (Python):
import sys

n, k, q, *lst = map(int, sys.stdin.read().split())
point = [0] * (n + 1)
for i in lst:
  point[i] += 1
for idx, i in enumerate(point):
  if idx == 0:
    continue
  if k + i - q < 1:
    print('No')
  else:
    print('Yes')

Solution (Python):
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(1,n+1):
    if a[i] > q-k:
        print('Yes')
    else:
        print('No')

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

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

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


resolve()

Solution (Python):
from collections import defaultdict

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

dic = defaultdict(lambda:0)
for _ in range(Q):
  dic[int(input())] += 1

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

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

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

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

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

mem=[0]*n

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


print("\n".join("Yes" if k-q+m>0 else "No" for m in mem))

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

Solution (Python):
n, k, q = map(int, input().rstrip().split())
scores = {}
for i in range(q):
    a = int(input().rstrip())
    if scores.get(a):
        scores[a] += 1
    else:
        scores[a] = 1

mv = sum(scores.values())
l = [0 for i in range(n)]
for i in range(n):
    point = k - mv
    if scores.get(i + 1):
        point += scores.get(i + 1)

    r = 'Yes' if point > 0 else 'No'
    print(r)

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

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

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

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

for ii in range(n):
  if -q+p[ii]>0:
    print("Yes")
  else:
    print("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 K - Q + c[i] >= 1:
        print('Yes')
    else:
        print('No')

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

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

Solution (Python):


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

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

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

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

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

if __name__ == '__main__':
    main()

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

for i in a:
  
  if K + i > 0:
    print("Yes")
  else:
    print("No")

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

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

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 range(n):
    if ans[i]<=q-k and q-k>=0:
        print("No")
    else:
        print("Yes")

Solution (Python):

N, K, Q = map(int, input().split())
points = {}
for i in range(1, N + 1):
    points[i] = 0

for q in range(Q):
    A = int(input())

    
    points[A] += 1


for k in points.keys():
    if K - Q + points[k] > 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 for _ in range(N)]

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

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

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

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

Solution (Python):
import itertools
import math
import fractions
import functools
n, k, q = map(int, input().split())
a = []
for i in range(q):
    a.append(int(input()) - 1)

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

for i in range(n):
    if k-q+score[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-q]*n

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

for j in range(n):
  if p[j]>0:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
import math
def py():
    print("Yes")
def pn():
    print("No")
def iin():
    x = int(input())
    return x

neko = 0

n,k,q = map(int,input().split())
p = [k-q] * n
for i in range(q):
    p[iin()-1]+=1
for i in range(n):
    if p[i] > 0:
        py()
    else:
        pn()

Solution (Python):

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

Solution (Python):
import os, sys, re, math

(N, K, Q) = [int(n) for n in input().split()]

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

for a in answer_count:
    print('Yes' if a > 0 else 'No')

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

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


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

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

for a in A:
    print('Yes' if (K - Q + a) > 0 else 'No')

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

for s, a in zip(S[1:], A[1:]):
    if s - a > 0:
        print('Yes')
    else:
        print('No')

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

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

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

points = [k-q] * n
for i in range(q):
    t = int(input())
    points[t-1] += 1
print('\n'.join(['Yes' if p > 0 else 'No' for p in points]))

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

Solution (Python):
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

input = sys.stdin.readline

def main():
    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):
        if a[i] > 0:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

Solution (Python):
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

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

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

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

ac = Counter(a)

for i in range(n):
    p[i] -= 1*(q-ac[i+1])

[print("Yes" if j >= 1 else "No") for j in p]

Solution (Python):
N,K,Q = map(int,input().split())
point = [0]*N
for i in range(Q):
    a = int(input())
    point[a-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())
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):
n, k, q = map(int, input().split())
score = [0] * n
for _ in range(q):
    i = int(input())
    score[i-1] += 1
for j in range(len(score)):
    if score[j] > q - k:
        print('Yes')
    else:
        print('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(N):
  if K-Q+C.get(i+1,0)>0:
    print("Yes")
  else:
    print("No")

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

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

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

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

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

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

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

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

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

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

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))


def resolve():
    N,K,Q=pin()
    ar=[0]*N
    for i in range(Q):
        t,=pin()
        ar[t-1]+=1
    
    for a in ar:
        if a>Q-K:
            print("Yes")
        else:print("No")
            
        

resolve()

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

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

Solution (Python):

import numpy as np
from collections import deque
import collections
import itertools
import bisect
mod = 10 ** 9 + 7
N, K, Q = list(map(int, input().split()))
A = [0]*Q
for q in range(Q):
    A[q] = int(input())

seikai_num = [0]*(N+1)

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


for seikai in seikai_num[1:]:
    if (Q - seikai >= K):
        print('No')
    else:
        print('Yes')

Solution (Python):
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])

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):
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))

Solution (Python):
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)

Solution (Python):
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")

Solution (Python):

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 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)

Solution (Python):
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()

Solution (Python):



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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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')

Solution (Python):
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")

Solution (Python):
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


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")

Solution (Python):
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()

Solution (Python):
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")

Solution (Python):
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()