#!/usr/bin/env python

# coding: utf-8



from collections import Counter



def ri():

    return int(eval(input()))



def rl():

    return list(input().split())



def rli():

    return list(map(int, input().split()))



def main():

    n, k, q = rli()

    ca = Counter()

    for _ in range(q):

        a = ri()

        ca[a] += 1

    for a in range(1, n+1):

        if k + ca[a] - q > 0:

            print("Yes")

        else:

            print("No")





if __name__ == '__main__':

    main()

#!/usr/bin/env python

# coding: utf-8



def ri():

    return int(eval(input()))



def rl():

    return list(input().split())



def rli():

    return list(map(int, input().split()))



def check(s):

    for i in range(len(s)):

        if s[i] != s[len(s)-1-i]:

            return False

    return True



def main():

    n, k, q = rli()

    solve = [0 for _ in range(n+1)]

    for i in range(q):

        a = ri()

        solve[a] += 1

    for i in range(n):

        if k-q+solve[i+1] > 0:

            print("Yes")

        else:

            print("No")



if __name__ == '__main__':

    main()

#!/usr/bin/env python
# coding: utf-8
from collections import Counter


def ri():
    return int(eval(input()))


def rl():
    return list(input().split())


def rli():
    return list(map(int, input().split()))


def main():
    n, k, q = rli()
    ca = Counter()
    for _ in range(q):
        a = ri()
        ca[a] += 1
    for a in range(1, n + 1):
        if k + ca[a] - q > 0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

#!/usr/bin/env python
# coding: utf-8
def ri():
    return int(eval(input()))


def rl():
    return list(input().split())


def rli():
    return list(map(int, input().split()))


def check(s):
    for i in range(len(s)):
        if s[i] != s[len(s) - 1 - i]:
            return False
    return True


def main():
    n, k, q = rli()
    solve = [0 for _ in range(n + 1)]
    for i in range(q):
        a = ri()
        solve[a] += 1
    for i in range(n):
        if k - q + solve[i + 1] > 0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

-from collections import Counter - - +def check(s): +    for i in range(len(s)): +        if s[i] != s[len(s) - 1 - i]: +            return False +    return True + + -    ca = Counter() -    for _ in range(q): +    solve = [0 for _ in range(n + 1)] +    for i in range(q): -        ca[a] += 1 -    for a in range(1, n + 1): -        if k + ca[a] - q > 0: +        solve[a] += 1 +    for i in range(n): +        if k - q + solve[i + 1] > 0: