def gi; gets.to_i end
def gs; gets.chomp end
def gli; gets.split(' ').map(&:to_i) end
def d(n); Math.log10(n).to_i + 1 end
class Integer
  # 約数の組み合わせを列挙する
  def divisor_combinations
    (1..Math.sqrt(self).to_i).
      select { |i| self % i == 0 }.
      map { |i| [i, self / i] }
  end
end

N, K, Q = gli
A_Q = [].tap { |a| Q.times { a << gi } }
scores = Array.new(N, K)
A_Q.each do |i|
  N.times do |n|
    scores[n] -= 1 if i - 1 != n
  end
end

N.times do |n|
  puts scores[n] > 0 ? 'Yes' : 'No'
end
