require 'pp'

def gets; ARGF.gets; end

class Solver

  def main
    n, k, q = gets.chomp.split.map(&:to_i)

    ms = Array.new(n, 0)
    q.times do
      a = gets.chomp.to_i
      ms[a-1] += 1
    end

    # Q=10
    # K=8
    # 3回正解で勝ち抜け = 2回以下でアウト

    # Q=10
    # K=10
    # 1回正解で勝ち抜け = 0回以下でアウト
    #
    # Q=10
    # K=11
    # 0回正解でも勝ち抜け

    thresh = q - k
    ms.each do |p|
      if p <= thresh
        puts "No"
      else
        puts "Yes"
      end
    end
  end
end

if __FILE__ == $0
  Solver.new.main
end
