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 = [int(X) for X  in input().split()]
scores = [0 for i in range(N)]
for k in range(Q):
  q = int(input()) -1
  scores[q] +=1
  
for score in scores:
  if score >= Q - K + 1:
    print('Yes')
  else:
    print('No')

Solution (Python):

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

s = K-Q

points = [s] * N

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

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

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

score = [Q-K] * N

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

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

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

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

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

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

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

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

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

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

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

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

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


Slist=[0]*N


for i in Alist:

  Slist[i-1]=Slist[i-1]+1

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

Solution (Python):
import sys
import math
import numpy as np
import copy

def main():
    n, k, q = [int(t) for t in input().split()]
    dat = [k-q for _ in range(n)]
    for i in range(q):
        a = int(input())
        a -= 1
        dat[a] += 1

    print(*["Yes" if t > 0 else "No" for t in dat], sep="\n")


    return 0

if __name__ == '__main__':
    sys.exit(main())

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

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

for item in A:
    p[item-1] += 1

for item in p:
    if 0 < item:
        print("Yes")
    else:
        print("No")

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

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

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

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

for i in K_list:
  if i < 0:
    print "Yes"
  else:
    print "No"

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

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

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

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

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

Solution (Python):
p=input().rstrip().split(' ')
l=[int(p[1])]*int(p[0])
q=[0]*1000000;
for i in range(0,int(p[2])):
    o=int(input())
    q[o-1]+=1;
for i in range(0,int(p[0])):
    A=int(p[2])-q[i];
    l[i]-=A;

for i in range(0,len(l)):
    if l[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())
  A[a-1]+=1
for j in range(N):
  if A[j] > Q-K :
    print("Yes")
  else:
    print("No")

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

Solution (Python):
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

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

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

Solution (Python):
def main():
  N, K, Q = map(int, input().split()) 
  A = [int(input()) for i in range(Q)]  
  
  
  
  
  
  
  first = [K for i in range(N)]
  
  second = list(map(lambda x: x - Q, first))
  
  for i in range(Q):
    second[A[i]-1] += 1

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


if __name__ == '__main__':
  main()

Solution (Python):

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

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






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

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

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

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

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

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

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

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

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

for z in range(n):
  point.append(0)

for j in range(q):
  point[int(a[j])-1] += 1
  
for x in range(n):
  if point[x] > q-k:
    ans.append('Yes')
  else:
    ans.append('No')
  print(ans[x])

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

a_p = []
for i in range(N):
    a_p.append(Q)

for i in range(Q):
    a_p[a[i]-1] -= 1

result = []
for i in range(N):
    result.append(K - a_p[i])

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

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

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

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

Solution (Python):



s = [input() for i in range(1)]

N = int(s[0].split()[0])
K = int(s[0].split()[1])
Q = int(s[0].split()[2])


A = [int(input()) for i in range(2, Q+2)]


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


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


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

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


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

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

for ai in A:
    sanka[ai-1] += 1

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

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


participant_list = [K-Q] * N


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

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

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

for key,val in enumerate(data):
  if val + k - q > 0:
    index = int(key)
    res[index] = 1
for i in res:
  print('Yes' if i else 'No')

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

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

Solution (Python):
N,K,Q = (int(i) for i in input().split())

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

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

Solution (Python):
a=list(map(int,input().split()))
b=[a[2]]*a[0]
for i in range(a[2]):
  x=int(input())
  b[x-1]-=1
for i in b:
  if a[1]>i:
    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())
from collections import defaultdict
d = defaultdict(lambda :K-Q)
for i in range(Q):
  d[int(input())]+=1
for i in range(1,N+1):
  if d[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):
    a0 = int(input())
    a[a0-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())
members = [K-Q for _ in range(N)]
A = []
for i in range(Q):
    a = int(input())
    members[a-1] += 1

for k in members:
    if k < 1:
        print('No')
    else:
        print('Yes')

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from itertools import *
INF = 10**10

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

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

Solution (Python):
import numpy as np


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

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

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

for ans_person in ans_list:
    answer_num[ans_person-1] += 1

for an in answer_num:
    
    if K-(Q-an) > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import numpy as np

n, k, q = map(int, input().split())
A = [int(input())-1 for i in range(q)]
P = np.ones(n) * k - q
for a in A:
    P[a] += 1
P = np.where(P > 0, 'Yes', 'No')
for p in P:
    print(p)

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= list(map(int, input().split()))
A= [int(input()) for i in range(Q)]
B=[K-Q for i in range(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())
ans = [k-q for i in range(n)]
for i in range(q):
    a = int(input())
    ans[a-1] += 1

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

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

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

for aa in A:
    if K > Q - aa:
        print("Yes")
    else:
        print("No")

Solution (Python):
def solve(string):
    n, k, q, *a = map(int, string.split())
    t, b = [0] * n, q - k
    for _a in a:
        t[_a - 1] += 1
    return "\n".join(["Yes" if _t > b else "No" for _t in t])


if __name__ == '__main__':
    n, m, q = map(int, input().split())
    print(solve('{} {} {}\n'.format(n, m, q) + '\n'.join([input() for _ in range(q)])))

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

Solution (Python):
from collections import Counter


def solve(string):
    n, k, q, *a = map(int, string.split())
    a = Counter(a)
    return "\n".join(["Yes" if a.get(i + 1, 0) > q - k else "No" for i in range(n)])


if __name__ == '__main__':
    n, m, q = map(int, input().split())
    print(solve('{} {} {}\n'.format(n, m, q) + '\n'.join([input() for _ in range(q)])))

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

Solution (Python):
def solve(string):
    n, k, q, *a = map(int, string.split())
    t = [0] * n
    for _a in a:
        t[_a - 1] += 1
    return "\n".join(["Yes" if _t > q - k else "No" for _t in t])


if __name__ == '__main__':
    n, m, q = map(int, input().split())
    print(solve('{} {} {}\n'.format(n, m, q) + '\n'.join([input() for _ in range(q)])))

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

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

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

sum_damage = sum(damage)

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

Solution (Python):
def main():
    n, k, q = map(int, input().split(' '))
    a_s = [0] * n

    for _ in range(q):
        index = int(input()) - 1
        a_s[index] += 1
    
    for a in a_s:
        if (k-q+a) > 0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
import sys

n, k, q = map(int, sys.stdin.readline().split())

def solve():
	if k  > q:
		return [1]*n
	S = [k-q]*n
	for _ in range(q):
		i = int(sys.stdin.readline())
		S[i-1] += 1
	return S
S = solve()
for i in range(n):
	if S[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 = [0 for i in range(n)]

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

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

Solution (Python):
N, K, Q = map(int, input().split(' '))
score = [K for player in range(N)]
answers = [int(input()) - 1 for q in range(Q)]

for answer in answers:
    score[answer] = score[answer] + 1

score = [point - Q for point in score]

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

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

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

for p in P:
    if Q + 1 <= p:
        print('Yes')
    else:
        print('No')

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

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

for x in P:
    if Q + 1 <= x:
        print('Yes')
    else:
        print('No')

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

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

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

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

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
from queue import PriorityQueue
from fractions import gcd
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-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 _pf(s): return print(s, flush=True)

N, K, Q = LI()
A = [_I() for i in range(Q)]

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

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

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

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

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

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

points = np.array([K - Q for _ in range(N)])

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

for p in points:
    if p < 1:
        print('No')
    else:
        print('Yes')

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

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

Solution (Python):
import collections


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

Acount = collections.Counter(A)

for answerer, times in Acount.items():
    points[answerer - 1] += times



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

Solution (Python):


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

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

    participant_list = [k-q] * n


    for i in range(q):
        participant_list[a_list[i]-1] += 1

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

if __name__ == "__main__":
    main()

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

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

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

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

point = [0] * N

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

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

Solution (Python):


import math
import sys


DEBUG = False


def inp():
    return sys.stdin.readline().rstrip()


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def solve(N, K, Q, A):
    solved = [0] * N
    for a in A:
        solved[a] += 1

    def qualified(n):
        return Q - n < K

    return [qualified(n) for n in solved]


def main():
    N, K, Q = [int(e) for e in inp().split()]
    A = [int(input()) - 1 for _ in  range(Q)]

    ans = solve(N, K, Q, A)
    for a in ans:
        print('Yes' if a else 'No')


if __name__ == '__main__':
    main()

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

Solution (Python):
def get_answer(input_list):
    c_list = [int(v) for v in input_list[0].split(" ")]
    n = c_list[0]
    k = c_list[1]
    q = c_list[2]
    a = [int(v) for v in input_list[1:]]
    ns = [k - q] * n
    for aa in a:
        index = aa - 1
        ns[index] += 1
        """
        for i in range(len(ns)):
            if i != index:
                ns[i] -= 1
        """

    nr = [""] * n
    for i in range(len(ns)):
        if ns[i] <= 0:
            nr[i] = "No"
        else:
            nr[i] = "Yes"

    return nr



if __name__ == "__main__":
    input_list = []
    while True:
        try:
            input1 = input()
            if not input1:
                break
            if len(input1) == 0:
                break
            input_list.append(input1)
        except EOFError:
            break
    for a in get_answer(input_list):
        print(a)

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

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

initial_point = [(K-Q)]*N

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

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

Solution (Python):
def solve(n, k, q, a):
    v = [k] * n
    for a_i in a:
        v[a_i-1] += 1
    for v_i in v:
        if v_i > q:
            print("Yes")
        else:
            print("No")

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

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

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

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

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

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

for k in b:
    if k > 0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, K, Q = map(int, input().split())

score = [K-Q]*(N+1)
for _ in range(Q):
  a = int(input())
  score[a] += 1
[print("No" if ans < 1 else "Yes") for ans in score[1:]]

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

score = [K-Q]*(N+1)
for _ in range(Q):
  a = int(input())
  score[a] += 1
[print("No" if ans < 1 else "Yes") for ans in score[1:]]

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

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

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

Solution (Python):
n,k,q,*a=map(int,open(0).read().split())
l=[k-q]*n
for i in a:l[i-1]+=1
for i in l:print('YNeos'[1>i::2])

Solution (Python):
n,k,q,*a=map(int,open(0).read().split())
l=[k-q]*n
for i in a:l[i-1]+=1
for i in l:print('YNeos'[1>i::2])

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

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

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

Solution (Python):
import sys
n,k,q = map(int,input().split())
score = [k-q for i in range(n)]
a_i = [int(input())-1 for i in range(q)]


for i in range(len(a_i)):
    score[a_i[i]] += 1



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

Solution (Python):
nums = input().split()
nums = [int(i) for i in nums]

point = [0]*nums[0]
question =[nums[2]]*nums[0]
first = [nums[1]]*nums[0]

for i in range(nums[2]):
  a = int(input())
  point[a-1] += 1  
 
diff = [x - y for (x, y) in zip(question, point)]
result = [x - y for (x, y) in zip(first, diff)]
 
for i in result:
  if i >= 1:
    print("Yes")
  else:
    print("No")

Solution (Python):
m = list(map(int,input().split()))
n = [0] * m[0]

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

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

Solution (Python):
n, k, q = [int(x) for x in input().split()]
scores = {i: 0 for i in range(n)}

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

for score in scores.values():
  if k - q + score > 0:
    print('Yes')
  else:
    print('No')

Solution (Python):
import numpy as np

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

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

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

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

Solution (Python):
aten_num, sta_poi, corect_num = tuple(int(i) for i in input().split(" "))
aten_list = []
for i in range(aten_num):
    aten_list.append(0)
for i in range(corect_num):
    corect_aten = int(input())
    aten_list[corect_aten - 1] += 1
for i in range(aten_num):
    if sta_poi - corect_num + aten_list[i] > 0:
        print("Yes")
    else:
        print("No")

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

note = [0] * N

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

s = sum(note)

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