import java.util.HashMap;
import java.util.Map;
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();
		// ポイントの初期化
		Map<Integer, Integer> pointMap = new HashMap<Integer, Integer>();
		for (int i = 1; i <= n; i++) {
			pointMap.put(i, 0);
		}

		int x = 0;
		for (int i = 1; i <= q; i++) {
			x = sc.nextInt();
			pointMap.put(x, pointMap.get(x) + 1);
		}

		// 答えの出力
		for (int i = 1; i <= n; i++) {
			if (k - q + pointMap.get(i) > 0) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			}
		}
		sc.close();
	}
}

/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