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, raw_input().split())
points = [0]*n
for _ in range(q):
    points[int(input())-1] += 1

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

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

Solution (Python):

import numpy as np
def receive_round_setting():
    round_settings = input()
    N, K, Q = round_settings.split(' ')
    N, K, Q = int(N), int(K), int(Q)
    participants = np.full(N, K, dtype='i')
    round_settings = {'N':N, 'K':K, 'Q':Q,
                    'participants':participants}
    return round_settings

def answer_question(round_settings):
    round_settings['participants'] -= 1*round_settings['Q']
    answerers = np.zeros(shape=round_settings['N'], dtype='i')
    for _ in range(round_settings['Q']):
        answerer = int(input()) - 1
        answerers[answerer] += 1
    round_settings['participants'] += answerers
    return round_settings
        
def announce_resutl(round_setting):

    [print('Yes') if participant > 0 else print('No')
    for participant in round_settings['participants']]

if __name__ == '__main__':
    round_settings = receive_round_setting()
    if round_settings['Q'] < round_settings['K']:
        announce_resutl(round_settings)
    else:
        round_settings = answer_question(round_settings)
        announce_resutl(round_settings)

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

for i in range(n):
    pts[i] = pts[i] + ans[i] - q

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

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

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

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

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

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

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

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


P = [K]*N

for i in range(len(P)):
    P[i] = P[i] - Q

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



for i in P:
    if(i >= 1):
        print("Yes")
    else:
        print("No")

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

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

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

Solution (Python):
from __future__ import print_function


import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq

def reduce(p, q):
    common = fractions.gcd(p, q)
    return (p//common , q//common )



import random


def main():
    n, k, q = map(int, input().split())
    a = [0 for i in range(q)]
    
    for i in range(q):
        a[i] = int(input())
        a[i] = a[i] - 1         

    
    
    
    
    
        
    
    
    

    
    
    
    
    

    index_p = 0 

    b = [0 for index_participant in range(n)]
    for index_q in range(q):          
       b[ a[index_q] ]+= 1
    for index_participant in range(n):          
        b[index_participant] += -q + k
        if b[index_participant] > 0:
            print("Yes")
        else:
            print("No")
    return

if __name__ == '__main__':
    main()

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

Solution (Python):

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



points = [i[1]- i[2]] * (i[0] )

correntCount = i[2]


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


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

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

win = [0 for i in range(n)]
for ai in a:
    win[ai-1] += 1

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

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

for i in range(N):
  if _[i]-Q+K > 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 i in point:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
from collections import deque, defaultdict, Counter

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

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

cntA = Counter(A)

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

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

points = [K-Q] * N

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

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

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

score = [0] * N

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

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

Solution (Python):
import collections

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

if K > Q:
    for n in range(N):
        print("Yes")
else:
    A = [K] * N
    answer_list = []

    for q in range(Q):
        answer_list.append(int(input()))

    answer_list_counts = collections.Counter(answer_list)

    is_clear = [False] * N
    for key in answer_list_counts:
        if K > Q - answer_list_counts[key]:
            is_clear[key - 1] = True


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

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

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

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

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

players = dict()

for i in range(N):
    players[i + 1] = 0

for _ in range(Q):
    winner = int(input())
    players[winner] += 1

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

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

Solution (Python):


import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq





def solve(f):
    n, k, q = f.read_int_list()
    a = [f.read_int() for _ in xrange(q)]
    p = [k] * n

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

    ans = []
    for i in xrange(n):
        ans.append("Yes") if p[i] > q else ans.append("No")

    return "\n".join(ans)


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case 
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

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

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

Solution (Python):
from collections import defaultdict
n, k, q = map(int, input().split())
d = defaultdict(int)
for i in range(q):
    tmp = int(input())
    d[tmp] += 1

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

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

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

import numpy as np

Nwin = np.zeros(N)



A = []

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



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

Solution (Python):


participant, point, correct = map(int, input("").split(" "))
indi_point = []

for i in range(participant):
    indi_point.append(0)

for i in range(correct):
    s_per = int(input(""))
    indi_point[s_per - 1] += 1

for i in range(participant):
    if point > correct - indi_point[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K, Q = [int(x) for x in input().split(' ')]
points = [0 for x in range(N)]

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

for n in range(N):
  print('Yes' if (Q-points[n]) < K else 'No')

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

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

for a in answer_count:
    if K - (Q - a) > 0:
        print("Yes")
    else:
        print("No")

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

     
for i in range(q):
      P[L[i] - 1] += 1

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    d = {"Sunny":1 , "Cloudy":2, "Rainy":0}
    a = ["Sunny", "Cloudy", "Rainy"]
    print(a[d[input()]])
    return


def B():
    s = S()
    for i, si in enumerate(s):
        if i % 2:
            if si == "R":
                print("No")
                return
        else:
            if si == "L":
                print("No")
                return
    print("Yes")
    return


def C():
    n, k, q = LI()
    d = [0] * n
    for _ in range(q):
        a = II() - 1
        d[a] += 1
    for a in d:
        if k - (q - a) > 0:
            print("Yes")
        else:
            print("No")
    return


def D():
    n, = LI()
    a = LI()
    q = []
    for ai in a:
        heappush(q, ai)
    for _ in range(m):
        heappush(q, heappop(q) / 2)
    ans = 0
    while q:
        ans += int(heappop(q))
    print(ans)
    return


def E():
    return


def F():
    return


if __name__ == '__main__':
    C()

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

















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

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

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

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

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

A_list = [int(input()) for i in range(Q)]
Point_list = [K-Q for i in range(N)]

for j in range(Q):
    Point_list[A_list[j]-1] += 1

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

    else:
        print("Yes")

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


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

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

Solution (Python):
a,b,c = map(int,input().split())
dp=[0]*a
l =[]
def Y(a,t = 0):
    if a==t : print('YES')
    else : print('NO')
def y(a, t =0):
    if a>t : print('Yes')
    else : print('No')
for i in range(c):
    d = int(input())
    dp[d-1]+=1
for i in dp:
    l.append(i+b-c)
    y(i+b-c)

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



a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

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





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

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

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

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

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

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

for x in v:
  if x + k - q > 0:
    print('Yes')
  else:
    print('No')

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

P = list(map(lambda x:x-Q, P))
for _ in range(Q):
	A = int(input()) -1
	P[A] += 1
			
for i in P:
	if i > 0:
		print('Yes')
	else:
		print('No')

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

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

ans = list()
for i in range(len(p_list)):
    if p_list[i] > 0:
         ans.append("Yes")
    else:
        ans.append("No")

for p in ans:
    print(p)

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

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

Solution (Python):
from sys import stdin
import numpy as np




def main():
    n, k, q = [int(x) for x in input().split()]
    points = [0] * n
    for i in range(q):
        ind = int(input()) - 1
        points[ind] += 1
    
    for i in range(n):
        points[i] = -q + points[i]
        
        points[i] += k
        
        if points[i] > 0:
            print("Yes")
        else:
            print("No")
    return


if __name__ == "__main__":
    main()

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

for a in a_list:
    p_list[a] += 1

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

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

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

Solution (Python):

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

p = [0]*(n+1)

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

for i in range(1,n+1):
  if p[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)]
p = [0 for i in range(n+1)]

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

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

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

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

A = [0] * Q

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

point = [0] * N

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

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

Solution (Python):


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

I = [0]*N

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

for i in I:
    if i > Q-K:
        print('Yes')
    else:
        print('No')

Solution (Python):






from sys import stdin,setrecursionlimit

import heapq



setrecursionlimit(10**6)
input=stdin.readline

n,k,q=map(int,input().split())
ans=[k-q]*n
for _ in range(q):
    a=int(input().rstrip())
    ans[a-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 = {i: 0 for i in range(1,n+1)}
points = []

for i in range(1,q+1):
    x = int(input())
    if x in a:
        a[x] += 1
    else: 
        a[x] = 1

tot = sum(a.values())
tot = -tot

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

Solution (Python):

import collections

N, K, Q = list(map(int, input().split()))
a_list = []

for _ in range(Q):
    a = int(input().split()[0])
    a_list.append(a)

p_list = [K] * N
a_counter = collections.Counter(a_list)
result_list = []

count_dict = {i + 1: 0 for i in range(N)}
count_dict.update(dict(a_counter))

for winner in range(1, N + 1):
    
    win_count = count_dict[winner]
    l_count = Q - win_count
    result = "Yes" if l_count < K else "No"
    result_list.append(result)

ans = "\n".join(result_list)
print(ans)

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

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

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

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

Solution (Python):
import numpy as np
n,k,q=[int(x) for x in input().split()]
j=0
v=np.zeros(n)
while j<q:
	i=int(input())
	v[i-1]+=1
	j+=1
j=0
while j<n:
	if(k>q-v[j]):
		print('Yes')
	else:
		print('No')
	j+=1

Solution (Python):
from collections import deque, defaultdict, Counter

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


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







cntA = Counter(A)



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

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


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





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



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

Solution (Python):

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

points = [K-Q for _ in range(N)]
for q in range(Q):
    collect = int(input()) - 1
    points[collect] += 1
for p in points:
    if p>0:
        print('Yes')
    else:
        print('No')

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

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

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

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

Solution (Python):


MOD = 10 ** 9 + 7

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

ans = [0] * N
for a in AQ:
    ans[a - 1] += 1
for i in range(N):
    if K - (Q - ans[i]) <= 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
tmp = input().split(" ")
person = int(tmp[0])
init_pt = int(tmp[1])
questions = int(tmp[2])
points = [0] * (person + 1)
  
for i in range(questions):
  points[int(input())] += 1
  
for i in range(1, person + 1):
  if points[i] > questions - init_pt:
    print("Yes")
  else:
    print("No")

Solution (Python):

import numpy as np

N, point, q = [int(x) for x in input().split()]
r_list = [q] * N
p_list = [point] * N
reduce_list = np.array(r_list)
points_list = np.array(p_list)

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

points_list = points_list - reduce_list

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

Solution (Python):

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


from collections import Counter
point = [(K-Q)] * N
C = Counter(A)

for i, j in C.items():
    point[(i-1)] += j

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

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

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

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

Solution (Python):


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

P = []

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

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

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

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

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


if __name__ == '__main__':
    solve()

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

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

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

for a in A_list:
    score_list[a-1] += 1

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

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

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



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

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

Solution (Python):
import numpy as np
N, K, Q = map(int, input().split())
score = np.array([K]*N)

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

score=score-Q

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

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

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

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

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

Solution (Python):

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

N_case =[]
i =0
while i <N :
  N_case.append(K-Q)
  i+=1

j =0
while j <Q :
  a = int(input())
  N_case[a-1] +=1
  j +=1


for n in N_case:
  if n>0:
    print('Yes')
  else:
    print('No')

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

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

for p in P:
    if k-p <= 0: print('No')
    else: print('Yes')

Solution (Python):
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[i-1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")

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

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

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

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

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

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

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

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

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

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

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

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

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

cnt_dct = {}
for i in range(Q):
    A = int(input()) - 1
    cnt_dct[A] = cnt_dct.get(A, 0) + 1

for i in range(N):
    cnt = cnt_dct.get(i, 0)
    
    if K + cnt > Q:
        print('Yes')
    else:
        print('No')

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20

N,K,Q = map(int,input().split())
win = [0 for _ in range(N)]
for i in range(Q):
    winner = int(input()) - 1
    win[winner] += 1
for i in range(N):
    if K - Q + win[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()))

points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
threshold = K - Q

for y in range(1, N+1):
    if threshold + points[y] > 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())-1]+=1

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