object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer
  import java.util.Arrays.sort

  import scala.collection.mutable
  import math.{abs, max, min}
  import mutable.ArrayBuffer
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val X, Y, Z, K = ni()
    val A = nal(X)
    val B = nal(Y)
    val C = nal(Z)

    val AB_max = new KthMax(K)
    REP(X) { i =>
      REP(Y) { j =>
        AB_max.add(A(i) + B(j))
      }
    }
    val AB = AB_max.toArray
    debug(AB)

    val ABC_max = new KthMax(K)
    REP(AB.length) { i =>
      REP(Z) { j =>
        ABC_max.add(AB(i) + C(j))
      }
    }

    val ABC = ABC_max.toArray

    sort(ABC)
    REP_r(ABC.length) { i =>
      out.println(ABC(i))
    }
  }

  class KthMax(K: Int) {
    val heap = new LongMinHeap(K)

    def add(x: Long): Unit = {
      if (heap.length == K) {
        if (heap.min < x) {
          heap.removeMin()
          heap.add(x)
        }
      } else {
        heap.add(x)
      }
    }

    def toArray: Array[Long] = heap.toArray
  }

  class LongMinHeap(n: Int) {
    private val N = Integer.highestOneBit(n - 1) + 1 << 1
    private val heap = Array.ofDim[Long](N) // 1-indexed
    private var p = 0

    private def up(i: Int): Unit = {
      if (i >= 2) {
        val p = i / 2
        if (heap(i) < heap(p)) {
          val tmp = heap(p)
          heap(p) = heap(i)
          heap(i) = tmp
          up(p)
        }
      }
    }

    private def minchild(i: Int): Int = {
      if (i * 2 + 1 > p) {
        i * 2
      } else {
        if (heap(i * 2) < heap(i * 2 + 1)) i * 2
        else i * 2 + 1
      }
    }

    private def down(i: Int): Unit = {
      if (i * 2 <= p) {
        val mc = minchild(i)
        if (heap(i) > heap(mc)) {
          val tmp = heap(mc)
          heap(mc) = heap(i)
          heap(i) = tmp
          down(mc)
        }
      }
    }

    def add(x: Long): Unit = {
      p += 1
      heap(p) = x
      up(p)
    }

    def removeMin(): Unit = {
      heap(1) = heap(p)
      p -= 1
      down(1)
    }

    def min: Long = heap(1)
    def apply(i: Int): Long = heap(i + 1)
    def length: Int = p
    def toArray: Array[Long] = heap.slice(1, p + 1)
  }

  private val oj = System.getenv("ATCODER_DEBUG") == null

  def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }

  def debug(as: Array[Boolean]): Unit = DEBUG {
    debug(as.map(x => if(x) "1" else "0").mkString)
  }

  def debug(as: Array[Int]): Unit = DEBUG {
    debug(as.mkString(" "))
  }

  def debug(as: Array[Long]): Unit = DEBUG {
    debug(as.mkString(" "))
  }

  def debug(s: => String): Unit = DEBUG {
    System.err.println(s)
  }

  def debugL(num: => Long): Unit = DEBUG {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    REP(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    REP(n) { i =>
      REP(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }
  def TO(from: Int, to: Int)(f: Int => Unit): Unit = {
    REP(to - from + 1, from) { i =>
      f(i)
    }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Long]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}

Measured memory_bytes: 31000