def main():
    import bisect
    n, k, q = map(int, input().split())
    indic = {}
    for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
    for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
    


if __name__ == "__main__":
    main() def main():
    import bisect
    n, k, q = map(int, input().split())
    indic = {}
    for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
    for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
     main import bisect bisect n, k, q = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k q indic = {} indic {} for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
     _ range(q) range q a = int(input()) a int(input()) int input() input if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
     a in indic a indic indic[a] += 1 indic[a] indic a 1 indic[a] = 1 indic[a] indic a 1 for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
     i range(n) range n if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
         i+1 not in indic i+1 i 1 indic tensuu = k - q tensuu k - q k q tensuu = k - q + indic[i+1] tensuu k - q + indic[i+1] k - q k q indic[i+1] indic i+1 i 1 if tensuu <= 0:
            print('No')
        else:
            print('Yes')
     tensuu <= 0 tensuu 0 print('No') print 'No' print('Yes') print 'Yes' if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def main():
    import bisect
    n, k, q = map(int, input().split())
    indic = {}
    for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
    for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
     def main():
    import bisect
    n, k, q = map(int, input().split())
    indic = {}
    for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
    for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
     main
def main():
    import bisect
    n, k, q = map(int, input().split())
    indic = {}
    for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
    for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
    


if __name__ == "__main__":
    main()
