import java.util.Arrays;
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();
		}
		//N個分のポイントの配列を作成
		int point[] = new int[N];
      	//すべての要素をK-Qにする
		Arrays.fill(point, K-Q);
		//A[i]-1番目の要素に+1ずづ加算する
		for(int i=0; i<Q; i++) {
			point[A[i]-1]++;
		}
		//point[i]が0の場合はYes、そうでなければNo
		for(int i=0; i<N; i++) {
			if(point[i]<=0) {
				System.out.println("No");
			}else {
				System.out.println("Yes");
			}
		}
	}
}
/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