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

N, K, Q = map(int, input().split())
A = np.array([K]*N)-Q

correct = Counter([int(input())-1 for _ in range(Q)])


for i in range(N):
  if i in correct.keys():
    A[i] += correct[i]
  print("No" if A[i] < 1 else "Yes")

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

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

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

Solution (Python):

N, K, Q = map(int, input().split())
A = []
A = [int(input()) for i in range(Q)]
scores = [K-Q] * N
for i, A_ in enumerate(A):
    scores[A_-1] = scores[A_-1] + 1
outputs = ['Yes' if score > 0 else 'No' for i, score in enumerate(scores) ]
for i, output in enumerate(outputs):
    print(output)

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

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

for i in range(Q):

    A = int(input())-1

    k[A] += 1


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

    else:
        print('Yes')

Solution (Python):
n,k,q = map(int,input().split()) 
a = []
for i in range(q):
  a.append(int(input()))
def subPoints(n):
  return  n - len(a)
points = [k]*n
points = list(map(subPoints,points))
for cleared in a:
  points[cleared-1] += 1
for p in points:
  if p <= 0:
    print('No')
  else:
    print('Yes')

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


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


P = [0]*(N)

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

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

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

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

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

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

for out in man:
		if out <= 0:
				print("No")
		else:
				print("Yes")

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

cur_k = [k] * n

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

for i in cur_k:
  if (i > q):
    print("Yes")
  else:
    print("No")

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

l = n * [k]
for i in a:
    l[i - 1] += 1

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

Solution (Python):

import sys
input = sys.stdin.readline

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

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

for SCORE in score:
    if SCORE <= Q - K:
        print("No")
    else:
        print("Yes")

Solution (Python):
a,b,c = input().split()
n = int(a)
K = int(b)
Q = int(c)
CAList = []
AllP = []
for i in range(0,Q):
    CAList.append(int(input()))

for j in range(0,n):
    AllP.append(K-Q)

for k in range(0,Q):
    AllP[CAList[k]-1] += 1
    
for m in range(0,n):
    if AllP[m] >= 1:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys





A = [int(x) for x in input().split()]

N = A[0]
K = A[1]
Q = A[2]
B = K - Q
if K > Q:
    for i in range(Q):
        n = int(input())
    for i in range(N):
        print('Yes')
    sys.exit()
a = [B]*N

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

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

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):
    print("YNeos"[A[i]<=Q-K::2])

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

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

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

Solution (Python):


import sys
def input():
    return sys.stdin.readline()[:-1]

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

points = [K - Q] * N

for a in As:
    
    
    
    points[a-1] += 1
survive = ['Yes' if point >= 1 else 'No' for point in points]

print(*survive, sep="\n")

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

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

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

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

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

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

point_list = []
for i in range(N):
  point_list.append(K)

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

res = []
for i in point_list:
  i -= Q
  res.append(i)

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

Solution (Python):
n = input().split()
p = []

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

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

for i in p:
    i -= int(n[2])
    if 0 < i:
        print("Yes")
    else:
        print("No")

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


P = [K] * N


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



P_last = [i-Q for i in P]


for i in P_last:
    if i <= 0:
        print("No")
    else:
        print("Yes")

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

for i in range(Q):  
  Plist[Qlist[i]-1] += 1

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

Solution (Python):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] 
while True:
    try:
        listA.append(int(input()))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word-1]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')

Solution (Python):

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

Solution (Python):
from sys import stdin

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


p = [0]*n

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

s = sum(p)

for i in range(n):
    if k - s + p[i]  >0:
        print("Yes")

    else :
        print("No")

Solution (Python):
import numpy as np

NKQ = list(map(int, input().split()))

N = NKQ[0]
K = NKQ[1]
Q = NKQ[2]

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

negative = np.ones(N, dtype="int")

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

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

Solution (Python):
import sys
input = sys.stdin.readline
n, k, q = map(int, input().split())
def judge():
    val = {}
    for _ in range(q):
        a = int(input())
        val[a-1] = val.get(a-1,0) + 1
    
    for i in range(n):
        if val.get(i,k-q) + (k - q) > 0:
            print('Yes')
        else:
            print('No')
if k > q:
    print(*['Yes' for _ in range(n)])
else:
    ans = judge()

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

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

Solution (Python):
N,K,Q = [int(x) for x in input().split()]
AI = [0]*N
for _ in range(Q):
    ai = int(input())
    AI[ai-1] += 1
sum_a = sum(AI)

for ai in AI:
    if sum_a - ai >= K:
        print('No')
    else:
        print('Yes')

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

Solution (Python):
import sys
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""
import numpy as np
n,k,q =  map(int, sys.stdin.readline().split())
l=[0]*n
l = np.array(l)
l+=q



for i in range(q):
    a =  int(sys.stdin.readline())
    l[a-1]-=1

for e in l:
    if e >=k:
        print("No")
    else:
        print("Yes")

Solution (Python):
import numpy as np
def main():
  n, k, q = map(int,input().split())
  a=[int(input()) for i in range(q)]
  a = np.asarray(a)
  list = np.ones(n)*k
  list = list - q
  for i in range(q):
    list[a[i]-1] = list[a[i]-1] + 1
  for i in range(n):
    if 0<list[i]:
      print('Yes')
    else:
      print('No')

if __name__ == '__main__':
  main()

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

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

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

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

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

acc_list = []
for i in range(Q):
    acc_list.append(int(input()))

point_dict = {}
for i in range(1, N+1):
    point_dict[i] = 0

for a in acc_list:
    point_dict[a] += 1

for key, valu in point_dict.items():
    if (K - Q + valu) <= 0:
        print('No')
    elif (K - Q + valu) > 0:
        print('Yes')

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

point = [0] * N

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

point1 = []
for p in point:
    point1.append(K - (Q - p))

for p in point1:
    if p <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
import numpy as np


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

N=int(N)
K=int(K)
Q=int(Q)
arr=np.full(N, K)
arr-=Q
for i in range(Q):
	A=int(input())
	arr[A-1]+=1
for j in arr:
	if j>0:
		print("Yes")
	else:
		print("No")

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

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
  ans_list[key[i]-1] = val[i]

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")

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

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

m = [k-q] * n
for i in range(q):
    m[a[i]-1] = m[a[i]-1] + 1
    
for j in range(n):
    if m[j] <= 0:
        print("No")
    else:
        print("Yes")

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

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

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

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

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

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

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

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

val = K - Q
if val > 0:
    for i in range(N):
        print('Yes')
else:
    standard = abs(val) + 1
    for i in range(N):
        if P[i] >= standard:
            print('Yes')

        else:
            print('No')

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

point = [0] * N

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

point1 = []
for p in point:
    point1.append(K - (Q - p))

for p in point1:
    if p <= 0:
        print('No')
    else:
        print('Yes')

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

 
  

import collections
c = collections.Counter(a)
for i in range(n):
    
    if q-c[str(i+1)]<k:
        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())
p = [k-q] * n
for j in range(q):
    p[a[j]-1] = p[a[j]-1] + 1

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

Solution (Python):

from collections import Counter

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

Solution (Python):
import collections

N, K, Q = map(int, input().split())
m = Q - K + 1
A = [input() for _ in range(Q)]
C = collections.Counter(A)
Ans = []
for i in range(N):
    if m <= 0:
        Ans.append("Yes")
    elif C[str(i+1)] < m:
        Ans.append("No")
    else:
        Ans.append("Yes")

for i in range(N):
    print(Ans[i])

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

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

keys = list(range(1,N+1,1))
havePoint=[K]*N
dic = dict(zip(keys, havePoint))

for num in L:
    tmp = dic[num]+1
    dic[num]= tmp

for p in dic.values():
    if p-len(L)>0:
        print("Yes")
    else:
        print("No")

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

point = [K-Q] * N

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

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

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

for i in range(q):
    a = int(input())
    li.append(a)

for i in range(n):
    score.append(k)
    count.append(0)

for i in range(q):
    count[li[i]-1]+=1

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

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

for i in range(n):
  count.append(0)

for i in range(q):
  num = a[i]-1
  count[num] += 1;

for i in range(n):
  if( count[i] <= line):
    ans.append("No")
  else:
    ans.append("Yes")
p = '\n'.join(ans)
print(p)

Solution (Python):
import numpy as np
import sys

s=list(map(int,input().split()))
S=[]
for i in range(s[2]):
  S.append(int(input()))

P=np.array([s[1]-s[2]]*s[0])
for i in range(s[2]):
  P[S[i]-1]+=1

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

Solution (Python):
N=list(map(int,input().split(" ")))
ans=[int(input()) for i in range(N[2])]	

point=[N[1]-N[2] for i in range(N[0])]

for i in ans:
	point[i-1]+=1

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

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

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

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

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

members_p = list(k-q for _ in range(n))
a_list = []

for _ in range(q):
  a_list.append(int(input()))
  
for i in range(q):
  target_index = a_list[i]-1
  members_p[target_index] += 1

res = ['Yes' if member > 0 else 'No' for member in members_p]  
  
print(*res, sep = '\n')

Solution (Python):
N, K, Q = [int(v) for v in input().split(' ')]

count = [0] * N

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

for c in count:
    s = K - (Q - c)
    if s > 0:
        print('Yes')
    else:
        print('No')

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

test = {}
for i in A:
  if i in test:
    test[i]+=1
  else:
    test[i]=1

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

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

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

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

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

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

for i in range(N):
    P.append(int(K))


for i,x in enumerate(A):
    P[x-1] += 1


for i,x in enumerate(P):
    if x - Q > 0:
        print("Yes")
    else:
        print("No")

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

Score_list=[K]*N
Sum_list=[0]*N
for i in range(0,Q):
  Sum_list[A[i]-1]+=1
 
for i in range(0,N):
  if Q-Sum_list[i]>=K:
    print("No")    
  else:
    print("Yes")

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

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

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

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

Solution (Python):
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []

SCORE = [0] * N

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

Solution (Python):

"""
Created on Fri Sep 13 22:46:19 2019

"""


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


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

Point=[0]*N


for i in s:
    Point[int(i)-1]=Point[int(i)-1]+1


for i in Point:
    if i >(Q-K) :
        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
for a in point:
    print("Yes") if k-q+a>0 else print("No")

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

Solution (Python):


import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
        tokens = lines[0].split(" ")
        n = int(tokens[0])
        k = int(tokens[1])
        q = int(tokens[2])
        for i in range(q):
            lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
        tokens = lines[0].split(" ")
        n = int(tokens[0])
        k = int(tokens[1])
        q = int(tokens[2])

    a = []
    for i in range(q):
        a.append(int(lines[i+1]))

    return (n, k, q, a)


def solve(n, k, q, a):

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

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

    result = []
    for i in range(n):

        if k - (q - win[i]) > 0:
            result.append("Yes")
        else:
            result.append("No")

    return result


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r)
    else:
        print("%s" % result)


if __name__ == '__main__':

    main()

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

for i in range(1,n + 2):
    temp[i] += temp[i - 1]

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

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

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




P = [K for _ in range(N)]

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



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

Solution (Python):
from sys import stdin

n,k,q = [int(x) for x in stdin.readline().rstrip().split()]
li = []
for _ in range(q):
    li.append(stdin.readline().rstrip())
li = list(map(int, li))
p = k-q
lin = [p for _ in range(n)]
for i in range(q):
    lin[li[i]-1] += 1
for v in range(n):
    if lin[v] > 0:
        print("Yes")
    else:
        print("No")

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

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

for person in persons:
    if person <= 0:
        print("No")
    else:
        print("Yes")

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

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

    if K + (vet[i]-Q) <= 0:
        print("No")
    else:
        print("Yes")

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

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

List = [s+counter for s in List]

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

Solution (Python):
import numpy as np
n, k, q = input().split(' ')
n, k, q = int(n),int(k), int(q)
hum = [k]*n
for i in range(q):
    ind = input()
    hum[int(ind)-1] += 1
hum_last = np.array(hum)-q
for i in range(len(hum_last)):
    if hum_last[i] <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):

def main():
    N,K,Q = map(int,input().split())
    A=[int(input()) for i in range(Q)]
    Ns=[0 for i in range(N)]
    for i in A:
        Ns[i-1] += 1
    SUM = sum(Ns)
    for j in range(N):
        if K<=SUM-Ns[j]:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()

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

dict = {}
for _ in range(q):
    s = int(input())
    if s in dict.keys():
        dict[s]+=1
    else :
        dict[s]=1
for i in range(1, n+1):
    if not(i in dict.keys()):
        dict[i]=0

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

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

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

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

A = [0] * n
ans = ['No'] * n

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

for j in range(n):
    if (k + A[j] - q>0):
        ans[j] = 'Yes'
    print(ans[j])

Solution (Python):
N,K,Q,*A = map(int, open(0).read().split())

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


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

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

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

for i in range(q):
  temp = int(input())
  if temp in dict.keys():
    dict[temp] += 1
  else:
    dict.setdefault(temp, 1)
    
for i in range(1, n+1):
  if i not in  dict.keys():
    if k - q > 0:
      print('Yes')
    else:
      print('No')
  else:
    if k + dict[i] - q > 0:
      print('Yes')
    else:
      print('No')

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

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

    def calc(n):
        return n-Q

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

    P = list(map(calc, P))

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

Solution (Python):
from collections import defaultdict


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


if __name__ == "__main__":
    resolve()

Solution (Python):
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
a_c = collections.Counter(A)
cnt = 0
x = ['No'] * n
if q-k < 0:
	for a in range(n):
		print('Yes')
	exit()
for i,j in a_c.items():
  if j > q-k:
    x[i-1] = 'Yes'
for k in x:
	print(k)

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