import Data.List

sortedCount :: Integer -> [Integer] -> [Integer] -> [Integer]
sortedCount 0 _ acc = acc
sortedCount j [] acc = sortedCount (j-1) [] (0:acc)
sortedCount j (i:a) (x:acc) | i == j = sortedCount j a ((x+1):acc)
                            | otherwise = sortedCount (j-1) (i:a) (0:x:acc)

main = do
  n:k:q:_ <- map read . words <$> getLine :: IO [Integer]
  a <- map read . words <$> getContents :: IO [Integer]
  mapM (putStrLn . (\x -> if 0 < x then "Yes" else "No")) $ map (\x -> x + k - q) $ tail $ sortedCount n (reverse (sort a)) [0]
