import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n, k , q = inpm()
al = inplm(q)
l = []
for i in range(0, n):
    l.append(k)
for i in range(0, q):
    l[al[i] - 1] += 1
for i in range(0, n):
    print('Yes' if l[i] - q > 0 else 'No') import sys, bisect, math, itertools, string, queue, copy sys bisect math itertools string queue copy def inp(): return int(input()) inp def inpm(): return map(int,input().split()) inpm def inpl(): return list(map(int, input().split())) inpl def inpls(): return list(input().split()) inpls def inplm(n): return list(int(input()) for _ in range(n)) inplm n n list(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(input()) list input() input def inplL(n): return [list(input()) for _ in range(n)] inplL n n tuple(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) tuple(input()) tuple input() input def inplT(n): return [tuple(input()) for _ in range(n)] inplT n n list(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def inpll(n): return [list(map(int, input().split())) for _ in range(n)] inpll n n list(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) inplls n n n, k , q = inpm() n inpm() inpm k q al = inplm(q) al inplm(q) inplm q l = [] l [] for i in range(0, n):
    l.append(k) i range(0, n) range 0 n l.append(k) l.append l append k for i in range(0, q):
    l[al[i] - 1] += 1 i range(0, q) range 0 q l[al[i] - 1] += 1 l[al[i] - 1] l al[i] - 1 al[i] al i 1 1 for i in range(0, n):
    print('Yes' if l[i] - q > 0 else 'No') i range(0, n) range 0 n print('Yes' if l[i] - q > 0 else 'No') print 'Yes' if l[i] - q > 0 else 'No' l[i] - q > 0 l[i] - q l[i] l i q 0 'Yes' 'No' def inpls(): return list(input().split()) def inpls(): return list(input().split()) inpls def inplT(n): return [tuple(input()) for _ in range(n)] def inplT(n): return [tuple(input()) for _ in range(n)] inplT def inplL(n): return [list(input()) for _ in range(n)] def inplL(n): return [list(input()) for _ in range(n)] inplL k , q = inpm() inpm() k def inpll(n): return [list(map(int, input().split())) for _ in range(n)] def inpll(n): return [list(map(int, input().split())) for _ in range(n)] inpll def inp(): return int(input()) def inp(): return int(input()) inp def inpm(): return map(int,input().split()) def inpm(): return map(int,input().split()) inpm n, k , q = inpm() inpm() n def inpl(): return list(map(int, input().split())) def inpl(): return list(map(int, input().split())) inpl def inplm(n): return list(int(input()) for _ in range(n)) def inplm(n): return list(int(input()) for _ in range(n)) inplm def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) inplls q = inpm() inpm() q al = inplm(q) inplm(q) al l = [] [] l
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n, k , q = inpm()
al = inplm(q)
l = []
for i in range(0, n):
    l.append(k)
for i in range(0, q):
    l[al[i] - 1] += 1
for i in range(0, n):
    print('Yes' if l[i] - q > 0 else 'No')
