def slove():

    import sys

    import bisect

    import collections

    import fractions

    import heapq

    input = sys.stdin.readline

    n, k, q = list(map(int, input().rstrip('\n').split()))

    a = [int(input().rstrip('\n')) for _ in range(q)]

    ls = [k-q] * n

    for v in a:

        ls[v-1] += 1

    for i in range(len(ls)):

        if ls[i] > 0:

            print("Yes")

        else:

            print("No")





if __name__ == '__main__':

    slove()

import sys





def solve():

    input = sys.stdin.readline

    mod = 10 ** 9 + 7

    n, k, q = list(map(int, input().rstrip('\n').split()))

    a = [int(input().rstrip('\n')) for _ in range(q)]

    ls = [0] * n

    for v in a:

        ls[v-1] += 1

    for i in range(n):

        if q - ls[i] < k:

            print("Yes")

        else:

            print("No")





if __name__ == '__main__':

    solve()

def slove():
    import sys
    import bisect
    import collections
    import fractions
    import heapq

    input = sys.stdin.readline
    n, k, q = list(map(int, input().rstrip("\n").split()))
    a = [int(input().rstrip("\n")) for _ in range(q)]
    ls = [k - q] * n
    for v in a:
        ls[v - 1] += 1
    for i in range(len(ls)):
        if ls[i] > 0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    slove()

import sys


def solve():
    input = sys.stdin.readline
    mod = 10**9 + 7
    n, k, q = list(map(int, input().rstrip("\n").split()))
    a = [int(input().rstrip("\n")) for _ in range(q)]
    ls = [0] * n
    for v in a:
        ls[v - 1] += 1
    for i in range(n):
        if q - ls[i] < k:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    solve()

-def slove(): -    import sys -    import bisect -    import collections -    import fractions -    import heapq +import sys + +def solve(): +    mod = 10**9 + 7 -    ls = [k - q] * n +    ls = [0] * n -    for i in range(len(ls)): -        if ls[i] > 0: +    for i in range(n): +        if q - ls[i] < k: -    slove() +    solve()