Problem:
 Score: 300 points    Problem Statement  Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N . At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one ( -1 ) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i -th of which was given by Player A_i .
For Kizahashi, write a program that determines whether each of the N players survived this game.      Constraints   All values in input are integers.  2 \leq N \leq 10^5  1 \leq K \leq 10^9  1 \leq Q \leq 10^5  1 \leq A_i \leq N\ (1 \leq i \leq Q)         Input  Input is given from Standard Input in the following format:  N  K  Q  A_1  A_2  .  .  .  A_Q       Output  Print N lines. The i -th line should contain Yes if Player i survived the game, and No otherwise.        Sample Input 1 6 3 4
3
1
3
2      Sample Output 1 No
No
Yes
No
No
No  In the beginning, the players' scores are (3, 3, 3, 3, 3, 3) .   Player 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2) .  Player 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1) .  Player 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0) .  Player 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1) .   Players 1, 2, 4, 5 and 6 , who have 0 points or lower, are eliminated, and Player 3 survives this game.       Sample Input 2 6 5 4
3
1
3
2      Sample Output 2 Yes
Yes
Yes
Yes
Yes
Yes       Sample Input 3 10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9      Sample Output 3 No
No
No
No
Yes
No
No
No
Yes
No

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

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

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

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

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

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

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

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

a = [0]*n

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

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

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n,k,q = LI()
cnt = [0]*n
for _ in range(q):
    a = I()
    cnt[a-1] += 1

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

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

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

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
ts=time.time()
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
show_flg=False
show_flg=True

n,k,q=MI()
a=[]
p=[k-q]*n
for i in range(q):
    a.append(I())
    
while a:
    x=a.pop()
    p[x-1]+=1

for i in range(n):
    if p[i]>0:
        an=0
    else:
        an=1
        
    print(YN[an])

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

B = [K - Q] * (N + 1)
for a in A:
    B[a] += 1

for b in B[1:]:
    if b > 0:
        print("Yes")
    else:
        print("No")

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

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

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

Solution (Python):

import sys
from collections import Counter
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    c = Counter(A)
    for i in range(1, N+1):
        if K-(Q-c[i]) > 0:
            yes()
        else:
            no()
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    
    N,K,Q = map(int,input().split())
    from collections import defaultdict
    D = defaultdict(int)
    for i in range(Q):
        A = int(input())
        D[A] += 1
    for i in range(1,N+1):
        p = D[i]
        if K+p-Q>0:
            print("Yes")
        else:
            print("No")
    
    
    
main()

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Solution (Python):

n, k, q = (int(i) for i in input().split())
point=[0]*n
for i in range(q):
    an=int(input())
    point[an-1]+=1

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

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

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

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

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

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

for inp in range(q):
    a=int(input())
    AC[a]+=1

for score in AC[1:]:
    if q-score>=k:
        print("No")
    else:
        print("Yes")

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

    for i in range(n):
        scores[i] += success[i]
        if scores[i] > 0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

Solution (Python):

import sys
from collections import Counter
YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, Q: int, A: "List[int]"):
    c = Counter(A)
    for i in range(N):
        if K - Q + c[i+1] > 0:
            print(YES)
        else:
            print(NO)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(Q)]  
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

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

pts = [K-Q] * N
for a in A:
    pts[a-1] += 1

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

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

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

Solution (Python):
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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

    cntA = Counter(A)

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

    print(*ans, sep='\n')


sol()

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

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))



N,K,Q = II()
A = [I() for _ in range(Q)]

count = [K-Q]*N

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n,k,q = inpl()
a = inpln(q)
d = defaultdict(int)
for i in range(q):
    d[a[i]] += 1
for i in range(1,n+1):
    
    if q - d[i] < k:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

Solution (Python):

n, k, q = map(int,input().split())
A = [int(input()) for i 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("No")
    else:
        print("Yes")

Solution (Python):
import sys
input = sys.stdin.readline

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

    t = [Q] * N

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

if __name__ == "__main__":
    main()

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

l = [k - q for _ in range(n)]
for i in a:
    idx = i - 1
    l[idx] += 1

for i in l:
    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] * n

for x in a:
    score[x - 1] += 1

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

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

Solution (Python):

import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [0] * N
    for j in range(Q):
        p[A[j] - 1] += 1
    for i in range(N):
        if K - Q + p[i] > 0:
            print(YES)
        else:
            print(NO)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    Q = int(next(tokens))  
    A = [ int(next(tokens)) for _ in range(Q) ]  
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

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

points = [K-Q] * N

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

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

Solution (Python):
from collections import Counter
import sys
def input():
	return sys.stdin.readline()[:-1]


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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    s = input()
    if s == "Sunny":
        print("Cloudy")
    elif s == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")
    return


def B():
    s = S()
    for i in range(len(s)):
        if i%2:
            if s[i] not in ["L","U","D"]:
                print("No")
                return
        else:
            if s[i] not in ["R","U","D"]:
                print("No")
                return
    print("Yes")
    return


def C():
    n,k,q = LI()
    a = IR(q)
    f = [k-q]*(n)
    for i in range(q):
        ai = a[i]-1
        f[ai] += 1
    for i in f:
        if i <= 0:
            print("No")
        else:
            print("Yes")
    return


def D():

    return


def E():

    return


def F():

    return


if __name__ == "__main__":
    C()

Solution (Python):
from collections import defaultdict

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

d = defaultdict(int)
for a in A:
    d[a] += 1

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

Solution (Python):
n,k,q=map(int,input().split())
a=[int(input()) for _ in range(q)]
x=[k-q for _ in range(n)]
for t in a:
	x[t-1]+=1
for t in x:
	if t>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 range(N):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")

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

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

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

Solution (Python):

from collections import defaultdict
import sys

def inpl(): return list(map(int, input().split()))

N, K, Q = inpl()
X = [0]*N
for _ in range(Q):
    X[int(input())-1] += 1

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque


def main():
    num, k, q_num = map(int, input().split())
    data = [int(input()) for i in range(q_num)]

    now_num = 0
    dp = [k for i in range(num + 1)]
    seikai = [0 for i in range(num + 1)]
    for i in range(q_num):
        seikai[data[i]] += 1

    for i in range(num):
        if k - (q_num - seikai[i + 1]) > 0:
            print('Yes')
        else:
            print('No')



if __name__ == '__main__':
    main()

Solution (Python):
import sys
from collections import Counter

n, k, q = list(map(int, input().split()))
aaa = list(map(int, sys.stdin))
cnt = Counter(aaa)

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