{-# OPTIONS_GHC -O2 #-}
{-# LANGUAGE BangPatterns          #-}
{-# LANGUAGE CPP                   #-}
{-# LANGUAGE MagicHash             #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE OverloadedStrings     #-}
{-# LANGUAGE TupleSections         #-}
{-# LANGUAGE TypeFamilies          #-}
{-# LANGUAGE ViewPatterns          #-}

import           Control.Applicative
import           Control.Exception
import           Control.Monad
import           Control.Monad.Primitive
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Data.Bool
import qualified Data.ByteString             as B
import qualified Data.ByteString.Char8       as C
import qualified Data.ByteString.Unsafe      as B
import           Data.Char
import qualified Data.Foldable               as F
import           Data.Function
import qualified Data.IntMap.Strict          as IM
import qualified Data.IntSet                 as IS
import qualified Data.List                   as L
import qualified Data.Map.Strict             as M
import           Data.Monoid
import           Data.Ord
import           Data.Primitive.MutVar
import qualified Data.Set                    as S
import           Data.Tuple
import qualified Data.Vector                 as V
import qualified Data.Vector.Generic         as G
import qualified Data.Vector.Generic.Mutable as GM
import qualified Data.Vector.Unboxed         as U
import qualified Data.Vector.Unboxed.Mutable as UM
import           Debug.Trace
import           Foreign                     hiding (void)
import           GHC.Exts
import           Unsafe.Coerce

main :: IO ()
main = do
    [x, y, z, k] <- map read.words <$> getLine :: IO [Int]
    xs <- U.unfoldrN x (C.readInt.C.dropWhile isSpace) <$> C.getLine
    ys <- U.unfoldrN y (C.readInt.C.dropWhile isSpace) <$> C.getLine
    zs <- U.unfoldrN z (C.readInt.C.dropWhile isSpace) <$> C.getLine
    putStr.unlines.map show $ solve k x y z xs ys zs

solve :: Int -> Int -> Int -> Int -> U.Vector Int -> U.Vector Int -> U.Vector Int -> [Int]
solve k x y z xs ys zs = U.toList . U.reverse . sumsTopK k xs $ sumsTopK k ys zs

sumsTopK :: Int ->U.Vector Int -> U.Vector Int -> U.Vector Int
sumsTopK k xs ys = U.drop (lenX * lenY - k)
    . radixSort64
    $ U.generate (lenX * lenY) $ \i ->
        let (x, y) = ix i
        in U.unsafeIndex xs x + U.unsafeIndex ys y
  where
    !lenX = U.length xs
    !lenY = U.length ys
    ix = flip quotRem lenY

data Node = Node !Int !Int !Int !Int deriving (Eq, Ord, Show)

encode :: Int -> Int -> Int -> Int
encode x y z = unsafeShiftL x 20 .|. unsafeShiftL y 10 .|. z

solve0 :: Int -> Int -> Int -> Int -> U.Vector Int -> U.Vector Int -> U.Vector Int -> [Int]
solve0 k x y z
        (U.reverse.radixSort64 -> xs)
        (U.reverse.radixSort64 -> ys)
        (U.reverse.radixSort64 -> zs)
    = take k . go IS.empty $ S.singleton (Node (priority 0 0 0) 0 0 0)
  where
    priority i j k
        | i < x, j < y, k < z = U.unsafeIndex xs i + U.unsafeIndex ys j + U.unsafeIndex zs k
        | otherwise = minBound
    node i j k = Node (priority i j k) i j k
    go !visited !set = case S.maxView set of
        Just (Node p i j k, set')
            | IS.notMember ijk visited -> p : go (IS.insert ijk visited) set''
            | otherwise -> go visited set''
          where
            !ijk = encode i j k
            set'' = F.foldl' (flip S.insert) set'
                . filter (\(Node p i j k) -> p /= minBound && IS.notMember (encode i j k) visited)
                $ [node (i + 1) j k, node i (j + 1) k, node i j (k + 1)]
        Nothing -> []

-------------------------------------------------------------------------------
radixSort64 :: U.Vector Int -> U.Vector Int
radixSort64 v = F.foldl' step v [0, 16, 32, 48]
  where
    mask k x = fromIntegral $ unsafeShiftR x k .&. 0xffff
    step v k = U.create $ do
        pref <- U.unsafeThaw
            . U.prescanl' (+) 0
            . U.unsafeAccumulate (+) (U.replicate 0x10000 0)
            $ U.map (flip (,) 1 . mask k) v
        res <- UM.unsafeNew $ U.length v
        U.forM_ v $ \x -> do
            let !masked = mask k x
            i <- UM.unsafeRead pref masked
            UM.unsafeWrite pref masked $ i + 1
            UM.unsafeWrite res i x
        return res
{-# INLINE radixSort64 #-}

type Parser a = C.ByteString -> Maybe (a, C.ByteString)

parseInt :: Parser Int
parseInt = C.readInt . C.dropWhile isSpace

parseInt2 :: Parser (Int, Int)
parseInt2 = runStateT $
    (,) <$> StateT (C.readInt . C.dropWhile isSpace)
        <*> StateT (C.readInt . B.unsafeTail)

parseInt3 :: Parser (Int, Int, Int)
parseInt3 = runStateT $
    (,,) <$> StateT (C.readInt . C.dropWhile isSpace)
        <*> StateT (C.readInt . B.unsafeTail)
        <*> StateT (C.readInt . B.unsafeTail)

parseInt4 :: Parser (Int, Int, Int, Int)
parseInt4 = runStateT $
    (,,,) <$> StateT (C.readInt . C.dropWhile isSpace)
        <*> StateT (C.readInt . B.unsafeTail)
        <*> StateT (C.readInt . B.unsafeTail)
        <*> StateT (C.readInt . B.unsafeTail)