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 = [int(input()) for i in range(Q)]

import collections
c = collections.Counter(A)
c_i=c.items()

m=[K-Q]*N
for i in c_i:
    m[i[0]-1]=m[i[0]-1]+i[1]
o=[]

for i in m:
    if i<=0:
        o.append('No')
    else:
        o.append('Yes')
print('\n'.join(o))

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

N = [k]*n
Q = [q]*n
l = [0]*n
for i in a:
    l[i-1] += 1
hiku = [x-y for (x, y) in zip(Q, l)]
result = [x-y for (x, y) in zip(N, hiku)]
for i in result:
    if i>0:
        print("Yes")
    else:
        print("No")

Solution (Python):

N,K,Q=(int(x) for x in input().split())
a=[int(input()) for i in range(Q)]
l=[]
for j in range(N):
    l.append(K-Q)
for k in range(Q):
  l[a[k]-1]+=1

for n in range(N):
    if(l[n]>=1):
        print("Yes")
    else:
        print("No")

Solution (Python):
N,K,Q = map(int,input().split())
A_list = [int(input()) for _ in range(Q)]
ans = [K]*N
con = [0]*N

for i in A_list:
    con[i-1] += 1

ans = [x+y-Q for (x,y) in zip(ans,con)]

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

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

Solution (Python):





n,k,q = map(int, input().split())
each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")

Solution (Python):
inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")

Solution (Python):
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])






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

for j in range(q):
  ans = int(input())
  each_point[ans-1] += 1
 
happyo(n,each_point)

Solution (Python):
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>100000):
  for x in range(n):
    print("Yes")
  sys.exit()

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

for j in range(q):
  ans = int(input())
  each_point[ans-1] += 1
 
happyo(n,each_point)

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


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

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res


N,K,Q=LI()

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

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

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

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

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

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

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

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

ans=np.zeros(n)

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

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

Solution (Python):
I=list(map(int,open(0).read().split()))
n,k,q=I[:3]
a=I[3:]
p=[0]*n
for i in a:
    p[i-1]+=1
for i in p:
    if i<=q-k:
        print('No')
    else:
        print('Yes')

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

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

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

Solution (Python):

n, k, q = map(int, input().split())
d = {}
for _ in range(q):
    x = int(input())
    if x in d:
        d[x] += 1
    else:
        d[x] = 1

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

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

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

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

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

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

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

Solution (Python):
from collections import Counter


def main():
    N, K, Q = [int(i) for i in input().split()]
    A = [int(input()) for _ in range(Q)]
    counter = Counter(A)
    scores = [K - Q] * N
    for guest, win in counter.items():
        guest -= 1
        scores[guest] += win
    ans = ["Yes" if i > 0 else "No" for i in scores]
    print(*ans, sep="\n")


if __name__ == '__main__':
    main()

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

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

l = [0 for i in range(10**5)]

for i in answer:
    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())
a = [int(input()) for _ in range(q)]

players = [k-q for _ in range(n)]

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

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

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

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

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

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

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

cnt = [k for i in range(n)]

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

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

Solution (Python):
import sys

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

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


b = [k-q] * n


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

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

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

score=[K]*N
for i in range(Q):
    A=int(input().strip())
    score[A-1]+=1
score=list(map(lambda x: x-Q,score))

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

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

score=[K]*N
for i in range(Q):
    A=int(input().strip())
    score[A-1]+=1
score=list(map(lambda x: x-Q,score))

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

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


saved = [0] * n
for a in ans:
    saved[a - 1] += 1

for s in saved:
    if k - q + s > 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 points:
    if q-j >= k:
        print('No')
    else:
        print('Yes')

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

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


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

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

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

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

ls_p = [k] * n
ls_c = [0] * n

for i in range(q):
    ls_c[ls_a[i] - 1] += 1

for j in range(n):
    ls_p[j] += ls_c[j] - q

for l in range(n):
    if ls_p[l] > 0:
        print("Yes")
    elif ls_p[l] <= 0:
        print("No")

Solution (Python):
N, K, Q = map(int, input().split())
A = [int(input()) for _ 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

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

Solution (Python):
import sys
input=sys.stdin.readline
n,k,q=map(int,input().split())
a=list(int(input()) for _ in range(q))

times = list(q for _ in range(n))

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

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

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

i=1
while(i<=n):
    if(k-(q-a[i])>0):
        print("Yes")
    else:
        print("No")
    i+=1

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

point = [K-Q] * N

for i in range(len(A)):
    point[A[i]-1] += 1

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

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

for p in points:
    if (Q-p)>=K:
        print('No')
    else:
        print('Yes')

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

for point in results:
    if (Q - K + 1) <= point:
        print('Yes')
    else:
        print('No')

Solution (Python):

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

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

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

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

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

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

A = [k-q]*n
for i in range(0, q):
	A[ans[i]-1] += 1

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

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

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

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

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

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

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

points = [0] * n
for i in range(q):
    points[a[i]-1] += 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())
points = [k] * n


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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n,k,q=map(int,input().split())
    P=[k-q]*n
    for _ in range(q):
        a=int(input())
        P[a-1]+=1

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

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

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

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

Solution (Python):

import numpy as np
N, K, Q = map(int, input().split())
A = np.array([int(input()) for _ in range(Q)])
Res = np.zeros(N)
for a in A:
    Res[a-1] += 1
for i in range(N):
    print('Yes') if Res[i] > Q - K else print('No')

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

B = [K]*N

for a in A:
    B[a-1] += 1
B = list(map(lambda x:x-Q,B))
for b in B:
    if b>0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import math
import numpy as np

def main():
    N, K, Q = list(map(int, input().split()))
    points = [K-Q for _ in range(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')

if __name__ == '__main__':
    main()

Solution (Python):
N, K, Q = list(map(int, 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 = map(int,input().split())
a = [int(input()) for i in range(q)]
p = [k-q] * n

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

for r in p:
    if r >= 1:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def main():
    N, K, Q = LI()
    points = [0] * N
    A = []
    for _ in range(Q):
        a = I()
        points[a-1] += 1
    for i in range(N):
        if K + points[i] - Q > 0:
            print("Yes")
        else:
            print("No")

main()

Solution (Python):


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

points = [K - Q for i in range(N)]

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

for x in points:
    if x > 0:
        print("Yes")
    else:
        print("No")

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

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

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

    answer_dict = {}

    for _ in range(q):
        a = int(input())
        if a in answer_dict:
            answer_dict[a] += 1
        else:
            answer_dict[a] = 1

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

        print("No")


if __name__ == '__main__':
    main()

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

a = np.zeros(q,dtype = int)

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


score = np.array([k]*n)
sub = np.zeros(n,dtype = int)
for i in range(q):
    sub[a[i]-1] += 1

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

Solution (Python):

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

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

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





if __name__ == '__main__':
    main()

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

hito_dict = {(i+1) : ((n[2]-n[1])*-1) for i in range(n[0])}
for i in range(n[2]):
    d = int(input())
    hito_dict[d] = hito_dict[d] + 1
for j in range(n[0]):
    if hito_dict[j + 1] > 0:
        print('Yes')
    else:
        print('No')

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

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

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

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

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

ans = 0
for i in point:
    if i > 0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):

N, K, Q = map(int, input().split())
point_list = [K] * N
seikai_list = [0] * N

for _ in range(Q):
    Ai = int(input())
    seikai_list[Ai-1] += 1
    
for i in range(N):
    final_point = point_list[i] - Q + seikai_list[i]
    if final_point > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np 

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

member = np.array([K-Q]*N)

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

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

Solution (Python):
import collections

N,K,Q = map(int,input().split())
li = [int(input()) for i in range(Q)]
ans = [0]*N
lis = collections.Counter(li)
for w in lis:
    ans[w-1] = K-(Q-lis[w])
for i in range(N):
    if i+1 not in lis:
        ans[i] = K-Q
for i in range(N):
    if ans[i] <= 0:
        ans[i] = 'No'
    else:
        ans[i] = 'Yes'
    print(ans[i])

Solution (Python):
from collections import Counter
from operator import itemgetter
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
D = {i: 0 for i in range(1, N+1)}
D.update(Counter(A))
P = ["Yes" if K - (Q - k) > 0 else "No" for a, k in sorted(D.items(), key=itemgetter(0))]
print(*P, sep="\n")

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

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

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

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

Solution (Python):
import numpy as np

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

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

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

Solution (Python):
N,K,Q=map(int,input().split())
cnt=[0 for i in range(0,N+1)]
for i in range(Q):
    A=int(input())
    cnt[A]+=1
for i in range(1,N+1):
    if cnt[i]+K-Q<=0:
        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)]
c=Counter(A)
for i in range(1,n+1):
  if q-c[i]<k:
    print("Yes")
  else:
    print("No")

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    
    lastP = K - Q
    lists = []
    for i in range(N):
        lists.append(lastP)
    for n in A:
        lists[n-1] += 1
    
    for n in lists:
        print(YES if n > 0 else 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):
a,b,c=map(int,input().split())
d=[]
e=[]
for i in range(c):
  d.append(int(input()))
for i in range(a):
  e.append(b-c)
for i in d:
  e[i-1]+=1
for i in e:
  if i<=0:
    print('No')
  else:
    print('Yes')

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

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

    for l in r:
        if l<=0:
            print('No')
        else:
            print('Yes')

Solution (Python):
import sys 

N, K, Q = map(int, sys.stdin.readline().split())
A = (int(i) for i in sys.stdin.read().split())

l = [K - Q] * N
for i in A:
    l[i - 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())

arr = []

for i in range(q):
    arr.append(int(input()))

arr2 = [0] * n

for j in arr:
    arr2[j-1] += 1

border = q - k
for m in range(n):
    if arr2[m] > border:
        print("Yes")
    else:
        print("No")

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

cnt = [0] * N
for Ai in A:
    cnt[Ai - 1] += 1

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

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

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):
    ans=K-(Q-point[i])
    if ans>0:
        print("Yes")
    else:
        print("No")

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

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

sum_point = sum(point)

for i in range(N):
    ans = K - (sum_point - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, k, q = list(map(int, input().rstrip('\n').split()))
    a = [int(input().rstrip('\n')) for _ in range(q)]
    ls = [0] * n
    for v in a:
        ls[v-1] += 1
    for i in range(n):
        if q - ls[i] < k:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    solve()

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

L=[k-q]*n
for i in A:
    L[i-1]+=1

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

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

for _ in range(Q):
    A = int(input())
    list_winner.append(A)

for i in range(N):
    list_point.append(K)
    
    
def add(n):
    return n-Q
    
list_point_new = []

for i in list_point:
    list_point_new.append(add(i))
    
for i in range(Q):
    a = list_winner[i]-1
    list_point_new[a] = list_point_new[a] + 1
    
for i in range(N):
    if list_point_new[i] <= 0:
        print('No')
    else:
        print('Yes')

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

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

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

Solution (Python):
n=list(map(int,input().split()))
men=list([n[1]-n[2]]*n[0])
a=[int(input())-1 for i in range(n[2])]
for i in a:
    men[i]+=1
y = ["Yes" if i > 0 else "No" for i in men]
print('\n'.join(map(str, y)))

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

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

for i in s:
    if i < 1:
        print("No")
    else:
        print("Yes")

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

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