#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main() import sys sys YES = "Yes" YES "Yes" NO = "No" NO "No" def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template) solve p = [Q] * N p [Q] * N [Q] Q N for i in range(Q):
        p[A[i]-1] -= 1

     i range(Q) range Q p[A[i]-1] -= 1 p[A[i]-1] p A[i]-1 A[i] A i 1 1 for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

     i range(N) range N if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

     K - p[i]  > 0 K - p[i] K p[i] p i 0 print(YES) print YES print(NO) print NO return N: int N K: int K Q: int Q A: "List[int]" A def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A) main def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
     iterate_tokens for line in sys.stdin:
            for word in line.split():
                yield word
     line sys.stdin sys stdin for word in line.split():
                yield word
     word line.split() line.split line split yield word word tokens = iterate_tokens() tokens iterate_tokens() iterate_tokens N = int(next(tokens)) N int(next(tokens)) int next(tokens) next tokens K = int(next(tokens)) K int(next(tokens)) int next(tokens) next tokens Q = int(next(tokens)) Q int(next(tokens)) int next(tokens) next tokens int(next(tokens)) for _ in range(Q) for _ in range(Q) _ range(Q) range Q for _ in range(Q) int(next(tokens)) int next(tokens) next tokens A = [int(next(tokens)) for _ in range(Q)] A [int(next(tokens)) for _ in range(Q)] solve(N, K, Q, A) solve N K Q A if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main NO = "No" "No" NO def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A) def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A) main def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template) def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template) solve YES = "Yes" "Yes" YES
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    p = [Q] * N
    for i in range(Q):
        p[A[i]-1] -= 1

    for i in range(N):
        if K - p[i]  > 0:
            print(YES)
        else:
            print(NO)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()
