class Heap
  attr_reader :size

  def initialize
    @heap = []
    @size = 0
  end

  def add(n)
    i = @size
    while i > 0 do
      parent_index = (i - 1) / 2
      break if n < @heap[parent_index]

      @heap[i] = @heap[parent_index]
      i = parent_index
    end

    @heap[i] = n
    @size += 1
  end

  def pop
    return if @size <= 0
    min_n = @heap[0]
    @size -= 1
    n = @heap[@size]
    i = 0
    while i * 2 + 1 < @size do
      child_index1 = i * 2 + 1
      child_index2 = i * 2 + 2
      if child_index2 < @size && @heap[child_index2] >= @heap[child_index1]
        child_index1 = child_index2
      end
      break if @heap[child_index1] < n

      @heap[i] = @heap[child_index1]
      i = child_index1
    end
    @heap[i] = n
    min_n
  end
end

X, Y, Z, K = gets.split.map(&:to_i)
A = gets.split.map(&:to_i)
B = gets.split.map(&:to_i)
C = gets.split.map(&:to_i)

ab_heap = Heap.new
A.each do |a|
  B.each do |b|
    ab_heap.add(a + b)
  end
end

ab = K.times.map { ab_heap.pop }.compact

abc_heap = Heap.new
ab.each do |ab|
  C.each do |c|
    abc_heap.add(ab + c)
  end
end

K.times do
  puts abc_heap.pop
end