//Attack Survival
import java.util.*;
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 count1[]=new int[n+1];
    int count2[]=new int[n+1];
    int a[]=new int[n+1];

    for (int i=1;i<=q;i++) {
      int m=sc.nextInt();
      count1[m]++;
    }

    for (int i=1;i<=n;i++) {
      count2[i]=q-count1[i];
    }

    for (int i=1;i<=n;i++) {
      a[i]=k-count2[i];
      if (a[i]>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