
def solve():
    dp = [0] * N
    for i in range(Q):
        dp[A[i]-1] += 1
    for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp)

if __name__ == "__main__":
    N,K,Q = list(map(int, input().split()))
    A = [int(input()) for _ in range(Q)]
    solve()   def solve():
    dp = [0] * N
    for i in range(Q):
        dp[A[i]-1] += 1
    for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp) solve dp = [0] * N dp [0] * N [0] 0 N for i in range(Q):
        dp[A[i]-1] += 1
     i range(Q) range Q dp[A[i]-1] += 1 dp[A[i]-1] dp A[i]-1 A[i] A i 1 1 for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp) j range(N) range N if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp) K - (Q - dp[j]) > 0 K - (Q - dp[j]) K Q - dp[j] Q dp[j] dp j 0 print("Yes") print "Yes" print("No") print "No" if __name__ == "__main__":
    N,K,Q = list(map(int, input().split()))
    A = [int(input()) for _ in range(Q)]
    solve()   __name__ == "__main__" __name__ "__main__" N,K,Q = list(map(int, input().split())) N list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split K Q int(input()) for _ in range(Q) for _ in range(Q) _ range(Q) range Q for _ in range(Q) int(input()) int input() input A = [int(input()) for _ in range(Q)] A [int(input()) for _ in range(Q)] solve() solve def solve():
    dp = [0] * N
    for i in range(Q):
        dp[A[i]-1] += 1
    for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp) def solve():
    dp = [0] * N
    for i in range(Q):
        dp[A[i]-1] += 1
    for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp) solve Q = list(map(int, input().split())) list(map(int, input().split())) Q K,Q = list(map(int, input().split())) list(map(int, input().split())) K A = [int(input()) for _ in range(Q)] [int(input()) for _ in range(Q)] A N,K,Q = list(map(int, input().split())) list(map(int, input().split())) N

def solve():
    dp = [0] * N
    for i in range(Q):
        dp[A[i]-1] += 1
    for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp)

if __name__ == "__main__":
    N,K,Q = list(map(int, input().split()))
    A = [int(input()) for _ in range(Q)]
    solve()  
