module WildFlush
  def solve(n, k, a)
    ac = Array.new(n + 1, 0)
    a.each do |x|
      ac[x] += 1
    end
    ac[1..n].find{|x| x + ac[0] >= k} ? :Yes : :No
  end
  module_function :solve
end

n, k = gets.chomp.split(/\s+/).map(&:to_i)
aa = gets.chomp.split(/\s+/).map(&:to_i)
  
puts WildFlush.solve(n, k, aa)