import sys

# import bisect
# import numpy as np
from collections import deque
# map(int, sys.stdin.read().split())
# import heapq
#import bisect
#import math

from collections import Counter


def input():
    return sys.stdin.readline().rstrip()


def main():
    N,K,Q =map(int,input().split())
    A =[]
    for i in range(Q):
        A.append(int(input()))
    c = Counter(A)
    for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main() import sys sys from collections import deque from collections import Counter def input():
    return sys.stdin.readline().rstrip() input return sys.stdin.readline().rstrip() sys.stdin.readline().rstrip() sys.stdin.readline().rstrip sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline rstrip def main():
    N,K,Q =map(int,input().split())
    A =[]
    for i in range(Q):
        A.append(int(input()))
    c = Counter(A)
    for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No") main N,K,Q =map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split K Q A =[] A [] for i in range(Q):
        A.append(int(input()))
     i range(Q) range Q A.append(int(input())) A.append A append int(input()) int input() input c = Counter(A) c Counter(A) Counter A for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No") i range(N) range N if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No") K-Q+c[i+1] >0 K-Q+c[i+1] K-Q K Q c[i+1] c i+1 i 1 0 print("Yes") print "Yes" print("No") print "No" if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def main():
    N,K,Q =map(int,input().split())
    A =[]
    for i in range(Q):
        A.append(int(input()))
    c = Counter(A)
    for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No") def main():
    N,K,Q =map(int,input().split())
    A =[]
    for i in range(Q):
        A.append(int(input()))
    c = Counter(A)
    for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No") main def input():
    return sys.stdin.readline().rstrip() def input():
    return sys.stdin.readline().rstrip() input
import sys

# import bisect
# import numpy as np
from collections import deque
# map(int, sys.stdin.read().split())
# import heapq
#import bisect
#import math

from collections import Counter


def input():
    return sys.stdin.readline().rstrip()


def main():
    N,K,Q =map(int,input().split())
    A =[]
    for i in range(Q):
        A.append(int(input()))
    c = Counter(A)
    for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()
