{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe

import qualified Data.ByteString.Char8 as B

import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

import Data.Int

readInt = readLn :: IO Int
readInts = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine
readNInts = readInt >>= flip replicateM readInt

which a b f = if f then a else b
mp [ a, b ] = ( a, b )

main = do
	[ x, y, z, k ] <- map fromIntegral <$> readInts
	[ as, bs, cs ] <- map ( reverse . sort . map ( fromIntegral ) ) <$> replicateM 3 readInts
	mapM_ print $ solve as bs cs k

solve as bs cs kk = runST $ do
	let
		x = length as
		y = length bs
		z = length cs
	as' <- newListArray ( 0, x - 1 ) as :: ST s ( STUArray s Int Int64 )
	bs' <- newListArray ( 0, y - 1 ) bs :: ST s ( STUArray s Int Int64 )
	cs' <- newListArray ( 0, z - 1 ) cs :: ST s ( STUArray s Int Int64 )
	res <- newSTRef []
	forM_ [ 0 .. x - 1 ] $ \i -> do
		forM_ [ 0 .. y - 1 ] $ \j -> do
			forM_ ( takeWhile ( \k -> ( i + 1 ) * ( j + 1 ) * ( k + 1 ) <= kk ) [ 0 .. z - 1 ] ) $ \k -> do
				a <- readArray as' i
				b <- readArray bs' j
				c <- readArray cs' k
				modifySTRef res ( a + b + c : )
	modifySTRef res ( take kk . reverse . sort )
	readSTRef res