import collections

n,k,q = map(int,input().split())
pt = [int(input()) for i in range(q)]
ans = collections.Counter(pt)

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

n,k,q = map(int,input().split())
pt = [int(input()) for i in range(q)]
ans = collections.Counter(pt)

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