import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int K = sc.nextInt();
		int Q = sc.nextInt();
		int[] A = new int[Q];
		int[] Point = new int[N];
		
		for(int i=0;i<Q;i++) {
			A[i] = sc.nextInt();
		}
		
		for(int i=0;i<N;i++) {
			Point[i] += K -Q;
		}
		
		for(int i =0;i<Q;i++) {
			int correct = A[i] - 1;
			Point[correct] += 1;
		}
		
		for(int i:Point) {
			if(i>0) {
				System.out.println("Yes");
			}else {
				System.out.println("No");
			}
		}
		
		sc.close();	
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz