def resolve():
    n, k, q = map(int, input().split())
    points = [k] * n
    for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
    points = map(lambda x: x - q, points)
    for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes')
resolve() def resolve():
    n, k, q = map(int, input().split())
    points = [k] * n
    for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
    points = map(lambda x: x - q, points)
    for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes') resolve n, k, q = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k q points = [k] * n points [k] * n [k] k n for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
     _ range(q) range q temp = int(input()) temp int(input()) int input() input points[temp - 1] += 1 points[temp - 1] points temp - 1 temp 1 1 points = map(lambda x: x - q, points) points map(lambda x: x - q, points) map lambda x: x - q x - q x q x points for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes') i points if i <= 0:
            print('No')
            continue
         i <= 0 i 0 print('No') print 'No' continue print('Yes') print 'Yes' resolve() resolve def resolve():
    n, k, q = map(int, input().split())
    points = [k] * n
    for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
    points = map(lambda x: x - q, points)
    for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes') def resolve():
    n, k, q = map(int, input().split())
    points = [k] * n
    for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
    points = map(lambda x: x - q, points)
    for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes') resolve
def resolve():
    n, k, q = map(int, input().split())
    points = [k] * n
    for _ in range(q):
        temp = int(input())
        points[temp - 1] += 1
    points = map(lambda x: x - q, points)
    for i in points:
        if i <= 0:
            print('No')
            continue
        print('Yes')
resolve()