import qualified Data.Map as M
import Data.List (sort)
import Control.Monad (replicateM, mapM)

compress :: (Eq a) => [a] -> [[a]]
compress [] = []
compress [x] = [[x]]
compress (x1:xs@(x2:_)) = if x1 == x2 then (x1:y):ys else [x1]:y:ys
    where (y:ys) = compress xs

main = do
    [n, k, q] <- map read . words <$> getLine :: IO [Int]
    a <- map read <$> replicateM q getLine :: IO [Int]
    let cnt = M.fromList . map (\x -> (head x, length x)) . compress $ sort a
    let result = map ((\x -> if x > 0 then "Yes" else "No") . (+ (k-q)) . val .(\x -> M.lookup x cnt)) [1..n]
    mapM putStrLn result
    where
        val (Just x) = x
        val Nothing = 0