import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int K = sc.nextInt();
		int Q = sc.nextInt();
		int[] mem = new int[N];
		for(int i = 0; i < Q; i++) {
			mem[sc.nextInt() - 1] += 1;
		}
		for(int i = 0; i < N;i++) {
			if(mem[i] > Q - K) {
				System.out.println("Yes");
			}else {
				System.out.println("No");
			}
		}
		//Q-Kの値よりAiに出てくる回数が小さいものを敗退でも良いかも
	}

}
/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