	import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
 
	public Main() {
		// TODO 自動生成されたコンストラクター・スタブ
	}
 
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int len, rem;
		long n, k, q,index,ai,count;
		String s,t,answer;
		Map <Long,Long> mapA= new HashMap<Long,Long>();
		
			// 整数の入力
		
		n = sc.nextInt();
		k = sc.nextLong();
		q = sc.nextInt();
		LoopA: for(index=0;index<q;index++) {
			ai = sc.nextLong();
			if(mapA.containsKey(ai)) {
				count=mapA.get(ai);
				mapA.put(ai,count+1);
			}
			else{
				mapA.put(ai,1L);
			}
		}
		sc.close();

		 for(index=1;index<=n;index++) {
			if(mapA.containsKey(index)) {
				count=mapA.get(index);
			}
			else {
				count=0;
			}
			if(count+k-q>0) {
				System.out.println("Yes");
			}	
			else {
				System.out.println("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