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[(n < q ? q : n)];
		int AC[] = new int[(n < q ? q : n)];

		for (int i = 0; i < q; i++)
			A[i] = sc.nextInt();
		for (int i = 0; i < (n < q ? q : n); i++)
			AC[i] = k - q;
		for (int i = 0; i < (n < q ? q : n); i++)
			if (i < q)
				AC[A[i] - 1] += 1;
		for (int i = 0; i < n; i++) {
			if (AC[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