def solve()
  n, k, q = gets.split(" ").map!(&:to_i)
  a = []
  q.times do |i|
    a.push((gets.to_i) - 1)
  end

  n.times do |i|
    if (k-q + (1 * a.count(i))) > 0
      p "Yes"
    else
      p "No"
    end
  end
end
solve()
