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 point = sc.nextInt();
		int anser_C = sc.nextInt();

		int[] part = new int[N];
		//参加者に初期ポイントを付与
			Arrays.fill(part, point-anser_C);
		//anser_C回ループ
		for(int i = 1; i <= anser_C; i++ ) {
			//勝者の番号に+1加算する
			part[sc.nextInt()-1]++;
		}
		for(int i = 0; i<N; i++) {
			if(part[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