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];
		for(int i = 0;i < Q;i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		int[] point = new int[N];
		for(int i = 0;i < N;i++) {
			point[i] = K - Q;
		}
		for(int i = 0;i < Q;i++) {
			point[A[i]-1]++;
		}
		for(int i = 0;i < N;i++) {
			System.out.println(point[i] > 0 ? "Yes" : "No");
		}
	}
}
/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