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

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

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

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

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

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

for i in range(N):
  if K - Q + getp[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
p = 0
for i in range(Q):
    B[A[i]-1] += 1
for i in range(N):
    if(B[i] > Q):
        print("Yes")
    else:
        print("No")

Solution (Python):
import bisect as bi

N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
B = [K]*N
p = 0
for i in range(N+1):
    A.append(i+1)
C = sorted(A)
for i in range(N):
    B[i] += bi.bisect_left(C,i+2) - p - 1
    p = bi.bisect_left(C,i+2)
for i in range(N):
    if(B[i] > Q):
        print("Yes")
    else:
        print("No")

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

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

points = [K] * N

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

for p in points:
    
    if p - Q > 0:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

Solution (Python):
import numpy as np
n,k,q = map(int,input().split())
a =np.array([k]*n)
a-=q
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(' '))
ls = [ K for i in range(N) ]
for i in range(Q):
    A = int(input())
    ls[A - 1] += 1
for i in ls:

    if i - Q > 0:
        print('Yes')
    else:
        print('No')

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

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

for ele in arr:
    if ele > 0:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

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

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



counts = [0 for i in range(N)]
for a in A:
  counts[a-1] += 1

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

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

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


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

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

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

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

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

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

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

Solution (Python):
import sys

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

if k>q:
    for i in range(n):
        print('Yes')
    sys.exit()

d=[0]*n

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

for j in d:
    if j>q-k:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import numpy as np
n,k,q = map(int, input().split())
p = np.full(n, k, dtype=np.int)
first = 0
for i in range(q):
    a = int(input())
    p -= 1
    p[a-1] += 1
for i in p:
    if i <= 0:
        print("No")
    else:
        print("Yes")

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

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

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
input=sys.stdin.readline
N,K,Q=map(int,input().split())
scores=[K-Q]*N
for _ in range(Q):
    scores[int(input())-1]+=1
for score in scores:
    print('Yes' if score>0 else 'No')

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

Solution (Python):
from collections import defaultdict

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

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

    for n in range(1, N+1):
        score = K - Q + cnt[n]

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

if __name__ == "__main__":
    main()

Solution (Python):
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
ans = []
def calc(n):
    return n-q
for i in range(n):
  ans.append(k)
ans = list(map(calc, ans))
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())
B = [0]*N
for _ in range(Q):
    a = int(input())
    B[a-1]+=1
S = sum(B)
for i in range(N):
    if S-B[i]>=K:
        print("No")
    else:
        print("Yes")

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

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

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

for m in M:
  if m<=0:
    print("No")
  else:
    print("Yes")

Solution (Python):
import numpy as np
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
  a = int(input())
  A.append(a)
participant = [] 
for i in range(N):
  participant.append(K)
participant_arr = np.array(participant) 
for i in range(Q):
  participant_arr -= 1
  participant_arr[A[i] - 1] += 1
for i in range(N):
  if participant_arr[i] > 0:
    print("Yes")
  else:
    print("No")

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

Solution (Python):
import numpy as np

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

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

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

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

Solution (Python):
people_num, start_point, correct_num = map(int, input().split())
table = [start_point] * people_num
for i in range(correct_num):
    correct_person = int(input())
    table[correct_person-1] += 1
for j in range(people_num):
    table[j] -= (1 * correct_num)
for k in range(people_num):
    if table[k] <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
from collections import Counter as c
N,K,Q,*A = map(int,open(0).read().split())

C = c(A)

for i in range(1,N+1):

  print("Yes" if K-Q+C.get(i,0)>0 else "No")

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

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

for p in Points:
    if p > 0:
        print('Yes')
    else:
        print('No')

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

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

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

ans = ['Yes' if K + v - Q > 0 else 'No' for v in l]

for a in ans:
    print(a)

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

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

for n in S:
  if n > 0:
    print("Yes")
  else:
    print("No")

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

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

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

Solution (Python):
import numpy as np
n, k, q = map(int, input().split())

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

for i in range(q):
    t = int(input())
    A[t-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())
L = list(int(input()) for _ in range(q))
A = [k-q]*n
for l in L:
  A[l-1] += 1
for a in A:
  print('Yes' if a > 0 else 'No')

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

Solution (Python):
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())


N,K,Q = MI()

X = [0]*(N+1)  
for _ in range(Q):
    a = I()
    X[a] += 1

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

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

num_list = [0] * (N+5)

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

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

Solution (Python):


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

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

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

if __name__ == "__main__":
    main()

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

Solution (Python):
import collections

n,k,q = map(int,input().split())
pt = [int(input()) for i in range(q)]
ans = collections.Counter(pt)

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

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

score = [K-Q]*N

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

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

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

ans = [k - q] * n

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

for t in ans:
    if t > 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 t in ans:
    if t > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K, Q = [int(x) for x in input().split()]
A = [int(input()) for _ in range(Q)]
Point = [Q for _ in range(N)]
for i in range(Q):
  Point[A[i]-1] -= 1
for i in range(N):
  if(K-Point[i])>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)]
count = Counter(a)
ans = [(k - q) for _ in range(n)]

list = ["No" for _ in range(n)]

for key, value in count.items():
    ans[key - 1] = k - q + value
    if ans[key - 1] > 0:
        list[key - 1] = "Yes"

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

Solution (Python):
import math
import collections
import itertools

def resolve():

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

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

Solution (Python):

n, k, q = map(int, input().split())
start_point = k - q
list = [start_point for i in range(n)]
for i in range(q):
    list[int(input()) - 1] += 1

for i in range(n):
    if list[i] >= 1: print('Yes')
    else: print('No')

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

L = [K for i in range(N)]

C = collections.Counter(A)

V = C.values()
I = C.items()
LI = list(I)


BOR = 0
M = []

for i in range(len(LI)):
    BOR = K - (Q - LI[i][1])
    if BOR > 0:
        M.append(LI[i][0])
        


M = [int(str) for str in M]


if K > Q:
    for i in range(1, N+1, 1):
        print("Yes")
    exit()

for i in range(1, N+1, 1):
    if i in M:
        print("Yes")
    else:
        print("No")

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

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

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

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

    point = [0] * 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")


if __name__ == "__main__":
    main()

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

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

L = [K]*N

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

for i in L:
    if i - Q > 0:
        print('Yes')
    else:
        print('No')

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

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

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

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

Solution (Python):

import sys
input=sys.stdin.readline
import numpy as np

def main():
    n,k,q = map(int,input().split())
    points=np.array([k]*n)
    i=0
    while i < q:
        point=int(input().rstrip())
        points-=1
        points[point-1]+=1
        i+=1
    for data in points:
        if data > 0:
            print("Yes")
        else:
            print("No")
if __name__=="__main__":
    main()

Solution (Python):
import sys
import math



input = sys.stdin.readline
 

def inp():
    return(int(input()))
def inara():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))



n,k,q=invr()

ara=[k]*n

for i in range(q):
	x=inp()
	x-=1
	ara[x]+=1

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

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

if K > Q:
	for i in range(N):
		print("Yes")
	exit()

T = [0 for i in range(N)]
t = Q - K

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

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

Solution (Python):
n,k,q = map(int,input().split())
count_dict = {s: 0 for s in range(1,n+1)}
for i in range(q):
    seikaisha = int(input())
    if seikaisha in count_dict:
        count_dict[seikaisha] +=1
    else:
        count_dict[seikaisha] = 0
count_dict_sorted = sorted(count_dict.items(), key=lambda x:x[0])


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

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

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

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

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

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

Solution (Python):
people,point,quiz = map(int,input().split())
an = [int(input()) for _ in range(quiz)]
each_p = [point-quiz] * people

for x in an:
    each_p[x-1] += 1

for y in each_p:
    if y <= 0:
        print("No")
    else:
        print("Yes")

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

d = {}
for a in a_l:
    if a in d.keys():
        d[a] += 1
    else:
        d[a] = 1
for i in range(n):
    if i+1 in d:
        if k-(q-d[i+1])>0:
            print('Yes')
        else:
            print('No')
    else:
        if k-q > 0:
            print('Yes')
        else:
            print('No')

Solution (Python):
import sys
import copy
import math
import itertools
import numpy as np
l = [int(c) for c in input().split()]
N=l[0]
K=l[1]
Q=l[2]
A=[int(input()) for c 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>0:
        print("Yes")
    else:
        print("No")

Solution (Python):


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

for ans in answers:
  if ans > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):
from collections import Counter
n,k,q = map(int,input().split())
if k>q:
  [print("Yes") for i in range(n)]
  exit()
  
a = [int(input()) for i in range(q)]
A = Counter(a)

ans = ['No']*n
for i in A:
    if k-q+A[i] > 0:
        ans[i-1] = 'Yes'
        
for i in ans:
    print(i)

Solution (Python):
N, K, Q = map(int, input().split())
ans = [0]*(N+1)
for i in range(Q):
    ans[int(input())] += 1
sum_ans = sum(ans)
for i in range(1,N+1):
    print('Yes' if K-(sum_ans-ans[i]) > 0 else '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 i in range(N):
  if p[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 i in range(N):
  if p[i] > 0: print('Yes')
  else: print('No')

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

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

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

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

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

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

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

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

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

Solution (Python):

"""
Created on Wed Sep  9 15:18:03 2020

@author: liang
"""
N, K, Q = map(int, input().split())
A = [0]*N
for i in range(Q):
    t = int(input())
    A[t-1] += 1


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

Solution (Python):
import collections

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

c = collections.Counter(a)

p = [k-q] * n
for i in list(c.keys()):
    p[i-1] += c[i]

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

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

for i in range(n):
	print("Yes") if k - q + points[i] > 0 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 p:
  print('Yes' if k-q+i>0 else 'No')

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

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

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

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

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

Solution (Python):

def input2():
	return map(int,input().split())
  
n,k,q=input2()
A=[int(input()) for _ in range(q)]

P=[0]*n


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

for p in P:
	if p >q-k:
		print("Yes")
	else:
		print("No")