
import Data.List
import Control.Monad
import Data.Maybe
import Data.Ord
import qualified Data.ByteString.Char8 as BS

readInts :: IO [Int]
readInts = map (fst . fromJust . BS.readInt) . BS.words <$> BS.getLine

readIntLists :: Int -> IO [Int]
readIntLists n = map (fst . fromJust . BS.readInt) <$> replicateM n BS.getLine

binarySearch value left right list | left >= right = 0
                                   | x == value = y
                                   | x < value = binarySearch value (mid + 1) right list
                                   | otherwise = binarySearch value left (mid - 1) list
                                        where
                                            mid = div (left + right) 2
                                            (x,y) = list !! mid

solve 0 k q ss = []
solve n k q ss = (if score + k - q > 0 then "Yes" else "No") : solve (n-1) k q ss
                    where
                        score = binarySearch (n) 0 (length ss) ss

elemCountOrd :: (Ord a) => [a] -> [(a, Int)]
elemCountOrd = map (\l -> (head l, length l) ) . group . sort

main = do
    [n,k,q] <- readInts
    aq <- readIntLists q
    putStr $ unlines $ reverse $ solve n k q (elemCountOrd aq)
