import java.util.Scanner;

public class Main {
  public static void main (String[] args) {
    Scanner in = new Scanner(System.in);

    while (in.hasNext()) {
      int N = in.nextInt();
      int K = in.nextInt();
      int Q = in.nextInt();
      int[] point = new int[N];
 
      for (int i = 0; i < Q; ++i) {
        ++point[in.nextInt() - 1];       
      }

      for (int i = 0; i < point.length; ++i) {
        if (point[i] + 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